Follow
Tillmann Miltzow
Tillmann Miltzow
Verified email at uu.nl - Homepage
Title
Cited by
Cited by
Year
The art gallery problem is ∃ℝ-complete
M Abrahamsen, A Adamaszek, T Miltzow
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
642018
Approximation and hardness for token swapping
T Miltzow, L Narins, Y Okamoto, G Rote, A Thomas, T Uno
arXiv preprint arXiv:1602.05150, 2016
472016
Intersection graphs of rays and grounded segments
J Cardinal, S Felsner, T Miltzow, C Tompkins, B Vogtenhuber
International Workshop on Graph-Theoretic Concepts in Computer Science, 153-166, 2017
442017
Complexity of token swapping and its variants
É Bonnet, T Miltzow, P Rzążewski
Algorithmica 80 (9), 2656-2682, 2018
412018
An approximation algorithm for the art gallery problem
É Bonnet, T Miltzow
arXiv preprint arXiv:1607.05527, 2016
312016
The Parameterized Hardness of Art Gallery Problems
É Bonnet, T Miltzow
arXiv preprint arXiv:1603.08116, 2016
31*2016
A framework for robust realistic geometric computations
J Erickson, I van der Hoog, T Miltzow
arXiv. org, 2019
28*2019
Completeness for the Complexity Class and Area-Universality
MG Dobbins, L Kleist, T Miltzow, P Rzążewski
Discrete & Computational Geometry, 1-35, 2022
27*2022
The complexity of drawing a graph in a polygonal region
A Lubiw, T Miltzow, D Mondal
International Symposium on Graph Drawing and Network Visualization, 387-401, 2018
242018
Framework for ER-completeness of two-dimensional packing problems
M Abrahamsen, T Miltzow, N Seiferth
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
222020
Irrational guards are sometimes needed
M Abrahamsen, A Adamaszek, T Miltzow
arXiv preprint arXiv:1701.05475, 2017
172017
Training neural networks is ER-complete
M Abrahamsen, L Kleist, T Miltzow
Advances in Neural Information Processing Systems 34, 18293-18306, 2021
162021
Fine-grained complexity of coloring unit disks and balls
B Csaba, É Bonnet, D Marx, M Tillmann, P Rzążewski
Journal of Computational Geometry, 2018
16*2018
Peeling and nibbling the cactus: Subexponential-time algorithms for counting triangulations and related problems
D Marx, T Miltzow
arXiv preprint arXiv:1603.07340, 2016
162016
Disjoint compatibility graph of non-crossing matchings of points in convex position
O Aichholzer, A Asinowski, T Miltzow
arXiv preprint arXiv:1403.5546, 2014
152014
Reprint of: Extreme point and halving edge search in abstract order types
O Aichholzer, T Miltzow, A Pilz
Computational Geometry 47 (3), 518-526, 2014
14*2014
A universality theorem for nested polytopes
MG Dobbins, A Holmsen, T Miltzow
arXiv preprint arXiv:1908.02213, 2019
122019
On classifying continuous constraint satisfaction problems
T Miltzow, RF Schmiermann
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
112022
Counting houses of Pareto optimal matchings in the house allocation problem
A Asinowski, B Keszegh, T Miltzow
Discrete Mathematics 339 (12), 2919-2932, 2016
102016
Quasi-parallel segments and characterization of unique bichromatic matchings
A Asinowski, T Miltzow, G Rote
arXiv preprint arXiv:1302.4400, 2013
102013
The system can't perform the operation now. Try again later.
Articles 1–20