Tillmann Miltzow

Cited by

	All	Since 2019
Citations	1002	840
h-index	17	17
i10-index	28	24

240

120

180

2013201420152016201720182019202020212022202320244 10 17 14 39 65 87 87 102 155 180 222

Public access

View all

28 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Mikkel AbrahamsenAssociate Professor of Computer Science, University of CopenhagenVerified email at di.ku.dk
Édouard BonnetENS Lyon, LIP, FranceVerified email at ens-lyon.fr
Linda KleistTU BraunschweigVerified email at ibr.cs.tu-bs.de
Paweł RzążewskiWarsaw University of Technology, Faculty of Mathematics and Information ScienceVerified email at mini.pw.edu.pl
Anna AdamaszekPostdoc, University of CopenhagenVerified email at di.ku.dk
Ivor van der HoogTechnical University of DenmarkVerified email at dtu.dk
Dániel MarxCISPA Helmholtz Center for Information SecurityVerified email at cispa.saarland
Jeff EricksonProfessor of Computer Science, University of Illinois Urbana-ChampaignVerified email at illinois.edu
Andrei AsinowskiUniversity of Klagenfurt, AustriaVerified email at aau.at
Anna LubiwProfessor, David R. Cheriton School of Computer Science, University of WaterlooVerified email at uwaterloo.ca
Debajyoti MondalAssociate Professor of Computer Science, University of Saskatchewan, CanadaVerified email at cs.usask.ca
Simon WeberPhD student at ETH ZurichVerified email at inf.ethz.ch
Michael HoffmannETH ZürichVerified email at inf.ethz.ch
Yoshio OkamotoUniversity of Electro-CommunicationsVerified email at uec.ac.jp
Takeaki UnoNational Institute of Informatics, JapanVerified email at nii.jp
Antonis ThomasPhD Student, ETH ZürichVerified email at inf.ethz.ch
Stefan FelsnerProfessor für Diskrete Mathematik, TU BerlinVerified email at math.tu-berlin.de
Daniel BertschingerPhD candidate at ETH ZürichVerified email at inf.ethz.ch
Paul JungeblutKarlsruhe Institute of TechnologyVerified email at kit.edu
Oswin AichholzerProf. Informatik, TU Graz, Graz, AustriaVerified email at ist.tugraz.at

Tillmann Miltzow

Utrecht University

Verified email at uu.nl - Homepage

Computational geometry


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
The Art Gallery Problem is -complete M Abrahamsen, A Adamaszek, T Miltzow arXiv preprint arXiv:1704.06969, 2017	125*	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	65	2016
Complexity of token swapping and its variants É Bonnet, T Miltzow, P Rzążewski Algorithmica 80, 2656-2682, 2018	62	2018
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	59	2017
A framework for robust realistic geometric computations J Erickson, I Hoog, T Miltzow arXiv. org, 2019	58*	2019
Framework for existsr-completeness of two-dimensional packing problems M Abrahamsen, T Miltzow, N Seiferth arXiv, 2020	43*	2020
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	42	2016
The Parameterized Hardness of Art Gallery Problems É Bonnet, T Miltzow arXiv preprint arXiv:1603.08116, 2016	42*	2016
Training neural networks is ER-complete M Abrahamsen, L Kleist, T Miltzow Advances in Neural Information Processing Systems 34, 18293-18306, 2021	41	2021
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	28	2018
Irrational guards are sometimes needed M Abrahamsen, A Adamaszek, T Miltzow arXiv preprint arXiv:1701.05475, 2017	28	2017
Training Fully Connected Neural Networks is -Complete D Bertschinger, C Hertrich, P Jungeblut, T Miltzow, S Weber arXiv preprint arXiv:2204.01368, 2022	26	2022
On classifying continuous constraint satisfaction problems T Miltzow, RF Schmiermann TheoretiCS 3, 2024	25	2024
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	22	2024
Peeling and nibbling the cactus: Subexponential-time algorithms for counting triangulations and related problems D Marx, T Miltzow arXiv preprint arXiv:1603.07340, 2016	21	2016
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	17	2023
Between shapes, using the Hausdorff distance M van Kreveld, T Miltzow, T Ophelders, W Sonke, JL Vermeulen Computational Geometry 100, 101817, 2022	16	2022
A universality theorem for nested polytopes MG Dobbins, A Holmsen, T Miltzow arXiv preprint arXiv:1908.02213, 2019	16	2019

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors