Simon Weber

According to our database, Simon Weber authored at least 16 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Topological Art in Simple Galleries.

Daniel Bertschinger, Nicolas El Maalouly, Tillmann Miltzow, Patrick Schnider, Simon Weber

Discret. Comput. Geom., April, 2024

Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents.

Michaela Borzechowski, John Fearnley, Spencer Gordon, Rahul Savani, Patrick Schnider, Simon Weber

CoRR, 2024

Recognition of Unit Segment and Polyline Graphs is ∃R-Complete.

Michael Hoffmann, Tillmann Miltzow, Simon Weber, Lasse Wulf

CoRR, 2024

On the Complexity of Recognizing Nerves of Convex Sets.

Patrick Schnider, Simon Weber

Comput. Geom. Topol., 2024

2023

On Phases of Unique Sink Orientations.

Michaela Borzechowski, Simon Weber

CoRR, 2023

A Topological Version of Schaefer's Dichotomy Theorem.

Patrick Schnider, Simon Weber

CoRR, 2023

On Degeneracy in the P-Matroid Oriented Matroid Complementarity Problem.

Michaela Borzechowski, Simon Weber

CoRR, 2023

Reducing Nearest Neighbor Training Sets Optimally and Exactly.

Josiah Rohrer, Simon Weber

CoRR, 2023

Realizability Makes A Difference: A Complexity Gap For Sink-Finding in USOs.

Simon Weber, Joel Widmer

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Training Fully Connected Neural Networks is ∃R-Complete.

Daniel Bertschinger, Christoph Hertrich, Paul Jungeblut, Tillmann Miltzow, Simon Weber

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

An FPT Algorithm for Splitting a Necklace Among Two Thieves.

Michaela Borzechowski, Patrick Schnider, Simon Weber

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

The Complexity of Recognizing Geometric Hypergraphs.

Daniel Bertschinger, Nicolas El Maalouly, Linda Kleist, Tillmann Miltzow, Simon Weber

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

On Connectivity in Random Graph Models with Limited Dependencies.

Johannes Lengler, Anders Martinsson, Kalina Petrova, Patrick Schnider, Raphael Steiner, Simon Weber, Emo Welzl

Proceedings of the Approximation, 2023

2022

A Universal Construction for Unique Sink Orientations.

Michaela Borzechowski, Joseph Doolittle, Simon Weber

CoRR, 2022

2021

A Characterization of the Realizable Matoušek Unique Sink Orientations.

Simon Weber, Bernd Gärtner

CoRR, 2021

2019

Slim graph: practical lossy graph compression for approximate graph processing, storage, and analytics.

Maciej Besta, Simon Weber, Lukas Gianinazzi, Robert Gerstenberger, Andrey Ivanov, Yishai Oltchik, Torsten Hoefler

Proceedings of the International Conference for High Performance Computing, 2019