Recent Publications
Journals (with refereeing)
-
O. Aichholzer, R. Fabila-Monroy, P. Kindermann, I. Parada, R. Paul, D. Perz, P. Schnider, B. Vogtenhuber.
Perfect Matchings with Crossings.
Algorithmica, 86 (2024), 697-716.
-
St. Langerman, M. Mydlarz, E. Welzl.
Deep Cliques in Point Sets.
Discrete & Computational Geometry, 72 (2024), 892–911.
-
J. Lengler, A. Martinsson, K. Petrova, P. Schnider, R. Steiner, S. Weber, E. Welzl.
On connectivity in random graph models with limited dependencies.
Random Structures & Algorithms, 65(2) (2024), 411-448.
Conference Proceedings (with selection process)
-
O. Aichholzer, A. Brötzner, D. Perz, P. Schnider.
Flips in Odd Matchings.
36th Canadian Conference on Computational Geometry (CCCG 2024), to appear.
-
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.
-
M. Borzechowski, J. Fearnley, S. Gordon, R. Savani, P. Schnider, S. Weber.
Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents (arXiv).
51st EATCS International Colloquium on Automata, Languages and Programming (ICALP 2024), LIPIcs 297, 32:1-32:18.
-
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.
-
B. Gärtner, V. Kalani, W. Meulemans, M. M. Reddy, B. Speckmann, M. Stojaković.
Optimizing Symbol Visibility through Displacement (arXiv).
19th Scandinavian Symposium on Algorithm Theory (SWAT 2024), LIPIcs 294, 24:1-24:16.
-
M. Hoffmann, T. Miltzow, S. Weber, L. Wulf.
Recognition of Unit Segment and Polyline Graphs is ∃R-Complete (arXiv).
50th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2024), to appear.
-
J. Lill, K. Petrova, S. Weber.
Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound (arXiv).
International Symposium on Parameterized and Exact Computation (IPEC'24), to appear.
-
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), LIPIcs 293, 77:1-77:16.
Other
-
O. Aichholzer, A. Brötzner, D. Perz, P. Schnider.
Flips in Odd Matchings.
40th European Workshop on Computational Geometry (EuroCG 2024), 59:1-59:6.
-
P. Angelini, S. Cornelsen, C. Haase, M. Hoffmann, E. Katsanou, F. Montecchiani, A. Symvonis.
Bipartite Dichotomous Ordinal Graphs.
40th European Workshop on Computational Geometry (EuroCG 2024), 17:1-17:8.
-
M. Borzechowski, J. Doolittle, S. Weber.
A Universal Construction for Unique Sink Orientations.
40th European Workshop on Computational Geometry (EuroCG 2024), 9:1-9:8.
-
B. Gärtner, F. Rasiti, P. Schnider.
Computing Enclosing Depth.
40th European Workshop on Computational Geometry (EuroCG 2024), 34:1-34:7.
-
M. Hoffmann, T. Miltzow, S. Weber, L. Wulf.
Recognition of Unit Segment and Polyline Graphs is ∃R-Complete.
40th European Workshop on Computational Geometry (EuroCG 2024), 11:1-11:10.
-
M. Hoffmann, M. M. Reddy, S. Wang.
On Maximal 3-Planar Graphs.
40th European Workshop on Computational Geometry (EuroCG 2024), 31:1-31:7.
-
I. van der Hoog, F. Klute, I. Parada, P. Schnider.
Barking dogs: A Fréchet distance variant for detour detection.
40th European Workshop on Computational Geometry (EuroCG 2024), 23:1-23:6.
Submitted
-
O. Aichholzer, S. Cabello, V. Mészáros, P. Schnider, J. Soukup.
Connected Matchings (arXiv).
Submitted (2024).
-
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, S. Weber.
On Phases of Unique Sink Orientations (arXiv).
Submitted (2023).
-
M. Huber, S. Kalisnik, P. Schnider.
AuToMATo: A Parameter-Free Persistence-Based Clustering Algorithm (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).