Journals (with refereeing)

• D. Cheong, D. Koh, Th. Pham. An asymmetric bound for sum of distance sets. Proceedings of the Steklov Institute of Mathematics, 314 (2021), 279-289.
• D. Cheong, D. Koh, Th. Pham. Extension theorems for Hamming varieties over finite fields. Proceedings of the American Mathematical Society, 150 (2022), 161-170.
• D. Cheong, D. Koh, Th. Pham, C-Y. Shen. Mattila-Sjölin type functions: A finite field model. Vietnam Journal of Mathematics, 2021, 1-14.
• F. Clément, H. Mojarrad, D-H. Pham, and C. Shen. On the two-parameter Erdős-Falconer distance problem over finite fields. Bulletin of the Australian Mathematical Society, 2022, 1-5.
• F. Clément, Th. Pham. Distribution of distances in five dimensions and related problems. SIAM Journal of Discrete of Mathematics, 36.3 (2022), 2271-2281.
• S. Cornelsen, M. Pfister, H. Förster, M. Gronemann, M. Hoffmann, S. Kobourov, T. Schneck. Drawing Shortest Paths in Geodetic Graphs. Journal of Graph Algorithms and Applications, 26 (2022), 353-361.
• S. Felsner, M. Hoffmann, K. Knorr, J. Kynčl, I. Parada. On the Maximum Number of Crossings in Star-Simple Drawings of K_n with No Empty Lens. Journal of Graph Algorithms and Applications, 26 (2022), 381–399.
• S. Felsner, A. Pilz, P. Schnider. Arrangements of Approaching Pseudo-lines. Discrete and Computational Geometry, 67 (2022), 380-402.
• X. Goaoc, E. Welzl. Convex hulls of random order types (arXiv), Journal of the ACM, to appear.
• N. Grelier. Computing a maximum clique in geometric superclasses of disk graphs. Journal of Combinatorial Optimization, 2022, 1-30.
• L. Hartung, H. Hoang, T. Mütze, A. Williams. Combinatorial Generation via Permutation Languages: I. Fundamentals. Transactions of the American Mathematical Society, 375 (2022), 2255-2291.
• H. Hoang, T. Mütze. Combinatorial Generation via Permutation Languages: II. Lattice congruences. Israel Journal of Mathematics, 244 (2021), 359–417.
• D. Koh, S. Lee, Th. Pham. On the finite field cone restriction conjecture in four dimensions and applications in incidence geometry. International Mathematics Research Notices, 2021.
• D. Koh, Th. Pham, L. A. Vinh. Extension theorems and a connection to the Erdős-Falconer distance problem over finite fields. Journal of Functional Analysis, 281 (2021), 109-137.
• D. Koh, Th. Pham, C.-Y. Shen. On the Mattila–Sjölin distance theorem for product sets. Mathematika 68.4 (2022), 1258-1267.
• B. Murphy, G. Petridis, Th. Pham, M. Rudnev, S. Stevens. On the Pinned Distances Problem in Positive Characteristic. Journal of London Mathematical Society, 105 (2022), 469-499.
• U. Wagner, E. Welzl. Connectivity of Triangulation Flip Graphs in the Plane (arXiv). Discrete and Computational Geometry (special issue of 36th International Symposium on Computational Geometry), 2022, to appear.

Conference Proceedings (with selection process)

