Skip to content

Tillmann Miltzow

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

20

Venues

11

Active years

2012–2026

Best venue rank

A*

Where they publish

Papers

20 indexed papers, newest first.

YearVenueTitleAuthors
2026MFCSOn Equivalent Characterizations of the Polynomial Hierarchy in Abstract Models of Computation.Jeremy C. Kirn, Lucas Meijer, Tillmann Miltzow, Hans L. Bodlaender
2024LATINGeometric Thickness of Multigraphs is ∃ ℝ-Complete.Henry Frster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber
2024WGRecognition of Unit Segment and Polyline Graphs is $\exists \mathbb {R} $-Complete.Michael Hoffmann, Tillmann Miltzow, Simon Weber, Lasse Wulf
2023GDThe Complexity of Recognizing Geometric Hypergraphs.Daniel Bertschinger, Nicolas El Maalouly, Linda Kleist, Tillmann Miltzow, Simon Weber
2021FOCSOn Classifying Continuous Constraint Satisfaction problems.Tillmann Miltzow, Reinier F. Schmiermann
2020FOCSSmoothing the gap between NP and ER.Jeff Erickson, Ivor van der Hoog, Tillmann Miltzow
2020FOCSFramework for ER-Completeness of Two-Dimensional Packing Problems.Mikkel Abrahamsen, Tillmann Miltzow, Nadja Seiferth
2020ISAACBetween Shapes, Using the Hausdorff Distance.Marc J. van Kreveld, Tillmann Miltzow, Tim Ophelders, Willem Sonke, Jordi L. Vermeulen
2018GDThe Complexity of Drawing a Graph in a Polygonal Region.Anna Lubiw, Tillmann Miltzow, Debajyoti Mondal
2018STOCThe art gallery problem is ∃ ℝ-complete.Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
2018WG∀∃ℝ-Completeness and Area-Universality.Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Pawel Rzazewski
2017STACSComplexity of Token Swapping and its Variants.douard Bonnet, Tillmann Miltzow, Pawel Rzazewski
2017WADSObedient Plane Drawings for Disk Intersection Graphs.Bahareh Banyassady, Michael Hoffmann, Boris Klemz, Maarten Lffler, Tillmann Miltzow
2017WGIntersection Graphs of Rays and Grounded Segments.Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber
2016ESAParameterized Hardness of Art Gallery Problems.douard Bonnet, Tillmann Miltzow
2016ESAApproximation and Hardness of Token Swapping.Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Gnter Rote, Antonis Thomas, Takeaki Uno
2015MFCSUpper and Lower Bounds on Long Dual Paths in Line Arrangements.Udo Hoffmann, Linda Kleist, Tillmann Miltzow
2014ESAHalving Balls in Deterministic Linear Time.Michael Hoffmann, Vincent Kusters, Tillmann Miltzow
2014FUNCounting Houses of Pareto Optimal Matchings in the House Allocation Problem.Andrei Asinowski, Balzs Keszegh, Tillmann Miltzow
2012FUNTron, a Combinatorial Game on Abstract Graphs.Tillmann Miltzow