Slim graph: practical lossy graph compression for approximate graph processing, storage, and analytics. - Maciej Besta; Simon Weber 001; Lukas Gianinazzi; Robert Gerstenberger; Andrey Ivanov 002; Yishai Oltchik; Torsten Hoefler (SC, 2019)

A Characterization of the Realizable Matoušek Unique Sink Orientations. - Simon Weber 001; Bernd Gärtner (CoRR, 2021)

A Universal Construction for Unique Sink Orientations. - Michaela Borzechowski; Joseph Doolittle; Simon Weber 001 (CoRR, 2022)

Reducing Nearest Neighbor Training Sets Optimally and Exactly. - Simon Weber 001; Josiah Rohrer (CCCG, 2023)

The Complexity of Recognizing Geometric Hypergraphs. - Daniel Bertschinger; Nicolas El Maalouly; Linda Kleist; Tillmann Miltzow; Simon Weber 001 (GD (1), 2023)

An FPT Algorithm for Splitting a Necklace Among Two Thieves. - Michaela Borzechowski; Patrick Schnider; Simon Weber 001 (ISAAC, 2023)

Training Fully Connected Neural Networks is ∃R-Complete. - Daniel Bertschinger; Christoph Hertrich; Paul Jungeblut; Tillmann Miltzow; Simon Weber 001 (NeurIPS, 2023)

Realizability Makes A Difference: A Complexity Gap For Sink-Finding in USOs. - Simon Weber 001; Joel Widmer (WADS, 2023)

On Phases of Unique Sink Orientations. - Michaela Borzechowski; Simon Weber 001 (CoRR, 2023)

A Topological Version of Schaefer's Dichotomy Theorem. - Patrick Schnider; Simon Weber 001 (SoCG, 2024)

Two Choices Are Enough for P-LCPs, USOs, and Colorful Tangents. - Michaela Borzechowski; John Fearnley; Spencer Gordon; Rahul Savani; Patrick Schnider; Simon Weber 001 (ICALP, 2024)

Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound. - Jonas Lill; Kalina Petrova; Simon Weber 001 (IPEC, 2024)

Recognition of Unit Segment and Polyline Graphs is $ exists mathbb {R} $-Complete. - Michael Hoffmann 001; Tillmann Miltzow; Simon Weber 001; Lasse Wulf (WG, 2024)

On the Complexity of Recognizing Nerves of Convex Sets. - Patrick Schnider; Simon Weber 001 (Comput. Geom. Topol., 2024)

Recognition of Unit Segment and Polyline Graphs is ∃R-Complete. - Michael Hoffmann 001; Tillmann Miltzow; Simon Weber 001; Lasse Wulf (CoRR, 2024)

On connectivity in random graph models with limited dependencies. - Johannes Lengler; Anders Martinsson; Kalina Petrova; Patrick Schnider; Raphael Steiner; Simon Weber 001; Emo Welzl (Random Struct. Algorithms, 2024)

Topological Art in Simple Galleries. - Daniel Bertschinger; Nicolas El Maalouly; Tillmann Miltzow; Patrick Schnider; Simon Weber 001 (Discret. Comput. Geom., 2024)

Unfairly Splitting Separable Necklaces. - Patrick Schnider; Linus Stalder; Simon Weber 001 (STACS, 2025)

Realizability in Matoušek Unique Sink Orientations: Characterization and Complexity Gap. - Bernd Gärtner; Simon Weber 001; Joel Widmer (Electron. J. Comb., 2025)

On degeneracy in the P-matroid oriented matroid complementarity problem. - Michaela Borzechowski; Simon Weber 001 (Discret. Optim., 2025)

Query-Efficient Fixpoints of ℓp-Contractions. - Sebastian Haslebacher; Jonas Lill; Patrick Schnider; Simon Weber 001 (CoRR, 2025)

On Flipping Edge Sets in Unique Sink Orientations. - Michaela Borzechowski; Simon Weber 001 (Graphs Comb., 2025)