关注
Tillmann Miltzow
Tillmann Miltzow
Utrecht University
在 uu.nl 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
The Art Gallery Problem is -complete
M Abrahamsen, A Adamaszek, T Miltzow
arXiv preprint arXiv:1704.06969, 2017
123*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
652016
Complexity of token swapping and its variants
É Bonnet, T Miltzow, P Rzążewski
Algorithmica 80, 2656-2682, 2018
622018
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
592017
A framework for robust realistic geometric computations
J Erickson, I Hoog, T Miltzow
arXiv. org, 2019
58*2019
Completeness for the Complexity Class and Area-Universality
MG Dobbins, L Kleist, T Miltzow, P Rzążewski
Discrete & Computational Geometry, 1-35, 2022
42*2022
An approximation algorithm for the art gallery problem
É Bonnet, T Miltzow
arXiv preprint arXiv:1607.05527, 2016
422016
Training neural networks is ER-complete
M Abrahamsen, L Kleist, T Miltzow
Advances in Neural Information Processing Systems 34, 18293-18306, 2021
412021
Framework for existsr-completeness of two-dimensional packing problems
M Abrahamsen, T Miltzow, N Seiferth
arXiv, 2020
41*2020
The Parameterized Hardness of Art Gallery Problems
É Bonnet, T Miltzow
arXiv preprint arXiv:1603.08116, 2016
41*2016
Irrational guards are sometimes needed
M Abrahamsen, A Adamaszek, T Miltzow
arXiv preprint arXiv:1701.05475, 2017
282017
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
272018
On classifying continuous constraint satisfaction problems
T Miltzow, RF Schmiermann
TheoretiCS 3, 2024
252024
Training Fully Connected Neural Networks is -Complete
D Bertschinger, C Hertrich, P Jungeblut, T Miltzow, S Weber
arXiv preprint arXiv:2204.01368, 2022
252022
Fine-grained complexity of coloring unit disks and balls
B Csaba, É Bonnet, D Marx, M Tillmann, P Rzążewski
Journal of Computational Geometry, 2018
24*2018
The complexity of the Hausdorff distance
P Jungeblut, L Kleist, T Miltzow
Discrete & Computational Geometry 71 (1), 177-213, 2024
222024
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
Token swapping on trees
A Biniaz, K Jain, A Lubiw, Z Masárová, T Miltzow, D Mondal, AM Naredla, ...
Discrete Mathematics & Theoretical Computer Science 24 (Discrete Algorithms), 2023
172023
Between shapes, using the Hausdorff distance
M van Kreveld, T Miltzow, T Ophelders, W Sonke, JL Vermeulen
Computational Geometry 100, 101817, 2022
162022
A universality theorem for nested polytopes
MG Dobbins, A Holmsen, T Miltzow
arXiv preprint arXiv:1908.02213, 2019
162019
系统目前无法执行此操作，请稍后再试。
文章 1–20