Tillmann Miltzow

ORCID

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 82

Top Venues

CoRR

SoCG

FOCS

Discret. Comput. Geom.

Publications

Marcus Schaefer, Jean Cardinal, Tillmann Miltzow
The Existential Theory of the Reals as a Complexity Class: A Compendium. CoRR (2024)
Daniel Bertschinger, Nicolas El Maalouly, Tillmann Miltzow, Patrick Schnider, Simon Weber
Topological Art in Simple Galleries. Discret. Comput. Geom. 71 (3) (2024)
Paul Jungeblut, Linda Kleist, Tillmann Miltzow
The Complexity of the Hausdorff Distance. Discret. Comput. Geom. 71 (1) (2024)
Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber
Geometric Thickness of Multigraphs is ∃ ℝ-Complete. LATIN (1) (2024)
Michael Hoffmann, Tillmann Miltzow, Simon Weber, Lasse Wulf
Recognition of Unit Segment and Polyline Graphs is ∃R-Complete. CoRR (2024)
Sarita de Berg, Tillmann Miltzow, Frank Staals
Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain. SoCG (2024)
Daniel Bertschinger, Nicolas El Maalouly, Linda Kleist, Tillmann Miltzow, Simon Weber
The Complexity of Recognizing Geometric Hypergraphs. GD (1) (2023)
Sarita de Berg, Tillmann Miltzow, Frank Staals
Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain. CoRR (2023)
Daniel Bertschinger, Nicolas El Maalouly, Linda Kleist, Tillmann Miltzow, Simon Weber
The Complexity of Recognizing Geometric Hypergraphs. CoRR (2023)
Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow
Geometric Embeddability of Complexes Is ∃ℝ-Complete. SoCG (2023)
Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber
Geometric Thickness of Multigraphs is ∃R-complete. CoRR (2023)
Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Pawel Rzazewski
Completeness for the Complexity Class $\forall \exists \mathbb {R}$ and Area-Universality. Discret. Comput. Geom. 70 (1) (2023)
Eunjung Kim, Arnaud de Mesmay, Tillmann Miltzow
Representing Matroids over the Reals is ∃R-complete. CoRR (2023)
Daniel Bertschinger, Christoph Hertrich, Paul Jungeblut, Tillmann Miltzow, Simon Weber
Training Fully Connected Neural Networks is ∃R-Complete. NeurIPS (2023)
Daniel Bertschinger, Nicolas El Maalouly, Tillmann Miltzow, Patrick Schnider, Simon Weber
Topological Art in Simple Galleries. SOSA (2022)
Tillmann Miltzow, Reinier F. Schmiermann
On Classifying Continuous Constraint Satisfaction problems. FOCS (2022)
Marc J. van Kreveld, Tillmann Miltzow, Tim Ophelders, Willem Sonke, Jordi L. Vermeulen
Between shapes, using the Hausdorff distance. Comput. Geom. 100 (2022)
Daniel Bertschinger, Christoph Hertrich, Paul Jungeblut, Tillmann Miltzow, Simon Weber
Training Fully Connected Neural Networks is ∃R-Complete. CoRR (2022)
Anna Lubiw, Tillmann Miltzow, Debajyoti Mondal
The Complexity of Drawing a Graph in a Polygonal Region. J. Graph Algorithms Appl. 26 (4) (2022)
Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
The Art Gallery Problem is ∃ℝ-complete. J. ACM 69 (1) (2022)
Ahmad Biniaz, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, Alexi Turcotte
Token Swapping on Trees. Discret. Math. Theor. Comput. Sci. 24 (2) (2022)
Tillmann Miltzow, Milos Stojakovic
Avoider-Enforcer Game is NP-hard. CoRR (2022)
Lucas Meijer, Tillmann Miltzow
Sometimes Two Irrational Guards are Needed. CoRR (2022)
Paul Jungeblut, Linda Kleist, Tillmann Miltzow
The Complexity of the Hausdorff Distance. SoCG (2022)
Fabian Klute, Meghana M. Reddy, Tillmann Miltzow
Local Complexity of Polygons. CoRR (2021)
Simon B. Hengeveld, Tillmann Miltzow
A Practical Algorithm with Performance Guarantees for the Art Gallery Problem. SoCG (2021)
Paul Jungeblut, Linda Kleist, Tillmann Miltzow
The Complexity of the Hausdorff Distance. CoRR (2021)
Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow
Training Neural Networks is ER-complete. NeurIPS (2021)
Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow
Training Neural Networks is ER-complete. CoRR (2021)
Nicolas Grelier, Saeed Gh. Ilchi, Tillmann Miltzow, Shakhar Smorodinsky
On the VC-dimension of half-spaces with respect to convex sets. Discret. Math. Theor. Comput. Sci. 23 (3) (2021)
Tillmann Miltzow, Reinier F. Schmiermann
On Classifying Continuous Constraint Satisfaction problems. CoRR (2021)
Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Tillmann Miltzow, Jérôme Urhausen, Jordi L. Vermeulen, Giovanni Viglietta
Chasing Puppies: Mobile Beacon Routing on Closed Curves. SoCG (2021)
Tillmann Miltzow, Reinier F. Schmiermann
On Classifying Continuous Constraint Satisfaction problems. FOCS (2021)
Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow
Geometric Embeddability of Complexes is ∃R-complete. CoRR (2021)
Daniel Bertschinger, Nicolas El Maalouly, Tillmann Miltzow, Patrick Schnider, Simon Weber
Topological Art in Simple Galleries. CoRR (2021)
Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Tillmann Miltzow, Jérôme Urhausen, Jordi L. Vermeulen, Giovanni Viglietta
Chasing Puppies: Mobile Beacon Routing on Closed Curves. CoRR (2021)
Simon B. Hengeveld, Tillmann Miltzow
A Practical Algorithm with Performance Guarantees for the Art~Gallery Problem. CoRR (2020)
Édouard Bonnet, Nicolas Grelier, Tillmann Miltzow
Maximum Clique in Disk-Like Intersection Graphs. CoRR (2020)
Tillmann Miltzow, Irene Parada, Willem Sonke, Bettina Speckmann, Jules Wulms
Hiding Sliding Cubes: Why Reconfiguring Modular Robots Is Not Easy (Media Exposition). SoCG (2020)
Édouard Bonnet, Nicolas Grelier, Tillmann Miltzow
Maximum Clique in Disk-Like Intersection Graphs. FSTTCS (2020)
Marc J. van Kreveld, Tillmann Miltzow, Tim Ophelders, Willem Sonke, Jordi L. Vermeulen
Between Shapes, Using the Hausdorff Distance. CoRR (2020)
Jeff Erickson, Ivor van der Hoog, Tillmann Miltzow
Smoothing the gap between NP and ER. FOCS (2020)
Mikkel Abrahamsen, Tillmann Miltzow, Nadja Seiferth
Framework for ∃R-Completeness of Two-Dimensional Packing Problems. CoRR (2020)
Édouard Bonnet, Tillmann Miltzow
Parameterized Hardness of Art Gallery Problems. ACM Trans. Algorithms 16 (4) (2020)
Mikkel Abrahamsen, Tillmann Miltzow, Nadja Seiferth
Framework for ER-Completeness of Two-Dimensional Packing Problems. FOCS (2020)
Marc J. van Kreveld, Tillmann Miltzow, Tim Ophelders, Willem Sonke, Jordi L. Vermeulen
Between Shapes, Using the Hausdorff Distance. ISAAC (2020)
Michael Hoffmann, Vincent Kusters, Tillmann Miltzow
Halving balls by a hyperplane in deterministic linear time. J. Comput. Geom. 11 (1) (2020)
Akanksha Agrawal, Arindam Biswas, Édouard Bonnet, Nick Brettell, Radu Curticapean, Dániel Marx, Tillmann Miltzow, Venkatesh Raman, Saket Saurabh
Parameterized Streaming Algorithms for Min-Ones d-SAT. FSTTCS (2019)
Jeff Erickson, Ivor van der Hoog, Tillmann Miltzow
A Framework for Robust Realistic Geometric Computations. CoRR (2019)
Michael Gene Dobbins, Andreas F. Holmsen, Tillmann Miltzow
A Universality Theorem for Nested Polytopes. CoRR (2019)
Mikkel Abrahamsen, Tillmann Miltzow
Dynamic Toolbox for ETRINV. CoRR (2019)
Ahmad Biniaz, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, Alexi Turcotte
Token Swapping on Trees. CoRR (2019)
Ivor van der Hoog, Tillmann Miltzow, Martijn van Schaik
Smoothed Analysis of Order Types. CoRR (2019)
Nicolas Grelier, Saeed Gh. Ilchi, Tillmann Miltzow, Shakhar Smorodinsky
On the VC-dimension of convex sets and half-spaces. CoRR (2019)
Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber
Intersection Graphs of Rays and Grounded Segments. J. Graph Algorithms Appl. 22 (2) (2018)
Anna Lubiw, Tillmann Miltzow, Debajyoti Mondal
The Complexity of Drawing a Graph in a Polygonal Region. CoRR (2018)
Michael Gene Dobbins, Andreas F. Holmsen, Tillmann Miltzow
Smoothed Analysis of the Art Gallery Problem. CoRR (2018)
Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Pawel Rzazewski
∀∃ℝ-Completeness and Area-Universality. WG (2018)
Édouard Bonnet, Tillmann Miltzow, Pawel Rzazewski
Complexity of Token Swapping and Its Variants. Algorithmica 80 (9) (2018)
Anna Lubiw, Tillmann Miltzow, Debajyoti Mondal
The Complexity of Drawing a Graph in a Polygonal Region. Graph Drawing (2018)
Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
The art gallery problem is ∃ ℝ-complete. STOC (2018)
Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, Pawel Rzazewski
Fine-grained complexity of coloring unit disks and balls. J. Comput. Geom. 9 (2) (2018)
Édouard Bonnet, Tillmann Miltzow
An Approximation Algorithm for the Art Gallery Problem. SoCG (2017)
Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
The Art Gallery Problem is ∃ℝ-complete. CoRR (2017)
Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
Irrational Guards are Sometimes Needed. SoCG (2017)
Bahareh Banyassady, Michael Hoffmann, Boris Klemz, Maarten Löffler, Tillmann Miltzow
Obedient Plane Drawings for Disk Intersection Graphs. WADS (2017)
Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, Pawel Rzazewski
Fine-Grained Complexity of Coloring Unit Disks and Balls. SoCG (2017)
Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber
Intersection Graphs of Rays and Grounded Segments. WG (2017)
Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Pawel Rzazewski
∀∃R-completeness and area-universality. CoRR (2017)
Édouard Bonnet, Tillmann Miltzow, Pawel Rzazewski
Complexity of Token Swapping and its Variants. STACS (2017)
Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
Irrational Guards are Sometimes Needed. CoRR (2017)
Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Günter Rote, Antonis Thomas, Takeaki Uno
Approximation and Hardness of Token Swapping. ESA (2016)
Dániel Marx, Tillmann Miltzow
Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems. CoRR (2016)
Édouard Bonnet, Tillmann Miltzow
Flip Distance to a Non-crossing Perfect Matching. CoRR (2016)
Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber
Intersection Graphs of Rays and Grounded Segments. CoRR (2016)
Andrei Asinowski, Balázs Keszegh, Tillmann Miltzow
Counting houses of Pareto optimal matchings in the house allocation problem. Discret. Math. 339 (12) (2016)
Édouard Bonnet, Tillmann Miltzow, Pawel Rzazewski
Complexity of Token Swapping and its Variants. CoRR (2016)
Édouard Bonnet, Tillmann Miltzow
Parameterized Hardness of Art Gallery Problems. ESA (2016)
Édouard Bonnet, Tillmann Miltzow
An Approximation Algorithm for the Art Gallery Problem. CoRR (2016)
Dániel Marx, Tillmann Miltzow
Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems. SoCG (2016)
Édouard Bonnet, Tillmann Miltzow
The Parameterized Hardness of the Art Gallery Problem. CoRR (2016)
Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Günter Rote, Antonis Thomas, Takeaki Uno
Tight Exact and Approximate Algorithmic Results on Token Swapping. CoRR (2016)
Udo Hoffmann, Linda Kleist, Tillmann Miltzow
Upper and Lower Bounds on Long Dual Paths in Line Arrangements. MFCS (2) (2015)
Tillmann Miltzow, Jens M. Schmidt, Mingji Xia
-subdivisions. Discret. Math. 338 (12) (2015)
Andrei Asinowski, Tillmann Miltzow, Günter Rote
Quasi-parallel segments and characterization of unique bichromatic matchings. J. Comput. Geom. 6 (1) (2015)
Oswin Aichholzer, Andrei Asinowski, Tillmann Miltzow
Disjoint Compatibility Graph of Non-Crossing Matchings of Points in Convex Position. Electron. J. Comb. 22 (1) (2015)
Udo Hoffmann, Linda Kleist, Tillmann Miltzow
Upper and Lower Bounds on Long Dual-Paths in Line Arrangements. CoRR (2015)
Michael Hoffmann, Vincent Kusters, Tillmann Miltzow
Halving Balls in Deterministic Linear Time. CoRR (2014)
Michael Hoffmann, Vincent Kusters, Tillmann Miltzow
Halving Balls in Deterministic Linear Time. ESA (2014)
Tillmann Miltzow, Jens M. Schmidt, Mingji Xia
Counting K_4-Subdivisions. CoRR (2014)
Oswin Aichholzer, Andrei Asinowski, Tillmann Miltzow
Disjoint compatibility graph of non-crossing matchings of points in convex position. CoRR (2014)
Oswin Aichholzer, Tillmann Miltzow, Alexander Pilz
Reprint of: Extreme point and halving edge search in abstract order types. Comput. Geom. 47 (3) (2014)
Andrei Asinowski, Balázs Keszegh, Tillmann Miltzow
Counting Houses of Pareto Optimal Matchings in the House Allocation Problem. FUN (2014)
Andrei Asinowski, Balázs Keszegh, Tillmann Miltzow
Counting One-sided Exchange Stable Matchings. CoRR (2014)
Andrei Asinowski, Tillmann Miltzow, Günter Rote
Quasi-Parallel Segments and Characterization of Unique Bichromatic Matchings CoRR (2013)
Oswin Aichholzer, Tillmann Miltzow, Alexander Pilz
Extreme point and halving edge search in abstract order types. Comput. Geom. 46 (8) (2013)
Tillmann Miltzow
Trees in simple Polygons CoRR (2012)
Tillmann Miltzow
Tron, a Combinatorial Game on Abstract Graphs. FUN (2012)
Tillmann Miltzow
Augmenting a Geometric Matching is NP-complete CoRR (2012)
Tillmann Miltzow
Tron, a combinatorial Game on abstract Graphs CoRR (2011)

Tillmann Miltzow.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Tillmann Miltzow