Books

• M. Dyer, B. Gärtner, N. Megiddo, E. Welzl. Linear Programming. In: Handbook of Discrete and Computational Geometry, 3rd Edition (J. E. Goodman, J. O'Rourke, Cs. D. Tóth, eds.), Chapman and Hall/CRC (2016), to appear.
• M. Hoffmann, L. Kettner, S. Näher, Two Computational Geometry Libraries: LEDA and CGAL, in: Handbook of Discrete and Computational Geometry, 3rd Edition (J. E. Goodman, J. O'Rourke, Cs. D. Tóth, eds.), Chapman and Hall/CRC (2016), to appear.

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, Th. Hackl, A. Pilz, B. Vogtenhuber. Linear transformation distance for bichromatic matchings. Computational Geometry - Theory and Applications, to appear.
• O. Aichholzer, J. Cardinal, V. Kusters, S. Langerman, P. Valtr. Reconstructing point set order types from radial orderings. International Journal of Computational Geometry and Applications, 26:3 (2016), 167–184.
• O. Aichholzer, A. Fischer, F. Fischer, J. F. Meier, U. Pferschy, A. Pilz, R. Stanek. Minimization and maximization versions of the quadratic traveling salesman problem. Optimization, 66:4 (2017), 521–546.
• O. Aichholzer, Th. Hackl, M. Korman, M. van Kreveld, M. Löffler, A. Pilz, B. Speckmann, E. Welzl. Packing plane spanning trees and paths in complete geometric graphs. Information Processing Letters, 124 (2017), 35–41.
• 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, to appear.
• J. Cardinal, M. Hoffmann, V. Kusters, Cs. D. Tóth, M. Wettstein. Arc diagrams, flip distances, and Hamiltonian triangulations. Computational Geometry - Theory and Applications, to appear.
• J. Dohrau, B. Gärtner, M. Kohler, J. Matoušek, E. Welzl. ARRIVAL: A zero-player graph game in NP ∩ coNP. A Journey through Discrete Mathematics. A Tribute to Jiří Matoušek edited by Martin Loebl, Jaroslav Nešetřil and Robin Thomas (2017, to appear).
• S. Felsner, A. Pilz. Ham-Sandwich cuts for abstract order types. Algorithmica, to appear.
• K. Fukuda, B. Gärtner, M. Szedlák. Combinatorial Redundancy Detection. Annals of Operations Research (2017, to appear).
• M. Geyer, M. Hoffmann, M. Kaufmann, V. Kusters, Cs. D. Tóth. The Planar Tree Packing Theorem. Journal of Computational Geometry, 8:2 (2017).
• 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, to appear (2016).
• A. J. Ruiz, E. Welzl. Crossing-Free Perfect Matchings in Wheel Point Sets. A Journey through Discrete Mathematics. A Tribute to Jiří Matoušek edited by Martin Loebl, Jaroslav Nešetřil and Robin Thomas (2017, to appear).
• M. Wettstein. Counting and Enumerating Crossing-free Geometric Graphs. Journal of Computational Geometry, to appear.
• M. Wettstein. Trapezoidal Diagrams, Upward Triangulations, and Prime Catalan Numbers. Discrete and Computational Geometry, to appear.

Conference Proceedings (with selection process)

• M. Balko, J. Kynčl, S. Langerman, A. Pilz. Induced Ramsey-type results and binary predicates for point sets. European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2017), ENDM 61, 77–83.
• B. Banyassady, M. Hoffmann, B. Klemz, M. Löffler, T. Miltzow. Obedient Plane Drawings for Disk Intersection Graphs. Proc. 15th Algorithms and Data Struct. Sympos. (WADS 2017), LNCS 10389, 73–84.
• B. Gärtner, A. N. Zehmakan. Color War: Cellular Automata with Majority Rule. Proc. International Conference on Language and Automata Theory and Applications (LATA 2017), 393–404.
• M. Hoffmann, Cs. D. Tóth. Two-Planar Graphs Are Quasiplanar. Proc. 42nd Internat. Sympos. Math. Found. Comput. Sci. (MFCS 2017), 47:1–47:14.
• C. Huemer, A. Pilz, C. Seara, R. I. Silveira. Characteristic polynomials of production matrices for geometric graphs. European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2017), ENDM 61, 631–637.
• M. Milatz. Directed random walks on polytopes with few facets (arxiv). European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2017), ENDM 61, 869–875.
• A. Pilz, E. Welzl, M. Wettstein. From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices. Proc. 33rd International Symposium on Computational Geometry (SoCG 2017), LIPIcs 77, 54:1–54:16.
• A. Thomas. Exponential lower bounds for history-based simplex pivot rules on abstract cubes. 25th Annual European Symposium on Algorithms (ESA 2017), LIPIcs 87, 69:1–69:14.

Other (including submitted work)

• O. Aichholzer, F. Ebenführer, I. Parada, A. Pilz, B. Vogtenhuber. On semi-simple drawings of the complete graph. Proc. XVII Spanish Meeting on Computational Geometry (EGC 2017), 25–28.
• C. Annamalai. Lazy Local Search Meets Machine Scheduling. Submitted (2016).
• L. Barba, J. Cardinal, J. Iacono, S. Langerman, A. Ooms, N. Solomon. Subquadratic Algorithms for Algebraic Generalizations of 3SUM. Submitted (2017).
• V. Bosshard, B. Gärtner. Pseudo Unique Sink Orientations. Submitted (2017).
• S. Felsner, A. Pilz. Arrangements of Approaching Pseudo-Lines. European Workshop on Computational Geometry (EuroCG 2017), 229–232.
• K. Fukuda, M. Szedlák. Redundancies in Linear Systems with two Variables per Inequality. Submitted (2016).
• R. Fulek, H. Nassajian Mojarrad, M. Naszódi, J. Solymosi, S. U. Stich, M. Szedlák. On the Existence of Ordinary Triangles. Submitted (2017).
• B. Gärtner, A. Krause, A. Kyrillidis, H. Tyagi, Algorithms for Learning Sparse Additive Models with Interactions in High Dimensions. Discrete & Computational Geometry, to appear (2016).
• T. Mütze, J. Nummenpalo. A constant-time algorithm for middle levels Gray codes. Submitted (2016).
• P. Schnider. A generalization of crossing families. European Workshop on Computational Geometry (EuroCG 2017), 273–276.
• C. Seara, A. Pilz. Convex Quadrangulations of Bichromatic Point Sets. European Workshop on Computational Geometry (EuroCG 2017), 77–80.