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
352018
Approximation and hardness for token swapping
T Miltzow, L Narins, Y Okamoto, G Rote, A Thomas, T Uno
arXiv preprint arXiv:1602.05150, 2016
302016
Complexity of token swapping and its variants
É Bonnet, T Miltzow, P Rzążewski
Algorithmica 80 (9), 2656-2682, 2018
292018
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
232017
Parameterized hardness of art gallery problems
É Bonnet, T Miltzow
ACM Transactions on Algorithms (TALG) 16 (4), 1-23, 2020
222020
An approximation algorithm for the art gallery problem
É Bonnet, T Miltzow
arXiv preprint arXiv:1607.05527, 2016
192016
Disjoint compatibility graph of non-crossing matchings of points in convex position
O Aichholzer, A Asinowski, T Miltzow
arXiv preprint arXiv:1403.5546, 2014
132014
Extreme point and halving edge search in abstract order types
O Aichholzer, T Miltzow, A Pilz
Computational geometry 46 (8), 970-978, 2013
13*2013
Peeling and nibbling the cactus: Subexponential-time algorithms for counting triangulations and related problems
D Marx, T Miltzow
arXiv preprint arXiv:1603.07340, 2016
122016
Irrational guards are sometimes needed
M Abrahamsen, A Adamaszek, T Miltzow
arXiv preprint arXiv:1701.05475, 2017
112017
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
102018
Quasi-parallel segments and characterization of unique bichromatic matchings
A Asinowski, T Miltzow, G Rote
arXiv preprint arXiv:1302.4400, 2013
102013
Fine-grained complexity of coloring unit disks and balls
C Biró, É Bonnet, D Marx, T Miltzow, P Rzazewski
Journal of Computational Geometry 9 (2), 47-87, 2018
92018
Counting houses of Pareto optimal matchings in the house allocation problem
A Asinowski, B Keszegh, T Miltzow
Discrete Mathematics 339 (12), 2919-2932, 2016
9*2016
-Completeness and Area-Universality
MG Dobbins, L Kleist, T Miltzow, P Rzążewski
International Workshop on Graph-Theoretic Concepts in Computer Science, 164-175, 2018
72018
Tron, a Combinatorial Game on Abstract Graphs
T Miltzow
International Conference on Fun with Algorithms, 293-304, 2012
72012
Smoothed analysis of the art gallery problem
MG Dobbins, A Holmsen, T Miltzow
arXiv preprint arXiv:1811.01177, 2018
42018
Obedient plane drawings for disk intersection graphs
B Banyassady, M Hoffmann, B Klemz, M Löffler, T Miltzow
Workshop on Algorithms and Data Structures, 73-84, 2017
32017
Upper and lower bounds on long dual paths in line arrangements
U Hoffmann, L Kleist, T Miltzow
International Symposium on Mathematical Foundations of Computer Science, 407-419, 2015
32015
A universality theorem for nested polytopes
MG Dobbins, A Holmsen, T Miltzow
arXiv preprint arXiv:1908.02213, 2019
22019
The system can't perform the operation now. Try again later.
Articles 1–20