Recent Publications
Journals (with refereeing)
Conference Proceedings (with selection process)
-
D. Bertschinger, N. El Maalouly, L. Kleist, T. Miltzow, S. Weber.
The Complexity of Recognizing Geometric Hypergraphs (arXiv).
31st International Symposium on Graph Drawing and Network Visualization (GD 2023), 163-179.
-
D. Bertschinger, C. Hertrich, P. Jungeblut, T. Miltzow, S. Weber.
Training Fully Connected Neural Networks is ∃R-Complete (arXiv).
37th Conference on Neural Information Processing Systems (NeurIPS 2023), 36222-36237.
-
N. El Maalouly, S. Haslebacher, L. Wulf.
On the Exact Matching Problem in Dense Graphs (arXiv).
41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024), LIPIcs 289, 33:1-33:17.
-
J. Pach, M. Saghafian, P. Schnider.
Decomposition of Geometric Graphs into Star Forests (arXiv).
31st International Symposium on Graph Drawing and Network Visualization (GD 2023), 339-346.
-
P. Schnider, S. Weber.
A Topological Version of Schaefer's Dichotomy Theorem (arXiv).
40th International Symposium on Computational Geometry (SoCG 2024), to appear.
Other
Submitted
-
H. Bergold, S. Felsner, M. M. Reddy, M. Scheucher.
Using SAT to study plane Hamiltonian substructures in simple drawings (arXiv).
Submitted (2023).
-
M. Borzechowski, J. Doolittle, S. Weber.
A Universal Construction for Unique Sink Orientations (arXiv).
Submitted (2022).
-
M. Borzechowski, J. Fearnley, S. Gordon, R. Savani, P. Schnider, S. Weber.
Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents (arXiv).
Submitted (2024).
-
B. Gärtner, V. Kalani, W. Meulemans, M. M. Reddy, B. Speckmann, M. Stojaković.
Optimizing Symbol Visibility through Displacement (arXiv).
Submitted (2023).
-
M. Hoffmann, T. Miltzow, S. Weber, L. Wulf.
Recognition of Unit Segment and Polyline Graphs is ∃R-Complete (arXiv).
Submitted (2024).
-
M. Kaufmann, B. Klemz, K. Knorr, M. M. Reddy, F. Schröder, T. Ueckerdt.
The Density Formula: One Lemma to Bound Them All (arXiv).
Submitted (2023).