Points with large quadrant-depth. - Roel Apfelbaum; Itay Ben-Dan; Stefan Felsner; Rom Pinchasi; Tillmann Miltzow (SCG, 2010)

Points with Large Quadrant Depth. - Roel Apfelbaum; Itay Ben-Dan; Stefan Felsner; Tillmann Miltzow; Rom Pinchasi; Torsten Ueckerdt; Ran Ziv (J. Comput. Geom., 2011)

Tron, a Combinatorial Game on Abstract Graphs. - Tillmann Miltzow (FUN, 2012)

Augmenting a Geometric Matching is NP-complete - Tillmann Miltzow (CoRR, 2012)

Trees in simple Polygons - Tillmann Miltzow (CoRR, 2012)

Extreme point and halving edge search in abstract order types. - Oswin Aichholzer; Tillmann Miltzow; Alexander Pilz (Comput. Geom., 2013)

Halving Balls in Deterministic Linear Time. - Michael Hoffmann 001; Vincent Kusters; Tillmann Miltzow (ESA, 2014)

Reprint of: Extreme point and halving edge search in abstract order types. - Oswin Aichholzer; Tillmann Miltzow; Alexander Pilz (Comput. Geom., 2014)

Counting One-sided Exchange Stable Matchings. - Andrei Asinowski; Balázs Keszegh; Tillmann Miltzow (CoRR, 2014)

Counting K_4-Subdivisions. - Tillmann Miltzow; Jens M. Schmidt; Mingji Xia (CoRR, 2014)

Upper and Lower Bounds on Long Dual Paths in Line Arrangements. - Udo Hoffmann; Linda Kleist; Tillmann Miltzow (MFCS (2), 2015)

Disjoint Compatibility Graph of Non-Crossing Matchings of Points in Convex Position. - Oswin Aichholzer; Andrei Asinowski; Tillmann Miltzow (Electron. J. Comb., 2015)

Counting K4-subdivisions. - Tillmann Miltzow; Jens M. Schmidt; Mingji Xia (Discret. Math., 2015)

Quasi-parallel segments and characterization of unique bichromatic matchings. - Andrei Asinowski; Tillmann Miltzow; Günter Rote (J. Comput. Geom., 2015)

Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems. - Dániel Marx; Tillmann Miltzow (SoCG, 2016)

Approximation and Hardness of Token Swapping. - Tillmann Miltzow; Lothar Narins; Yoshio Okamoto; Günter Rote; Antonis Thomas; Takeaki Uno (ESA, 2016)

Flip Distance to a Non-crossing Perfect Matching. - Édouard Bonnet; Tillmann Miltzow (CoRR, 2016)

The Parameterized Hardness of the Art Gallery Problem. - Édouard Bonnet; Tillmann Miltzow (CoRR, 2016)

Tight Exact and Approximate Algorithmic Results on Token Swapping. - Tillmann Miltzow; Lothar Narins; Yoshio Okamoto; Günter Rote; Antonis Thomas; Takeaki Uno (CoRR, 2016)

Counting houses of Pareto optimal matchings in the house allocation problem. - Andrei Asinowski; Balázs Keszegh; Tillmann Miltzow (Discret. Math., 2016)

Irrational Guards are Sometimes Needed. - Mikkel Abrahamsen; Anna Adamaszek; Tillmann Miltzow (SoCG, 2017)

An Approximation Algorithm for the Art Gallery Problem. - Édouard Bonnet; Tillmann Miltzow (SoCG, 2017)

Obedient Plane Drawings for Disk Intersection Graphs. - Bahareh Banyassady; Michael Hoffmann 001; Boris Klemz; Maarten Löffler; Tillmann Miltzow (WADS, 2017)

∀∃ℝ-Completeness and Area-Universality. - Michael Gene Dobbins; Linda Kleist; Tillmann Miltzow; Pawel Rzazewski (WG, 2018)

Complexity of Token Swapping and Its Variants. - Édouard Bonnet; Tillmann Miltzow; Pawel Rzazewski (Algorithmica, 2018)

