Simon Weber

Publication Activity (10 Years)

Years Active: 2023-2024
Publications (10 Years): 16

Top Topics

Fully Connected

Top Venues

Discret. Comput. Geom.

Publications

Daniel Bertschinger, Nicolas El Maalouly, Tillmann Miltzow, Patrick Schnider, Simon Weber
Topological Art in Simple Galleries. Discret. Comput. Geom. 71 (3) (2024)
Jonas Lill, Kalina Petrova, Simon Weber
Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound. CoRR (2024)
Michaela Borzechowski, John Fearnley, Spencer Gordon, Rahul Savani, Patrick Schnider, Simon Weber
Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents. CoRR (2024)
Michael Hoffmann, Tillmann Miltzow, Simon Weber, Lasse Wulf
Recognition of Unit Segment and Polyline Graphs is ∃R-Complete. CoRR (2024)
Patrick Schnider, Simon Weber
On the Complexity of Recognizing Nerves of Convex Sets. Comput. Geom. Topol. 3 (2) (2024)
Patrick Schnider, Simon Weber
A Topological Version of Schaefer's Dichotomy Theorem. SoCG (2024)
Michaela Borzechowski, John Fearnley, Spencer Gordon, Rahul Savani, Patrick Schnider, Simon Weber
Two Choices Are Enough for P-LCPs, USOs, and Colorful Tangents. ICALP (2024)
Daniel Bertschinger, Nicolas El Maalouly, Linda Kleist, Tillmann Miltzow, Simon Weber
The Complexity of Recognizing Geometric Hypergraphs. GD (1) (2023)
Michaela Borzechowski, Patrick Schnider, Simon Weber
An FPT Algorithm for Splitting a Necklace Among Two Thieves. CoRR (2023)
Patrick Schnider, Simon Weber
A Topological Version of Schaefer's Dichotomy Theorem. CoRR (2023)
Simon Weber, Joel Widmer
Realizability Makes A Difference: A Complexity Gap For Sink-Finding in USOs. WADS (2023)
Michaela Borzechowski, Simon Weber
On Phases of Unique Sink Orientations. CoRR (2023)
Michaela Borzechowski, Patrick Schnider, Simon Weber
An FPT Algorithm for Splitting a Necklace Among Two Thieves. ISAAC (2023)
Simon Weber, Josiah Rohrer
Reducing Nearest Neighbor Training Sets Optimally and Exactly. CCCG (2023)
Daniel Bertschinger, Christoph Hertrich, Paul Jungeblut, Tillmann Miltzow, Simon Weber
Training Fully Connected Neural Networks is ∃R-Complete. NeurIPS (2023)
Johannes Lengler, Anders Martinsson, Kalina Petrova, Patrick Schnider, Raphael Steiner, Simon Weber, Emo Welzl
On Connectivity in Random Graph Models with Limited Dependencies. APPROX/RANDOM (2023)