default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTillmann Miltzow
Till Miltzow
Person information
- affiliation: Utrecht University, The Netherlands
- affiliation (former): FU Berlin, Institute of Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j26]Paul Jungeblut
, Linda Kleist, Tillmann Miltzow:
The Complexity of the Hausdorff Distance. Discret. Comput. Geom. 71(1): 177-213 (2024)- [j25]Daniel Bertschinger, Nicolas El Maalouly, Tillmann Miltzow, Patrick Schnider, Simon Weber:
Topological Art in Simple Galleries. Discret. Comput. Geom. 71(3): 1092-1130 (2024) - [j24]Eun Jung Kim, Arnaud de Mesmay, Tillmann Miltzow:
Representing Matroids over the Reals is ∃ℝ-complete. Discret. Math. Theor. Comput. Sci. 26(2) (2024) - [j23]Jeff Erickson, Ivor van der Hoog, Tillmann Miltzow:
Smoothing the Gap Between NP and ER. SIAM J. Comput. 53(6): S20-102 (2024) - [j22]Mikkel Abrahamsen, Tillmann Miltzow, Nadja Seiferth:
Framework for ∃ ℝ-Completeness of Two-Dimensional Packing Problems. TheoretiCS 3 (2024) - [j21]Tillmann Miltzow, Reinier F. Schmiermann:
On Classifying Continuous Constraint Satisfaction Problems. TheoretiCS 3 (2024) - [c34]Sarita de Berg, Tillmann Miltzow, Frank Staals:
Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain. SoCG 2024: 17:1-17:16 - [c33]Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber:
Geometric Thickness of Multigraphs is ∃ ℝ-Complete. LATIN (1) 2024: 336-349 - [i47]Michael Hoffmann, Tillmann Miltzow, Simon Weber, Lasse Wulf:
Recognition of Unit Segment and Polyline Graphs is ∃R-Complete. CoRR abs/2401.02172 (2024) - [i46]Marcus Schaefer, Jean Cardinal, Tillmann Miltzow:
The Existential Theory of the Reals as a Complexity Class: A Compendium. CoRR abs/2407.18006 (2024) - 2023
- [j20]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): 154-188 (2023) - [j19]Simon B. Hengeveld, Tillmann Miltzow:
A Practical Algorithm with Performance Guarantees for the Art Gallery Problem. Discret. Math. Theor. Comput. Sci. 25(2) (2023) - [c32]Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow:
Geometric Embeddability of Complexes Is ∃ℝ-Complete. SoCG 2023: 1:1-1:19 - [c31]Daniel Bertschinger, Nicolas El Maalouly, Linda Kleist, Tillmann Miltzow, Simon Weber:
The Complexity of Recognizing Geometric Hypergraphs. GD (1) 2023: 163-179 - [c30]Daniel Bertschinger, Christoph Hertrich, Paul Jungeblut, Tillmann Miltzow, Simon Weber:
Training Fully Connected Neural Networks is ∃R-Complete. NeurIPS 2023 - [i45]Eunjung Kim, Arnaud de Mesmay, Tillmann Miltzow:
Representing Matroids over the Reals is ∃R-complete. CoRR abs/2301.03221 (2023) - [i44]Daniel Bertschinger, Nicolas El Maalouly, Linda Kleist, Tillmann Miltzow, Simon Weber:
The Complexity of Recognizing Geometric Hypergraphs. CoRR abs/2302.13597 (2023) - [i43]Sarita de Berg, Tillmann Miltzow, Frank Staals:
Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain. CoRR abs/2303.00666 (2023) - [i42]Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber:
Geometric Thickness of Multigraphs is ∃R-complete. CoRR abs/2312.05010 (2023) - 2022
- [j18]Marc J. van Kreveld, Tillmann Miltzow, Tim Ophelders, Willem Sonke, Jordi L. Vermeulen:
Between shapes, using the Hausdorff distance. Comput. Geom. 100: 101817 (2022) - [j17]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) - [j16]Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow:
The Art Gallery Problem is ∃ℝ-complete. J. ACM 69(1): 4:1-4:70 (2022) - [j15]Anna Lubiw, Tillmann Miltzow, Debajyoti Mondal:
The Complexity of Drawing a Graph in a Polygonal Region. J. Graph Algorithms Appl. 26(4): 421-446 (2022) - [c29]Paul Jungeblut, Linda Kleist, Tillmann Miltzow:
The Complexity of the Hausdorff Distance. SoCG 2022: 48:1-48:17 - [c28]Daniel Bertschinger, Nicolas El Maalouly, Tillmann Miltzow, Patrick Schnider, Simon Weber:
Topological Art in Simple Galleries. SOSA 2022: 87-116 - [i41]Daniel Bertschinger, Christoph Hertrich, Paul Jungeblut, Tillmann Miltzow, Simon Weber:
Training Fully Connected Neural Networks is ∃R-Complete. CoRR abs/2204.01368 (2022) - [i40]Tillmann Miltzow, Milos Stojakovic:
Avoider-Enforcer Game is NP-hard. CoRR abs/2208.06687 (2022) - [i39]Lucas Meijer, Tillmann Miltzow:
Sometimes Two Irrational Guards are Needed. CoRR abs/2212.01211 (2022) - 2021
- [j14]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) - [j13]Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Till Miltzow, Jérôme Urhausen, Jordi L. Vermeulen, Giovanni Viglietta:
Chasing Puppies: Mobile Beacon Routing on Closed Curves. J. Comput. Geom. 13(2): 115-150 (2021) - [c27]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: 5:1-5:19 - [c26]Simon B. Hengeveld, Tillmann Miltzow:
A Practical Algorithm with Performance Guarantees for the Art Gallery Problem. SoCG 2021: 44:1-44:16 - [c25]Tillmann Miltzow, Reinier F. Schmiermann:
On Classifying Continuous Constraint Satisfaction problems. FOCS 2021: 781-791 - [c24]Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow:
Training Neural Networks is ER-complete. NeurIPS 2021: 18293-18306 - [i38]Fabian Klute, Meghana M. Reddy, Tillmann Miltzow:
Local Complexity of Polygons. CoRR abs/2101.07554 (2021) - [i37]Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow:
Training Neural Networks is ER-complete. CoRR abs/2102.09798 (2021) - [i36]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 abs/2103.09811 (2021) - [i35]Tillmann Miltzow, Reinier F. Schmiermann:
On Classifying Continuous Constraint Satisfaction problems. CoRR abs/2106.02397 (2021) - [i34]Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow:
Geometric Embeddability of Complexes is ∃R-complete. CoRR abs/2108.02585 (2021) - [i33]Daniel Bertschinger, Nicolas El Maalouly, Tillmann Miltzow, Patrick Schnider, Simon Weber:
Topological Art in Simple Galleries. CoRR abs/2108.04007 (2021) - [i32]Paul Jungeblut, Linda Kleist, Tillmann Miltzow:
The Complexity of the Hausdorff Distance. CoRR abs/2112.04343 (2021) - 2020
- [j12]Michael Hoffmann, Vincent Kusters, Tillmann Miltzow:
Halving balls by a hyperplane in deterministic linear time. J. Comput. Geom. 11(1): 576-614 (2020) - [j11]Édouard Bonnet, Tillmann Miltzow:
Parameterized Hardness of Art Gallery Problems. ACM Trans. Algorithms 16(4): 42:1-42:23 (2020) - [c23]Tillmann Miltzow, Irene Parada, Willem Sonke, Bettina Speckmann, Jules Wulms:
Hiding Sliding Cubes: Why Reconfiguring Modular Robots Is Not Easy (Media Exposition). SoCG 2020: 78:1-78:5 - [c22]Mikkel Abrahamsen, Tillmann Miltzow, Nadja Seiferth:
Framework for ER-Completeness of Two-Dimensional Packing Problems. FOCS 2020: 1014-1021 - [c21]Jeff Erickson, Ivor van der Hoog, Tillmann Miltzow:
Smoothing the gap between NP and ER. FOCS 2020: 1022-1033 - [c20]Édouard Bonnet, Nicolas Grelier, Tillmann Miltzow:
Maximum Clique in Disk-Like Intersection Graphs. FSTTCS 2020: 17:1-17:18 - [c19]Marc J. van Kreveld, Tillmann Miltzow, Tim Ophelders, Willem Sonke, Jordi L. Vermeulen:
Between Shapes, Using the Hausdorff Distance. ISAAC 2020: 13:1-13:16 - [i31]Édouard Bonnet, Nicolas Grelier, Tillmann Miltzow:
Maximum Clique in Disk-Like Intersection Graphs. CoRR abs/2003.02583 (2020) - [i30]Mikkel Abrahamsen, Tillmann Miltzow, Nadja Seiferth:
Framework for ∃R-Completeness of Two-Dimensional Packing Problems. CoRR abs/2004.07558 (2020) - [i29]Simon B. Hengeveld, Tillmann Miltzow:
A Practical Algorithm with Performance Guarantees for the Art~Gallery Problem. CoRR abs/2007.06920 (2020) - [i28]Marc J. van Kreveld, Tillmann Miltzow, Tim Ophelders, Willem Sonke, Jordi L. Vermeulen:
Between Shapes, Using the Hausdorff Distance. CoRR abs/2009.14719 (2020)
2010 – 2019
- 2019
- [c18]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: 8:1-8:20 - [i27]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 abs/1903.06981 (2019) - [i26]Nicolas Grelier, Saeed Gh. Ilchi, Tillmann Miltzow, Shakhar Smorodinsky:
On the VC-dimension of convex sets and half-spaces. CoRR abs/1907.01241 (2019) - [i25]Ivor van der Hoog, Tillmann Miltzow, Martijn van Schaik:
Smoothed Analysis of Order Types. CoRR abs/1907.04645 (2019) - [i24]Michael Gene Dobbins, Andreas F. Holmsen, Tillmann Miltzow:
A Universality Theorem for Nested Polytopes. CoRR abs/1908.02213 (2019) - [i23]Jeff Erickson, Ivor van der Hoog, Tillmann Miltzow:
A Framework for Robust Realistic Geometric Computations. CoRR abs/1912.02278 (2019) - [i22]Mikkel Abrahamsen, Tillmann Miltzow:
Dynamic Toolbox for ETRINV. CoRR abs/1912.08674 (2019) - 2018
- [j10]Édouard Bonnet, Tillmann Miltzow, Pawel Rzazewski:
Complexity of Token Swapping and Its Variants. Algorithmica 80(9): 2656-2682 (2018) - [j9]Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber:
Intersection Graphs of Rays and Grounded Segments. J. Graph Algorithms Appl. 22(2): 273-295 (2018) - [j8]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): 47-80 (2018) - [c17]Anna Lubiw, Tillmann Miltzow, Debajyoti Mondal:
The Complexity of Drawing a Graph in a Polygonal Region. GD 2018: 387-401 - [c16]Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow:
The art gallery problem is ∃ ℝ-complete. STOC 2018: 65-73 - [c15]Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Pawel Rzazewski:
∀∃ℝ-Completeness and Area-Universality. WG 2018: 164-175 - [i21]Anna Lubiw, Tillmann Miltzow, Debajyoti Mondal:
The Complexity of Drawing a Graph in a Polygonal Region. CoRR abs/1802.06699 (2018) - [i20]Michael Gene Dobbins, Andreas F. Holmsen, Tillmann Miltzow:
Smoothed Analysis of the Art Gallery Problem. CoRR abs/1811.01177 (2018) - 2017
- [c14]Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow:
Irrational Guards are Sometimes Needed. SoCG 2017: 3:1-3:15 - [c13]Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, Pawel Rzazewski:
Fine-Grained Complexity of Coloring Unit Disks and Balls. SoCG 2017: 18:1-18:16 - [c12]Édouard Bonnet, Tillmann Miltzow:
An Approximation Algorithm for the Art Gallery Problem. SoCG 2017: 20:1-20:15 - [c11]Édouard Bonnet, Tillmann Miltzow, Pawel Rzazewski:
Complexity of Token Swapping and its Variants. STACS 2017: 16:1-16:14 - [c10]Bahareh Banyassady, Michael Hoffmann, Boris Klemz, Maarten Löffler, Tillmann Miltzow:
Obedient Plane Drawings for Disk Intersection Graphs. WADS 2017: 73-84 - [c9]Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber:
Intersection Graphs of Rays and Grounded Segments. WG 2017: 153-166 - [i19]Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow:
Irrational Guards are Sometimes Needed. CoRR abs/1701.05475 (2017) - [i18]Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow:
The Art Gallery Problem is ∃ℝ-complete. CoRR abs/1704.06969 (2017) - [i17]Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Pawel Rzazewski:
∀∃R-completeness and area-universality. CoRR abs/1712.05142 (2017) - 2016
- [j7]Andrei Asinowski, Balázs Keszegh, Tillmann Miltzow:
Counting houses of Pareto optimal matchings in the house allocation problem. Discret. Math. 339(12): 2919-2932 (2016) - [c8]Dániel Marx, Tillmann Miltzow:
Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems. SoCG 2016: 52:1-52:16 - [c7]Édouard Bonnet, Tillmann Miltzow:
Parameterized Hardness of Art Gallery Problems. ESA 2016: 19:1-19:17 - [c6]Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Günter Rote, Antonis Thomas, Takeaki Uno:
Approximation and Hardness of Token Swapping. ESA 2016: 66:1-66:15 - [i16]Édouard Bonnet, Tillmann Miltzow:
Flip Distance to a Non-crossing Perfect Matching. CoRR abs/1601.05989 (2016) - [i15]Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Günter Rote, Antonis Thomas, Takeaki Uno:
Tight Exact and Approximate Algorithmic Results on Token Swapping. CoRR abs/1602.05150 (2016) - [i14]Dániel Marx, Tillmann Miltzow:
Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems. CoRR abs/1603.07340 (2016) - [i13]Édouard Bonnet, Tillmann Miltzow:
The Parameterized Hardness of the Art Gallery Problem. CoRR abs/1603.08116 (2016) - [i12]Édouard Bonnet, Tillmann Miltzow:
An Approximation Algorithm for the Art Gallery Problem. CoRR abs/1607.05527 (2016) - [i11]Édouard Bonnet, Tillmann Miltzow, Pawel Rzazewski:
Complexity of Token Swapping and its Variants. CoRR abs/1607.07676 (2016) - [i10]Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber:
Intersection Graphs of Rays and Grounded Segments. CoRR abs/1612.03638 (2016) - 2015
- [j6]Oswin Aichholzer, Andrei Asinowski, Tillmann Miltzow:
Disjoint Compatibility Graph of Non-Crossing Matchings of Points in Convex Position. Electron. J. Comb. 22(1): 1 (2015) - [j5]Tillmann Miltzow, Jens M. Schmidt, Mingji Xia:
Counting K4-subdivisions. Discret. Math. 338(12): 2387-2392 (2015) - [j4]Andrei Asinowski, Tillmann Miltzow, Günter Rote:
Quasi-parallel segments and characterization of unique bichromatic matchings. J. Comput. Geom. 6(1): 185-219 (2015) - [c5]Udo Hoffmann, Linda Kleist, Tillmann Miltzow:
Upper and Lower Bounds on Long Dual Paths in Line Arrangements. MFCS (2) 2015: 407-419 - [i9]Udo Hoffmann, Linda Kleist, Tillmann Miltzow:
Upper and Lower Bounds on Long Dual-Paths in Line Arrangements. CoRR abs/1506.03728 (2015) - 2014
- [j3]Oswin Aichholzer, Tillmann Miltzow, Alexander Pilz:
Reprint of: Extreme point and halving edge search in abstract order types. Comput. Geom. 47(3): 518-526 (2014) - [c4]Michael Hoffmann, Vincent Kusters, Tillmann Miltzow:
Halving Balls in Deterministic Linear Time. ESA 2014: 566-578 - [c3]Andrei Asinowski, Balázs Keszegh, Tillmann Miltzow:
Counting Houses of Pareto Optimal Matchings in the House Allocation Problem. FUN 2014: 301-312 - [i8]Andrei Asinowski, Balázs Keszegh, Tillmann Miltzow:
Counting One-sided Exchange Stable Matchings. CoRR abs/1401.5354 (2014) - [i7]Oswin Aichholzer, Andrei Asinowski, Tillmann Miltzow:
Disjoint compatibility graph of non-crossing matchings of points in convex position. CoRR abs/1403.5546 (2014) - [i6]Michael Hoffmann, Vincent Kusters, Tillmann Miltzow:
Halving Balls in Deterministic Linear Time. CoRR abs/1405.1894 (2014) - [i5]Tillmann Miltzow, Jens M. Schmidt, Mingji Xia:
Counting K_4-Subdivisions. CoRR abs/1411.4819 (2014) - 2013
- [j2]Oswin Aichholzer, Tillmann Miltzow, Alexander Pilz:
Extreme point and halving edge search in abstract order types. Comput. Geom. 46(8): 970-978 (2013) - [i4]Andrei Asinowski, Tillmann Miltzow, Günter Rote:
Quasi-Parallel Segments and Characterization of Unique Bichromatic Matchings. CoRR abs/1302.4400 (2013) - 2012
- [c2]Tillmann Miltzow:
Tron, a Combinatorial Game on Abstract Graphs. FUN 2012: 293-304 - [i3]Tillmann Miltzow:
Augmenting a Geometric Matching is NP-complete. CoRR abs/1206.6360 (2012) - [i2]Tillmann Miltzow:
Trees in simple Polygons. CoRR abs/1211.2118 (2012) - 2011
- [j1]Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Tillmann Miltzow, Rom Pinchasi, Torsten Ueckerdt, Ran Ziv:
Points with Large Quadrant Depth. J. Comput. Geom. 2(1): 128-143 (2011) - [i1]Tillmann Miltzow:
Tron, a combinatorial Game on abstract Graphs. CoRR abs/1110.3211 (2011) - 2010
- [c1]Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Rom Pinchasi, Tillmann Miltzow:
Points with large quadrant-depth. SCG 2010: 358-364
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