Smoothed Analysis of the Art Gallery Problem. - Michael Gene Dobbins; Andreas F. Holmsen; Tillmann Miltzow (CoRR, 2018)

Intersection Graphs of Rays and Grounded Segments. - Jean Cardinal; Stefan Felsner; Tillmann Miltzow; Casey Tompkins; Birgit Vogtenhuber (J. Graph Algorithms Appl., 2018)

Fine-grained complexity of coloring unit disks and balls. - Csaba Biró; Édouard Bonnet; Dániel Marx; Tillmann Miltzow; Pawel Rzazewski (J. Comput. Geom., 2018)

Parameterized Streaming Algorithms for Min-Ones d-SAT. - Akanksha Agrawal 001; Arindam Biswas 001; Édouard Bonnet; Nick Brettell; Radu Curticapean; Dániel Marx; Tillmann Miltzow; Venkatesh Raman 001; Saket Saurabh 001 (FSTTCS, 2019)

On the VC-dimension of convex sets and half-spaces. - Nicolas Grelier; Saeed Gh. Ilchi; Tillmann Miltzow; Shakhar Smorodinsky (CoRR, 2019)

Smoothed Analysis of Order Types. - Ivor van der Hoog; Tillmann Miltzow; Martijn van Schaik (CoRR, 2019)

A Universality Theorem for Nested Polytopes. - Michael Gene Dobbins; Andreas F. Holmsen; Tillmann Miltzow (CoRR, 2019)

A Framework for Robust Realistic Geometric Computations. - Jeff Erickson 001; Ivor van der Hoog; Tillmann Miltzow (CoRR, 2019)

Dynamic Toolbox for ETRINV. - Mikkel Abrahamsen; Tillmann Miltzow (CoRR, 2019)

Hiding Sliding Cubes: Why Reconfiguring Modular Robots Is Not Easy (Media Exposition). - Tillmann Miltzow; Irene Parada; Willem Sonke; Bettina Speckmann; Jules Wulms (SoCG, 2020)

Framework for ER-Completeness of Two-Dimensional Packing Problems. - Mikkel Abrahamsen; Tillmann Miltzow; Nadja Seiferth (FOCS, 2020)

Maximum Clique in Disk-Like Intersection Graphs. - Édouard Bonnet; Nicolas Grelier; Tillmann Miltzow (FSTTCS, 2020)

Halving balls by a hyperplane in deterministic linear time. - Michael Hoffmann 001; Vincent Kusters; Tillmann Miltzow (J. Comput. Geom., 2020)

Parameterized Hardness of Art Gallery Problems. - Édouard Bonnet; Tillmann Miltzow (ACM Trans. Algorithms, 2020)

Training Neural Networks is ER-complete. - Mikkel Abrahamsen; Linda Kleist; Tillmann Miltzow (NeurIPS, 2021)

Local Complexity of Polygons. - Fabian Klute; Meghana M. Reddy; Tillmann Miltzow (CoRR, 2021)

On the VC-dimension of half-spaces with respect to convex sets. - Nicolas Grelier; Saeed Gh. Ilchi; Tillmann Miltzow; Shakhar Smorodinsky (Discret. Math. Theor. Comput. Sci., 2021)

Chasing Puppies: Mobile Beacon Routing on Closed Curves. - Mikkel Abrahamsen; Jeff Erickson 001; Irina Kostitsyna; Maarten Löffler; Till Miltzow; Jérôme Urhausen; Jordi L. Vermeulen; Giovanni Viglietta (J. Comput. Geom., 2021)

Between shapes, using the Hausdorff distance. - Marc J. van Kreveld; Tillmann Miltzow; Tim Ophelders; Willem Sonke; Jordi L. Vermeulen (Comput. Geom., 2022)

Avoider-Enforcer Game is NP-hard. - Tillmann Miltzow; Milos Stojakovic (CoRR, 2022)

Sometimes Two Irrational Guards are Needed. - Lucas Meijer; Tillmann Miltzow (CoRR, 2022)

