Следене
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
143*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
742016
Smoothing the gap between NP and ER
J Erickson, I Hoog, T Miltzow
arXiv. org, 2019
712019
Complexity of token swapping and its variants
É Bonnet, T Miltzow, P Rzążewski
Algorithmica 80, 2656-2682, 2018
682018
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
642017
Framework for existsr-completeness of two-dimensional packing problems
M Abrahamsen, T Miltzow, N Seiferth
arXiv, 2020
52*2020
Training neural networks is ER-complete
M Abrahamsen, L Kleist, T Miltzow
Advances in Neural Information Processing Systems 34, 18293-18306, 2021
492021
Completeness for the Complexity Class and Area-Universality
MG Dobbins, L Kleist, T Miltzow, P Rzążewski
Discrete & Computational Geometry, 1-35, 2022
45*2022
An approximation algorithm for the art gallery problem
É Bonnet, T Miltzow
arXiv preprint arXiv:1607.05527, 2016
442016
The Parameterized Hardness of Art Gallery Problems
É Bonnet, T Miltzow
arXiv preprint arXiv:1603.08116, 2016
42*2016
Training Fully Connected Neural Networks is -Complete
D Bertschinger, C Hertrich, P Jungeblut, T Miltzow, S Weber
arXiv preprint arXiv:2204.01368, 2022
342022
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
332018
On classifying continuous constraint satisfaction problems
T Miltzow, RF Schmiermann
TheoretiCS 3, 2024
312024
Irrational guards are sometimes needed
M Abrahamsen, A Adamaszek, T Miltzow
arXiv preprint arXiv:1701.05475, 2017
312017
The complexity of the Hausdorff distance
P Jungeblut, L Kleist, T Miltzow
Discrete & Computational Geometry 71 (1), 177-213, 2024
272024
Between shapes, using the Hausdorff distance
M van Kreveld, T Miltzow, T Ophelders, W Sonke, JL Vermeulen
Computational geometry 100, 101817, 2022
252022
Peeling and nibbling the cactus: Subexponential-time algorithms for counting triangulations and related problems
D Marx, T Miltzow
arXiv preprint arXiv:1603.07340, 2016
222016
Geometric Embeddability of Complexes is∃ ℝ-complete
M Abrahamsen, L Kleist, T Miltzow
Journal of the ACM 72 (1), 1-26, 2025
19*2025
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
192023
A universality theorem for nested polytopes
MG Dobbins, A Holmsen, T Miltzow
arXiv preprint arXiv:1908.02213, 2019
182019
Системата не може да изпълни операцията сега. Опитайте отново по-късно.
Статии 1–20