Recent Publications
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 LinearTime 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, A. Fischer, F. Fischer, J. F. Meier, U. Pferschy, A. Pilz, R. Stanek.
Minimization and maximization versions of the quadratic traveling salesman problem.
Optimization, 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, to appear.

J. Dohrau, B. Gärtner, M. Kohler, J. Matoušek, E. Welzl.
ARRIVAL: A zeroplayer 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.
HamSandwich 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).

J. Matoušek,
Computing higher homotopy groups is W[1]hard.
Fundamenta Informaticae (2014), to appear.
Conference Proceedings (with selection process)

B. Gärtner, A. N. Zehmakan.
Color War: Cellular Automata with Majority Rule.
Proc. International Conference on Language and Automata Theory and
Applications 2017, to appear.
Other (including submitted work)

O. Aichholzer, J. Cardinal, V. Kusters, S. Langerman, P. Valtr.
Reconstructing point set order types from radial orderings.
Submitted.

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).

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.
Submitted (2016).

T. Mütze, J. Nummenpalo. A constanttime algorithm for middle levels Gray codes. Submitted (2016).

A. Pilz, E. Welzl.
Order on order types.
Submitted (2016).

A. Pilz, E. Welzl, M. Wettstein.
From CrossingFree Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices.
Submitted (2016).

P. Schnider.
A generalization of crossing families.
Submitted (2017).

A. Thomas.
Exponential paths for historybased pivot rules on abstract cubes.
Submitted (2017).

M. Wettstein, Trapezoidal Diagrams, Upward Triangulations, and Prime Catalan Numbers.
Submitted (2015).