| The Art Gallery Problem is -complete M Abrahamsen, A Adamaszek, T Miltzow arXiv preprint arXiv:1704.06969, 2017 | 167* | 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 | 82 | 2016 |
| Smoothing the gap between NP and ER J Erickson, I Hoog, T Miltzow arXiv. org, 2019 | 80 | 2019 |
| Complexity of token swapping and its variants É Bonnet, T Miltzow, P Rzążewski Algorithmica 80 (9), 2656-2682, 2018 | 78 | 2018 |
| Intersection graphs of rays and grounded segments J Cardinal, S Felsner, T Miltzow, C Tompkins, B Vogtenhuber Journal of Graph Algorithms and Applications 22 (2), 273-295, 2018 | 65 | 2018 |
| Framework for exists r-completeness of two-dimensional packing problems M Abrahamsen, T Miltzow, N Seiferth TheoretiCS 3, 11, 2024 | 56 | 2024 |
| Training neural networks is ER-complete M Abrahamsen, L Kleist, T Miltzow Advances in Neural Information Processing Systems 34, 18293-18306, 2021 | 55 | 2021 |
| An approximation algorithm for the art gallery problem É Bonnet, T Miltzow arXiv preprint arXiv:1607.05527, 2016 | 50 | 2016 |
| Completeness for the Complexity Class and Area-Universality MG Dobbins, L Kleist, T Miltzow, P Rzążewski Discrete & Computational Geometry, 1-35, 2022 | 47* | 2022 |
| Training Fully Connected Neural Networks is -Complete D Bertschinger, C Hertrich, P Jungeblut, T Miltzow, S Weber arXiv preprint arXiv:2204.01368, 2022 | 47 | 2022 |
| The Parameterized Hardness of Art Gallery Problems É Bonnet, T Miltzow arXiv preprint arXiv:1603.08116, 2016 | 43* | 2016 |
| The complexity of drawing a graph in a polygonal region A Lubiw, T Miltzow, D Mondal Journal of Graph Algorithms and Applications 26 (4), 421-446, 2022 | 42* | 2022 |
| Between shapes, using the Hausdorff distance M van Kreveld, T Miltzow, T Ophelders, W Sonke, JL Vermeulen Computational geometry 100, 101817, 2022 | 42 | 2022 |
| Irrational guards are sometimes needed M Abrahamsen, A Adamaszek, T Miltzow arXiv preprint arXiv:1701.05475, 2017 | 38 | 2017 |
| The complexity of the Hausdorff distance P Jungeblut, L Kleist, T Miltzow Discrete & Computational Geometry 71 (1), 177-213, 2024 | 36 | 2024 |
| On classifying continuous constraint satisfaction problems T Miltzow, RF Schmiermann TheoretiCS 3, 2024 | 31 | 2024 |
| The existential theory of the reals as a complexity class: A compendium M Schaefer, J Cardinal, T Miltzow arXiv preprint arXiv:2407.18006, 2024 | 27 | 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 | 24 | 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 | 22 | 2023 |
| Geometric Embeddability of Complexes is∃ ℝ-complete M Abrahamsen, L Kleist, T Miltzow Journal of the ACM 72 (1), 1-26, 2025 | 21 | 2025 |
Mikkel AbrahamsenAssociate Professor of Computer Science, University of CopenhagenVerified email at di.ku.dk