• M. Balko, S. Chaplick, R. Ganian, S. Gupta, M. Hoffmann, P. Valtr, A. Wolff. Bounding and Computing Obstacle Numbers of Graphs. 30th Annual European Symposium on Algorithms (ESA 2022), LIPIcs 244, 11:1 - 11:13.
• D. Bertschinger, N. El Maalouly, T. Miltzow, P. Schnider, S. Weber. Topological Art in Simple Galleries (arXiv). 5th Symposium on Simplicity in Algorithms (SOSA 2022), 87-116.
• D. Bertschinger, M. M. Reddy, E. Mann. Lions and Contamination: Monotone Clearings 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022), LIPIcs 227, 17:1 - 17:11.
• S. Cabello, M. Hoffmann, K. Klost, W. Mulzer, J. Kadlec. Long plane trees. 38th International Symposium on Computational Geometry (SOCG 2022), LIPIcs 224, 23:1 - 23:17.
• H. Bergold, D. Bertschinger, N. Grelier, W. Mulzer, P. Schnider. Well-Separation and Hyperplane Transversals in High Dimensions. 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022), LIPIcs 227, 16:1 - 16:14.
• M. Bezdrighin, M. Elkin, M. Ghaffari, C. Grunau, B. Haeupler, S. Ilchi, V. Rozhoň. Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates. 34th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2022), 1-10.
• J. Cleve, N. Grelier, K. Knorr, M. Löffler, W. Mulzer, D. Perz. Nearest-Neighbor Decompositions of Drawings. 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022), LIPIcs 227, 21:1 - 21:16.
• M. Dory, M. Ghaffari, S. Ilchi. Distributed Dominating Set in Bounded Arboricity Graphs. 41th Symposium on Principles of Distributed Computing (PODC 2022), 292 - 300.
• N. El Maalouly, R. Steiner. Exact Matching in Graphs of Bounded Independence Number. 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), LIPIcs 241, 46:1 – 46:14.
• M. Ghaffari, C. Grunau, B. Haeupler, S. Ilchi, V. Rozhoň. Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization (arXiv). 42th Symposium on Discrete Algorithms (SODA 2023), to appear.
• N. Grelier. Hardness and Approximation of Minimum Convex Partition. 38th International Symposium on Computational Geometry (SOCG 2022), LIPIcs 224, 45:1 - 45:15.
• D. Rutschmann, M. Wettstein. Chains, Koch Chains, and Point Sets with many Triangulations. 38th International Symposium on Computational Geometry (SOCG 2022), LIPIcs 224, 59:1 - 59:18.
• P. Schnider. Enclosing Depth and Other Depth Measures. 32nd International Symposium on Algorithms and Computation (ISAAC 2021), LIPIcs 212, 10:1 - 10:15.

Other

• O. Aichholzer, M.-K. Chiu, H. Hoang, M. Hoffmann, Y. Maus, B. Vogtenhuber, A. Weinberger. Gioan’s Theorem for complete bipartite graphs. 38th European Workshop on Computational Geometry (EuroCG 2022), 31:1-31:6.
• D. Bertschinger, J. Passweg, P. Schnider. Tukey Depth Histograms. International Workshop on Combinatorial Algorithms ( IWOCA 2022), 186-198.
• D. Bertschinger, M. M. Reddy, E. Mann. Lions and Contamination: Monotone Clearings. 38th European Workshop on Computational Geometry (EuroCG 2022), 44:1-44:6.
• D. Bertschinger, H. Förster, B. Vogtenhuber. Intersections of Double-Wedge Arrangements. 38th European Workshop on Computational Geometry (EuroCG 2022), 58:1-58:6.
• H. Bergold, D. Bertschinger, N. Grelier, W. Mulzer, P. Schnider. Well-Separation and Hyperplane Transversals in High Dimensions. 38th European Workshop on Computational Geometry (EuroCG 2022), 13:1-13:6.
• N. Grelier. Approximation of Minimum Convex Partition. 38th European Workshop on Computational Geometry (EuroCG 2022), 22:1-22:6.

Submitted

• K. Bérczi, H. Hoang, L. Tóthmérész. On approximating the rank of graph divisors (arXiv). Submitted (2022).
• D. Bertschinger, C. Hertrich, P. Jungeblut, T. Miltzow, S. Weber. Training Fully Connected Neural Networks is ∃R-Complete (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).
• Yuan Gao, B. Gärtner, Jourdain Lamperski. A New Combinatorial Property of Geometric Unique Sink Orientations (arXiv). Submitted (2020).
• H. Hoang, S. Lendl, L. Wulf. Assistance and Interdiction Problems on Interval Graphs. Submitted (2021).
• 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).
• S. Weber, B. Gärtner. A Characterization of the Realizable Matoušek Unique Sink Orientations (arXiv). Submitted (2021).