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, 2023, 1-20.
• D. Bertschinger, N. El Maalouly, T. Miltzow, P. Schnider, S. Weber. Topological Art in Simple Galleries. Discrete & Computational Geometry , 2023.
• J. Cardinal, H. Hoang, A. Merino, O. Mička, T. Mütze. Combinatorial generation via permutation languages. V. Acyclic orientations (arXiv). Journal on Discrete Mathematics, to appear.
• X. Goaoc, E. Welzl. Convex hulls of random order types. Journal of the ACM, 70 (2023), 1-47 (Article 8).
• H. Hoang, S. Lendl, L. Wulf. Assistance and Interdiction Problems on Interval Graphs (arXiv). Discrete Applied Mathematics, to appear.
• F. Frati, M. Hoffmann, Cs. D. Tóth. Universal Geometric Graphs. Combinatorics, Probability and Computing 32,5 (2023), 742-761.
• P. Schnider. Enclosing Depth and other Depth Measures. Combinatorica, 2023, 1-23.
• D. Rutschmann, M. Wettstein. Chains, Koch Chains, and Point Sets with many Triangulations. Journal of the ACM, 70 (2023), 1-28 (Article 16).

Conference Proceedings (with selection process)

• O. Aichholzer, M.-K. Chiu, H. Hoang, M. Hoffmann, J. Kynčl, Y. Maus, B. Vogtenhuber, A. Weinberger. Drawings of complete multipartite graphs up to triangle flips. 39th International Symposium on Computational Geometry (SOCG 2023), LIPIcs 258, 6:1-6:16.
• J. Cardinal, H. Hoang, A. Merino, T. Mütze. Zigzagging through acyclic orientations of graphs and hypergraphs. 34th Symposium on Discrete Algorithms (SODA 2023), 3029-3042.
• N. El Maalouly. Exact Matching: Algorithms and Related Problems. 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023), LIPIcs 254, 29:1-29:17.
• M. Ghaffari, C. Grunau, B. Haeupler, S. Ilchi, V. Rozhoň. Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization. 34th Symposium on Discrete Algorithms (SODA 2023), 2532-2566.
• M. Hoffmann, M. M. Reddy. The Number of Edges in Maximal 2-planar Graphs. 39th International Symposium on Computational Geometry (SOCG 2023), LIPIcs 258, 39:1-39:15.
• J. Lengler, A. Martinsson, K. Petrova, P. Schnider, R. Steiner, S. Weber, E. Welzl. On Connectivity in Random Graph Models with Limited Dependencies. International Conference on Randomization and Computation (RANDOM 2023), LIPIcs 275, 30:1-30:22.
• 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), 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), to appear.
• P. Schnider, P. Soberón. Combinatorial Depth Measures for Hyperplane Arrangements ( arXiv). 9th International Symposium on Computational Geometry (SOCG 2023), LIPIcs 258, 55:1-55:14.
• S. Weber, J. Widmer. Realizability Makes a Difference: A Complexity Gap for Sink-Finding in USOs (arXiv). Algorithms and Data Structures Symposium (WADS 2023), Springer, 2023.
• J. Rohrer, S. Weber. Reducing Nearest Neighbor Training Sets Optimally and Exactly. 35th Canadian Conference on Computational Geometry (CCCG 2023), 2023.
• M. Borzechowski, P. Schnider, S. Weber. An FPT Algorithm for Splitting a Necklace Among Two Thieves (arXiv). 34th International Symposium on Algorithms and Computation (ISAAC 2023), to appear.
• 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), to appear.

Other

• M. Hoffmann, M. M. Reddy, E. Seemann. Hamiltonian Cycles and Matchings in 1-planar Graphs. 39th European Workshop on Computational Geometry (EuroCG 2023), 34:1-34:7.
• M. Hoffmann, M. M. Reddy. The Number of Edges in Maximal 2-Planar Graphs. 39th European Workshop on Computational Geometry (EuroCG 2023), 42:1-42:7.
• P. Schnider, S. Weber. On the Complexity of Recognizing Nerves of Convex Sets. 39th European Workshop on Computational Geometry (EuroCG 2023), 5:1-5:7.
• M. Borzechowski, S. Weber. On Degeneracy in the P-Matroid Oriented Matroid Complementarity Problem. 39th European Workshop on Computational Geometry (EuroCG 2023), 9:1-9:7.
• D. Bertschinger, N. El Maalouly, L. Kleist, T. Miltzow, S. Weber. The Complexity of Recognizing Geometric Hypergraphs. 39th European Workshop on Computational Geometry (EuroCG 2023), 59:1-59:9.

Submitted

• K. Bérczi, H. Hoang, L. Tóthmérész. On approximating the rank of graph divisors (arXiv). Submitted (2022).
• S. Bhyravarapu, T. A. Hartmann, H. Hoang, S. Kalyanasundaram, I. V. Reddy. Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs (arXiv). Submitted (2022).
• M. Borzechowski, J. Doolittle, S. Weber. A Universal Construction for Unique Sink Orientations (arXiv). Submitted (2022).
• N. El Maalouly, R. Steiner, L. Wulf. Exact Matching: Correct Parity and FPT Parameterized by Independence Number (arXiv). Submitted (2022).
• Yuan Gao, B. Gärtner, Jourdain Lamperski. A New Combinatorial Property of Geometric Unique Sink Orientations (arXiv). Submitted (2020).
• A. Mohammadi, Th. Pham, Y. Wang. An energy decomposition theorem for matrices and related questions (arXiv). Submitted.
• P. Schnider. Equipartitions with Wedges and Cones (arXiv). Submitted (2019).
• P. Schnider, S. Weber. A Topological Version of Schaefer's Dichotomy Theorem (arXiv). Submitted (2023).
• S. Weber, B. Gärtner. A Characterization of the Realizable Matoušek Unique Sink Orientations (arXiv). Submitted (2021).