default search action
Simon Weber 0001
Person information
- affiliation: ETH Zurich, Switzerland
Other persons with the same name
- Simon Weber 0002 — Technical University of Munich, Munich, Germany
- Simon Weber 0003
(aka: Simon B. Weber) — Heinrich-Heine-Universität, Düsseldorf, Germany
- Simon Weber 0004
- Simon Weber 0005
- Simon Weber 0006 — University of Applied Sciences Konstanz, Konstanz, Germany
- Simon Weber 0007 — University of Rochester, Rochester, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j2]Patrick Schnider, Simon Weber:
On the Complexity of Recognizing Nerves of Convex Sets. Comput. Geom. Topol. 3(2): 2:1-2:8 (2024) - [j1]Daniel Bertschinger, Nicolas El Maalouly
Topological Art in Simple Galleries. Discret. Comput. Geom. 71(3): 1092-1130 (2024) - [c11]Patrick Schnider, Simon Weber
A Topological Version of Schaefer's Dichotomy Theorem. SoCG 2024: 77:1-77:16 - [c10]Michaela Borzechowski, John Fearnley, Spencer Gordon, Rahul Savani
Two Choices Are Enough for P-LCPs, USOs, and Colorful Tangents. ICALP 2024: 32:1-32:18 - [c9]Jonas Lill, Kalina Petrova, Simon Weber:
Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound. IPEC 2024: 2:1-2:19 - [i17]Michael Hoffmann, Tillmann Miltzow, Simon Weber
Recognition of Unit Segment and Polyline Graphs is ∃R-Complete. CoRR abs/2401.02172 (2024) - [i16]Michaela Borzechowski, John Fearnley, Spencer Gordon, Rahul Savani
Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents. CoRR abs/2402.07683 (2024) - [i15]Jonas Lill, Kalina Petrova, Simon Weber
Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound. CoRR abs/2407.01071 (2024) - [i14]Patrick Schnider, Linus Stalder, Simon Weber:
Unfairly Splitting Separable Necklaces. CoRR abs/2408.17126 (2024) - 2023
- [c8]Johannes Lengler
On Connectivity in Random Graph Models with Limited Dependencies. APPROX/RANDOM 2023: 30:1-30:22 - [c7]Simon Weber, Josiah Rohrer:
Reducing Nearest Neighbor Training Sets Optimally and Exactly. CCCG 2023: 113-121 - [c6]Daniel Bertschinger, Nicolas El Maalouly
The Complexity of Recognizing Geometric Hypergraphs. GD (1) 2023: 163-179 - [c5]Michaela Borzechowski, Patrick Schnider
An FPT Algorithm for Splitting a Necklace Among Two Thieves. ISAAC 2023: 15:1-15:14 - [c4]Daniel Bertschinger, Christoph Hertrich, Paul Jungeblut, Tillmann Miltzow, Simon Weber:
Training Fully Connected Neural Networks is ∃R-Complete. NeurIPS 2023 - [c3]Simon Weber
Realizability Makes A Difference: A Complexity Gap For Sink-Finding in USOs. WADS 2023: 704-718 - [i13]Josiah Rohrer, Simon Weber
Reducing Nearest Neighbor Training Sets Optimally and Exactly. CoRR abs/2302.02132 (2023) - [i12]Patrick Schnider, Simon Weber
On the Complexity of Recognizing Nerves of Convex Sets. CoRR abs/2302.13276 (2023) - [i11]Daniel Bertschinger, Nicolas El Maalouly, Linda Kleist, Tillmann Miltzow, Simon Weber
The Complexity of Recognizing Geometric Hypergraphs. CoRR abs/2302.13597 (2023) - [i10]Michaela Borzechowski, Simon Weber
On Degeneracy in the P-Matroid Oriented Matroid Complementarity Problem. CoRR abs/2302.14585 (2023) - [i9]Michaela Borzechowski, Patrick Schnider, Simon Weber
An FPT Algorithm for Splitting a Necklace Among Two Thieves. CoRR abs/2306.14508 (2023) - [i8]Patrick Schnider, Simon Weber
A Topological Version of Schaefer's Dichotomy Theorem. CoRR abs/2307.03446 (2023) - [i7]Michaela Borzechowski, Simon Weber
On Phases of Unique Sink Orientations. CoRR abs/2310.00064 (2023) - 2022
- [c2]Daniel Bertschinger, Nicolas El Maalouly, Tillmann Miltzow, Patrick Schnider
Topological Art in Simple Galleries. SOSA 2022: 87-116 - [i6]Daniel Bertschinger, Christoph Hertrich, Paul Jungeblut, Tillmann Miltzow, Simon Weber
Training Fully Connected Neural Networks is ∃R-Complete. CoRR abs/2204.01368 (2022) - [i5]Simon Weber
Realizability Makes a Difference: A Complexity Gap for Sink-Finding in USOs. CoRR abs/2207.05985 (2022) - [i4]Michaela Borzechowski, Joseph Doolittle, Simon Weber
A Universal Construction for Unique Sink Orientations. CoRR abs/2211.06072 (2022) - 2021
- [i3]Daniel Bertschinger, Nicolas El Maalouly, Tillmann Miltzow, Patrick Schnider, Simon Weber
Topological Art in Simple Galleries. CoRR abs/2108.04007 (2021) - [i2]Simon Weber
A Characterization of the Realizable Matoušek Unique Sink Orientations. CoRR abs/2109.03666 (2021)
2010 – 2019
- 2019
- [c1]Maciej Besta, Simon Weber
Slim graph: practical lossy graph compression for approximate graph processing, storage, and analytics. SC 2019: 35:1-35:25 - [i1]Maciej Besta, Simon Weber, Lukas Gianinazzi, Robert Gerstenberger, Andrey Ivanov, Yishai Oltchik, Torsten Hoefler:
Slim Graph: Practical Lossy Graph Compression for Approximate Graph Processing, Storage, and Analytics. CoRR abs/1912.08950 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-08 01:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: