Books

Journals (with refereeing)

• H. Ahn, L. Barba, P. Bose, J. de Carufel, M. Korman, E. Oh. A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon. Discrete and Computational Geometry, to appear.
• O. Aichholzer, L. Barba, T. Hackl, A. Pilz, and B. Vogtenhuber. Linear transformation distance for bichromatic matchings. Computational Geometry: Theory and Applications, Special Issue in Memoriam: Ferran Hurtado, 68 (2018), 77–88.
• O. Aichholzer, M. Balko, T. Hackl, A. Pilz, P. Ramos, P. Valtr, B. Vogtenhuber. Holes in 2-convex point sets. Computational Geometry: Theory and Applications, to appear.
• O. Aichholzer, V. Kusters, W. Mulzer, A. Pilz, M. Wettstein. An optimal algorithm for reconstructing point set order types from radial orderings. International Journal of Computational Geometry and Applications, 27 (2017), 57–83.
• D. Bakhshesh, L. Barba, P. Bose, J. de Carufel, M. Damian, R. Fagerberg, M. Farshi, A. van Renssen, P. Taslakian, S. Verdonschot. Continuous Yao graphs. Computational Geometry: Theory and Applications, 67 (2018), 42–52.
• J. Cardinal, M. Hoffmann, V. Kusters, Cs. D. Tóth, M. Wettstein. Arc diagrams, flip distances, and Hamiltonian triangulations. Computational Geometry: Theory and Applications, 68 (2018), 206–225.
• S. Felsner, A. Pilz. Ham-Sandwich cuts for abstract order types. Algorithmica 80:1 (2018), 234–257.
• K. Fukuda, B. Gärtner, M. Szedlák. Combinatorial Redundancy Detection (arxiv). Annals of Operations Research 265:1 (2018), 47–65.
• B. Gärtner, A. Krause, A. Kyrillidis, H. Tyagi. Algorithms for Learning Sparse Additive Models with Interactions in High Dimensions (arxiv). Information and Inference: A Journal of the IMA, 7:2 (2018), 183–249.
• M. Korman, S. Langerman, W. Mulzer, A. Pilz, M. Saumell, and B. Vogtenhuber. The dual diameter of triangulations. Computational Geometry: Theory and Applications, 68 (2018), 243–252.
• J. Matoušek. Computing higher homotopy groups is W[1]-hard. Fundamenta Informaticae (2014, to appear).
• A. Pilz, E. Welzl. Order on order types. Discrete & Computational Geometry (2016, to appear).
• M. Wettstein. Counting and Enumerating Crossing-free Geometric Graphs. Journal of Computational Geometry 8:1 (2017), 47–77.
• M. Wettstein. Trapezoidal Diagrams, Upward Triangulations, and Prime Catalan Numbers. Discrete and Computational Geometry 58:3 (2017), 505–525.

Conference Proceedings (with selection process)

• B. Banyassady, L. Barba, W. Mulzer. Time-space trade-offs for computing Euclidean minimum spanning trees. 13th Latin American Theoretical Informatics Symposium (LATIN 2018), LNCS 10807, 108–109.
• L. Barba, M. Hoffmann, M. Korman, A. Pilz. Convex hulls in polygonal domains. 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018), LIPIcs 101, 8:1–8:13.
• J. Cardinal, J. Nummenpalo, E. Welzl. Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems (arxiv). 12th International Symposium on Parameterized and Exact Computation (IPEC 2017), 11:1–11:12.
• B. Gärtner, A. N. Zehmakan. Majority Model on Random Regular Graphs. 13th Latin American Theoretical Informatics Symposium (LATIN 2018), LNCS 10807, 572–583.
• B. Gärtner, T. D. Hansen, P. Hubáček, K. Král, H. Mosaad, V. Slívová. ARRIVAL: Next Stop in CLS. 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), to appear.
• A. Kupavskii, E. Welzl. Lower Bounds for Searching Robots, some Faulty. Proc. 37th ACM Symposium on Principles of Distributed Computing (PODC 2018), to appear.
• A. Martinsson, F. Meier, P. Schnider, A. Steger. Even flying cops should think ahead. International Symposium on Combinatorial Optimzation (ISCO 2018), to appear.
• M. Milatz. Random walks on polytopes of constant corank (arxiv). 34th International Symposium on Computational Geometry (SOCG 2018), LIPIcs 99, 60:1–60:14.
• T. Mütze, J. Nummenpalo, B. Walczak. Sparse Kneser graphs are Hamiltonian. 50th Annual ACM Symposium on the Theory of Computing (STOC 2018), to appear.
• T. Nichols, A. Pilz, Cs. D. Tóth, A. N. Zehmakan. Transition Operations over Plane Trees. 13th Latin American Theoretical Informatics Symposium (LATIN 2018), LNCS 10807, 835–848.

Other (including submitted work)

• O. Aichholzer, M. Balko, M. Hoffmann, J. Kynčl, W. Mulzer, I. Parada, A. Pilz, M. Scheucher, P. Valtr, B. Vogtenhuber, E. Welzl. Minimal Geometric Graph Representations of Order Types. 34th European Workshop on Computational Geometry (EuroCG 2018), 21.
• O. Aichholzer, W. Mulzer, P. Schnider, B. Vogtenhuber. NP-Completeness of Max-Cut for Segment Intersection Graphs. 34th European Workshop on Computational Geometry (EuroCG 2018), 32.
• C. Annamalai. Lazy Local Search Meets Machine Scheduling. Submitted (2016).
• L. Barba, A. Pilz, P. Schnider. Sharing a pizza: bisecting masses with two cuts. Submitted (2017).
• V. Bosshard, B. Gärtner. Pseudo Unique Sink Orientations. Submitted (2017).
• B. Gärtner, A. N. Zehmakan. (Biased) Majority Rule Cellular Automata. Submitted (2017).
• P. Gregor, T. Mütze, J. Nummenpalo. A short proof of the middle levels theorem. Submitted (2018).
• K. Fukuda, M. Szedlák. Redundancies in Linear Systems with two Variables per Inequality. Submitted (2016).
• Philipp Kindermann, Boris Klemz, Ignaz Rutter, Patrick Schnider, André Schulz. The Partition Spanning Forest Problem. 34th European Workshop on Computational Geometry (EuroCG 2018), 53.
• A. Pilz, P. Schnider. A combinatorial measure of closeness in point sets. 34th European Workshop on Computational Geometry (EuroCG 2018), 5.
• A. Pilz, P. Schnider. Extensions of the centerpoint theorem to multiple points. Submitted (2017).