Token Swapping on Trees. - Ahmad Biniaz; Kshitij Jain 001; Anna Lubiw; Zuzana Masárová; Tillmann Miltzow; Debajyoti Mondal; Anurag Murty Naredla; Josef Tkadlec; Alexi Turcotte (Discret. Math. Theor. Comput. Sci., 2022)

The Art Gallery Problem is ∃ℝ-complete. - Mikkel Abrahamsen; Anna Adamaszek; Tillmann Miltzow (J. ACM, 2022)

The Complexity of Drawing a Graph in a Polygonal Region. - Anna Lubiw; Tillmann Miltzow; Debajyoti Mondal (J. Graph Algorithms Appl., 2022)

The Complexity of Recognizing Geometric Hypergraphs. - Daniel Bertschinger; Nicolas El Maalouly; Linda Kleist; Tillmann Miltzow; Simon Weber 001 (GD (1), 2023)

Training Fully Connected Neural Networks is ∃R-Complete. - Daniel Bertschinger; Christoph Hertrich; Paul Jungeblut; Tillmann Miltzow; Simon Weber 001 (NeurIPS, 2023)

A Practical Algorithm with Performance Guarantees for the Art Gallery Problem. - Simon B. Hengeveld; Tillmann Miltzow (Discret. Math. Theor. Comput. Sci., 2023)

Completeness for the Complexity Class $ forall exists mathbb {R}$ and Area-Universality. - Michael Gene Dobbins; Linda Kleist; Tillmann Miltzow; Pawel Rzazewski (Discret. Comput. Geom., 2023)

Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain. - Sarita de Berg; Tillmann Miltzow; Frank Staals (SoCG, 2024)

Geometric Thickness of Multigraphs is ∃ ℝ-Complete. - Henry Förster; Philipp Kindermann; Tillmann Miltzow; Irene Parada; Soeren Terziadis; Birgit Vogtenhuber (LATIN (1), 2024)

Recognition of Unit Segment and Polyline Graphs is $ exists mathbb {R} $-Complete. - Michael Hoffmann 001; Tillmann Miltzow; Simon Weber 001; Lasse Wulf (WG, 2024)

Recognition of Unit Segment and Polyline Graphs is ∃R-Complete. - Michael Hoffmann 001; Tillmann Miltzow; Simon Weber 001; Lasse Wulf (CoRR, 2024)

The Existential Theory of the Reals as a Complexity Class: A Compendium. - Marcus Schaefer 001; Jean Cardinal; Tillmann Miltzow (CoRR, 2024)

Representing Matroids over the Reals is ∃ℝ-complete. - Eun Jung Kim 002; Arnaud de Mesmay; Tillmann Miltzow (Discret. Math. Theor. Comput. Sci., 2024)

Smoothing the Gap Between NP and ER. - Jeff Erickson 001; Ivor van der Hoog; Tillmann Miltzow (SIAM J. Comput., 2024)

Framework for ∃ ℝ-Completeness of Two-Dimensional Packing Problems. - Mikkel Abrahamsen; Tillmann Miltzow; Nadja Seiferth (TheoretiCS, 2024)

On Classifying Continuous Constraint Satisfaction Problems. - Tillmann Miltzow; Reinier F. Schmiermann (TheoretiCS, 2024)

The Complexity of the Hausdorff Distance. - Paul Jungeblut; Linda Kleist; Tillmann Miltzow (Discret. Comput. Geom., 2024)

Topological Art in Simple Galleries. - Daniel Bertschinger; Nicolas El Maalouly; Tillmann Miltzow; Patrick Schnider; Simon Weber 001 (Discret. Comput. Geom., 2024)

Oracle Separations for RPH. - Thekla Hamm; Lucas Meijer; Tillmann Miltzow; Subhasree Patro (CoRR, 2025)

Geometric Embeddability of Complexes is ∃ℝ-complete. - Mikkel Abrahamsen; Linda Kleist; Tillmann Miltzow (J. ACM, 2025)