Journals (with refereeing)

• O. Aichholzer, M. K. Chiu, H. Hoang, M. Hoffmann, J. Kyncl, Y. Maus, B. Vogtenhuber, A. Weinberger. Drawings of Complete Multipartite Graphs up to Triangle Flips. Journal of Computational Geometry, 15(2) (2024), 124-173.
• M. Bekos, P. Bose, A. Büngener, V. Dujmović, M. Hoffmann, M. Kaufmann, P. Morin, S. Odak, A. Weinberger. On k-Planar Graphs Without Short Cycles. Journal of Graph Algorithms and Applications 29(3) (2025), 1-22.
• D. Bertschinger, N. El Maalouly, L. Kleist, T. Miltzow, S. Weber. The Complexity of Recognizing Geometric Hypergraphs. Innovations in Graph Theory, 2 (2025).
• M. Borzechowski, S. Weber. On Flipping Edge Sets in Unique Sink Orientations. Graphs & Combinatorics, 41(64) (2025).
• M. Borzechowski, S. Weber. On Degeneracy in the P-Matroid Oriented Matroid Complementarity Problem. Discrete Optimization, 57 (2025).
• S. Cabello, M. Hoffmann, K. Klost, W. Mulzer, J. Tkadlec. Long Plane Trees. ACM Trans. Alg. 22(1) (2026), 5:1-5:40.
• B. Gärtner, S. Weber, J. Widmer. Realizability in Matoušek Unique Sink Orientations: Characterization and Complexity Gap. The Electronic Journal of Combinatorics, 32:2 (2025).
• J. Lill, K. Petrova, S. Weber. Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound. Algorithmica (2025).
• B. Gärtner, V. Kalani, M. M. Reddy, W. Meulemans, B. Speckmann, M. Stojaković. Optimizing symbol visibility through displacement. Applied Mathematics and Computation 505 (2025).
• M. Borzechowski, P. Schnider, S. Weber. An FPT Algorithm for Splitting a Necklace Among Two Thieves. Algorithmica (2025).

Conference Proceedings (with selection process)

• P. Angelini, S. Cornelsen, C. Haase, M. Hoffmann, E. Katsanou, F. Montecchiani, R. Steiner, A. Symvonis. Geometric Realizations of Dichotomous Ordinal Graphs. 41st International Symposium on Computational Geometry (SoCG 2025), LIPIcs 332, 55:1-55:17.
• T. Beurskens, S. van den Broek, M. Hoffmann, T. Ophelders, A. Simons, W. Sonke, B. Speckmann, K. Verbeek. ParkView: Visualizing Monotone Interleavings. 18th IEEE Pacific Visualization Conf. (PacificVis '25), 118-127.
• M. Goetze, M. Hoffmann, I. Rutter, T. Ueckerdt. Crossing Number of 3-Plane Drawings. 33rd International Symposium on Graph Drawing & Network Visualization (GD '25), LIPIcs 357, 15:1-15:19.
• 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), 266-281.
• P. Schnider, L. Stalder, S. Weber. Unfairly Splitting Separable Necklaces (arXiv). 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025), LIPIcs 327, 71:1-71:19.
• S. Haslebacher. ARRIVAL: Recursive Framework & l₁-Contraction. 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025), LIPIcs 334, 95:1-95:17.
• N. El Maalouly, S. Haslebacher, A. Taubner, L. Wulf. On Finding l-th Smallest Perfect Matchings. 33rd Annual European Symposium on Algorithms (ESA 2025), LIPIcs 351, 19:1-19:15.
• S. Haslebacher, J. Lill, P. Schnider, S. Weber. Query-Efficient Fixpoints of l_p-Contractions. (arXiv) To appear in 66th Annual Symposium on Foundations of Computer Science (FOCS 2025).
• S. Haslebacher, J. Lill. A Levelset Algorithm for 3D-Tarski. (arXiv) To appear in 9th SIAM Symposium on Simplicity in Algorithms (SOSA 2026).

Other

• T. Beurskens, S. van den Broek, M. Hoffmann, T. Ophelders, A. Simons, W. Sonke, K. Verbeek, B. Speckmann. ParkView: Visualizing Monotone Interleavings. 41st European Workshop on Computational Geometry (EuroCG 2025), 29:1-29:7.
• S. Felsner, M. Hoffmann, T. Hruz, T. Miltzow, H. Rotzoll, S. Wang, E. Welzl. On Local and Global Crossing Numbers. 41st European Workshop on Computational Geometry (EuroCG 2025), 42:1-42:8.
• M. Goetze, M. Hoffmann, I. Rutter, T. Ueckerdt. Crossing Number of 3-Plane Drawings. 41st European Workshop on Computational Geometry (EuroCG 2025), 56:1-56:8.

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. Huber, S. Kalisnik, P. Schnider. AuToMATo: A Parameter-Free Persistence-Based Clustering Algorithm (arXiv). Submitted (2024).