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
arXiv preprint arXiv:1704.06969, 2017
118*2017
Approximation and hardness for token swapping
T Miltzow, L Narins, Y Okamoto, G Rote, A Thomas, T Uno
arXiv preprint arXiv:1602.05150, 2016
612016
Intersection graphs of rays and grounded segments
J Cardinal, S Felsner, T Miltzow, C Tompkins, B Vogtenhuber
Graph-Theoretic Concepts in Computer Science: 43rd International Workshop†…, 2017
572017
Complexity of token swapping and its variants
… Bonnet, T Miltzow, P Rzążewski
Algorithmica 80, 2656-2682, 2018
552018
A framework for robust realistic geometric computations
J Erickson, I Hoog, T Miltzow
arXiv. org, 2019
52*2019
An approximation algorithm for the art gallery problem
… Bonnet, T Miltzow
arXiv preprint arXiv:1607.05527, 2016
422016
Completeness for the Complexity Class and Area-Universality
MG Dobbins, L Kleist, T Miltzow, P Rzążewski
Discrete & Computational Geometry, 1-35, 2022
41*2022
The Parameterized Hardness of Art Gallery Problems
… Bonnet, T Miltzow
arXiv preprint arXiv:1603.08116, 2016
40*2016
Training neural networks is ER-complete
M Abrahamsen, L Kleist, T Miltzow
Advances in Neural Information Processing Systems 34, 18293-18306, 2021
392021
Framework for existsr-completeness of two-dimensional packing problems
M Abrahamsen, T Miltzow, N Seiferth
arXiv, 2020
39*2020
Irrational guards are sometimes needed
M Abrahamsen, A Adamaszek, T Miltzow
arXiv preprint arXiv:1701.05475, 2017
272017
Training Fully Connected Neural Networks is -Complete
D Bertschinger, C Hertrich, P Jungeblut, T Miltzow, S Weber
arXiv preprint arXiv:2204.01368, 2022
252022
The complexity of drawing a graph in a polygonal region
A Lubiw, T Miltzow, D Mondal
Graph Drawing and Network Visualization: 26th International Symposium, GD†…, 2018
252018
On classifying continuous constraint satisfaction problems
T Miltzow, RF Schmiermann
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS†…, 2022
242022
Peeling and nibbling the cactus: Subexponential-time algorithms for counting triangulations and related problems
D Marx, T Miltzow
arXiv preprint arXiv:1603.07340, 2016
212016
Fine-grained complexity of coloring unit disks and balls
B Csaba, … Bonnet, D Marx, M Tillmann, P Rzążewski
Journal of Computational Geometry, 2018
20*2018
The complexity of the Hausdorff distance
P Jungeblut, L Kleist, T Miltzow
Discrete & Computational Geometry 71 (1), 177-213, 2024
192024
A universality theorem for nested polytopes
MG Dobbins, A Holmsen, T Miltzow
arXiv preprint arXiv:1908.02213, 2019
162019
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
16*2014
Disjoint compatibility graph of non-crossing matchings of points in convex position
O Aichholzer, A Asinowski, T Miltzow
arXiv preprint arXiv:1403.5546, 2014
162014
The system can't perform the operation now. Try again later.
Articles 1–20