Simon Weber

41 papers A* 4A 3B 4Journal 27Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
An FPT Algorithm for Splitting a Necklace Among Two Thieves.
Algorithmica
Michaela Borzechowski, Patrick Schnider, Simon Weber
2026 J jnl
Splitting Sandwiches Unevenly via Unique Sink Orientations and Rainbow Arrangements.
CoRR
Michaela Borzechowski, Sebastian Haslebacher, Hung P. Hoang, Patrick Schnider, Simon Weber
2025 J jnl
Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound.
Algorithmica
Jonas Lill, Kalina Petrova, Simon Weber
2025 J jnl
On Flipping Edge Sets in Unique Sink Orientations.
Graphs Comb.
Michaela Borzechowski, Simon Weber
2025 J jnl
On degeneracy in the P-matroid oriented matroid complementarity problem.
Discret. Optim.
Michaela Borzechowski, Simon Weber
2025 J jnl
Query-Efficient Fixpoints of ℓ
CoRR
Sebastian Haslebacher, Jonas Lill, Patrick Schnider, Simon Weber
2025 A* conf
Query-Efficient Fixpoints of ℓp-Contractions.
FOCS
Sebastian Haslebacher, Jonas Lill, Patrick Schnider, Simon Weber
2025 J jnl
Realizability in Matoušek Unique Sink Orientations: Characterization and Complexity Gap.
Electron. J. Comb.
Bernd Gärtner, Simon Weber, Joel Widmer
2025 A conf
Unfairly Splitting Separable Necklaces.
STACS
Patrick Schnider, Linus Stalder, Simon Weber
2024 A* conf
A Topological Version of Schaefer's Dichotomy Theorem.
SoCG
Patrick Schnider, Simon Weber
2024 B conf
Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound.
IPEC
Jonas Lill, Kalina Petrova, Simon Weber
2024 J jnl
Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound.
CoRR
Jonas Lill, Kalina Petrova, Simon Weber
2024 J jnl
On connectivity in random graph models with limited dependencies.
Random Struct. Algorithms
Johannes Lengler, Anders Martinsson, Kalina Petrova, Patrick Schnider, Raphael Steiner, Simon Weber, Emo Welzl
2024 J jnl
On the Complexity of Recognizing Nerves of Convex Sets.
Comput. Geom. Topol.
Patrick Schnider, Simon Weber
2024 B conf
Recognition of Unit Segment and Polyline Graphs is $\exists \mathbb {R} $-Complete.
WG
Michael Hoffmann, Tillmann Miltzow, Simon Weber, Lasse Wulf
2024 J jnl
Recognition of Unit Segment and Polyline Graphs is ∃R-Complete.
CoRR
Michael Hoffmann, Tillmann Miltzow, Simon Weber, Lasse Wulf
2024 J jnl
Topological Art in Simple Galleries.
Discret. Comput. Geom.
Daniel Bertschinger, Nicolas El Maalouly, Tillmann Miltzow, Patrick Schnider, Simon Weber
2024 A* conf
Two Choices Are Enough for P-LCPs, USOs, and Colorful Tangents.
ICALP
Michaela Borzechowski, John Fearnley, Spencer Gordon, Rahul Savani, Patrick Schnider, Simon Weber
2024 J jnl
Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents.
CoRR
Michaela Borzechowski, John Fearnley, Spencer Gordon, Rahul Savani, Patrick Schnider, Simon Weber
2024 J jnl
Unfairly Splitting Separable Necklaces.
CoRR
Patrick Schnider, Linus Stalder, Simon Weber
2023 J jnl
A Topological Version of Schaefer's Dichotomy Theorem.
CoRR
Patrick Schnider, Simon Weber
2023 B conf
An FPT Algorithm for Splitting a Necklace Among Two Thieves.
ISAAC
Michaela Borzechowski, Patrick Schnider, Simon Weber
2023 J jnl
An FPT Algorithm for Splitting a Necklace Among Two Thieves.
CoRR
Michaela Borzechowski, Patrick Schnider, Simon Weber
2023 A conf
On Connectivity in Random Graph Models with Limited Dependencies.
APPROX/RANDOM
Johannes Lengler, Anders Martinsson, Kalina Petrova, Patrick Schnider, Raphael Steiner, Simon Weber, Emo Welzl
2023 J jnl
On Degeneracy in the P-Matroid Oriented Matroid Complementarity Problem.
CoRR
Michaela Borzechowski, Simon Weber
2023 J jnl
On Phases of Unique Sink Orientations.
CoRR
Michaela Borzechowski, Simon Weber
2023 J jnl
On the Complexity of Recognizing Nerves of Convex Sets.
CoRR
Patrick Schnider, Simon Weber
2023 B conf
Realizability Makes A Difference: A Complexity Gap For Sink-Finding in USOs.
WADS
Simon Weber, Joel Widmer
2023 — conf
Reducing Nearest Neighbor Training Sets Optimally and Exactly.
CCCG
Simon Weber, Josiah Rohrer
2023 J jnl
Reducing Nearest Neighbor Training Sets Optimally and Exactly.
CoRR
Josiah Rohrer, Simon Weber
2023 — conf
The Complexity of Recognizing Geometric Hypergraphs.
GD (1)
Daniel Bertschinger, Nicolas El Maalouly, Linda Kleist, Tillmann Miltzow, Simon Weber
2023 J jnl
The Complexity of Recognizing Geometric Hypergraphs.
CoRR
Daniel Bertschinger, Nicolas El Maalouly, Linda Kleist, Tillmann Miltzow, Simon Weber
2023 A* conf
Training Fully Connected Neural Networks is ∃R-Complete.
NeurIPS
Daniel Bertschinger, Christoph Hertrich, Paul Jungeblut, Tillmann Miltzow, Simon Weber
2022 J jnl
A Universal Construction for Unique Sink Orientations.
CoRR
Michaela Borzechowski, Joseph Doolittle, Simon Weber
2022 J jnl
Realizability Makes a Difference: A Complexity Gap for Sink-Finding in USOs.
CoRR
Simon Weber, Joel Widmer
2022 — conf
Topological Art in Simple Galleries.
SOSA
Daniel Bertschinger, Nicolas El Maalouly, Tillmann Miltzow, Patrick Schnider, Simon Weber
2022 J jnl
Training Fully Connected Neural Networks is ∃R-Complete.
CoRR
Daniel Bertschinger, Christoph Hertrich, Paul Jungeblut, Tillmann Miltzow, Simon Weber
2021 J jnl
A Characterization of the Realizable Matoušek Unique Sink Orientations.
CoRR
Simon Weber, Bernd Gärtner
2021 J jnl
Topological Art in Simple Galleries.
CoRR
Daniel Bertschinger, Nicolas El Maalouly, Tillmann Miltzow, Patrick Schnider, Simon Weber
2019 J jnl
Slim Graph: Practical Lossy Graph Compression for Approximate Graph Processing, Storage, and Analytics.
CoRR
Maciej Besta, Simon Weber, Lukas Gianinazzi, Robert Gerstenberger, Andrey Ivanov, Yishai Oltchik, Torsten Hoefler
2019 A conf
Slim graph: practical lossy graph compression for approximate graph processing, storage, and analytics.
SC
Maciej Besta, Simon Weber, Lukas Gianinazzi, Robert Gerstenberger, Andrey Ivanov, Yishai Oltchik, Torsten Hoefler