| Smoothing the gap between NP and ER J Erickson, I Van Der Hoog, T Miltzow SIAM Journal on Computing, FOCS20-102-FOCS20-138, 2022 | 50 | 2022 |
| Maximum-area triangle in a convex polygon, revisited V Keikha, M Löffler, A Mohades, J Urhausen, I van der Hoog arXiv preprint arXiv:1705.11035, 2017 | 17 | 2017 |
| Maximum-area triangle in a convex polygon, revisited I van der Hoog, V Keikha, M Löffler, A Mohades, J Urhausen Information Processing Letters 161, 105943, 2020 | 12 | 2020 |
| Efficient Fr\'echet distance queries for segments M Buchin, I van der Hoog, T Ophelders, L Schlipf, RI Silveira, F Staals arXiv preprint arXiv:2203.01794, 2022 | 10 | 2022 |
| Preprocessing ambiguous imprecise points I van der Hoog, I Kostitsyna, M Löffler, B Speckmann arXiv preprint arXiv:1903.08280, 2019 | 8 | 2019 |
| Adaptive out-orientations with applications ABG Christiansen, J Holm, I van der Hoog, E Rotenberg, ... arXiv preprint arXiv:2209.14087, 2022 | 5 | 2022 |
| On the Discrete Fr\'echet Distance in a Graph A Driemel, I van der Hoog, E Rotenberg arXiv preprint arXiv:2201.02121, 2022 | 5 | 2022 |
| Topological stability of kinetic k-centers I van der Hoog, M van Kreveld, W Meulemans, K Verbeek, J Wulms Theoretical Computer Science 866, 145-159, 2021 | 4 | 2021 |
| Improved space bounds for Fréchet distance queries M Buchin, I van der Hoog, T Ophelders, RI Silveira, L Schlipf, F Staals 36th European Workshop on Computational Geometry (EuroCG 2020), 2020 | 4 | 2020 |
| Smoothed analysis of order types I van der Hoog, T Miltzow, M van Schaik arXiv preprint arXiv:1907.04645, 2019 | 4 | 2019 |
| Mapping Multiple Regions to the Grid with Bounded Hausdorff Distance I van der Hoog, M van de Kerkhof, M van Kreveld, M Löffler, F Staals, ... Workshop on Algorithms and Data Structures, 627-640, 2021 | 3 | 2021 |
| Trajectory visibility P Eades, I van der Hoog, M Löffler, F Staals 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020), 2020 | 3 | 2020 |
| A framework for robust realistic geometric computations J Erickson, I Hoog, T Miltzow arXiv. org, 2019 | 3 | 2019 |
| Dynamic smooth compressed quadtrees I van der Hoog, E Khramtcova, M Löffler 34th International Symposium on Computational Geometry (SoCG 2018), 2018 | 3 | 2018 |
| Data Structures for Approximate Discrete Fr\'echet Distance I van der Hoog, E Rotenberg, S Wong arXiv preprint arXiv:2212.07124, 2022 | 2 | 2022 |
| Dynamic Dynamic Time Warping K Bringmann, N Fischer, I van der Hoog, E Kipouridis, T Kociumaka, ... Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 1 | 2024 |
| Segment visibility counting queries in polygons K Buchin, B Custers, I van der Hoog, M Löffler, A Popov, M Roeloffzen, ... arXiv preprint arXiv:2201.03490, 2022 | 1 | 2022 |
| Smoothed Analysis of Order Types I Hoog, T Miltzow, M Schaik arXiv. org, 2019 | 1 | 2019 |
| Maximum-Area Quadrilateral in a Convex Polygon, Revisited V Keikha, M Löffler, A Mohades, J Urhausen, I van der Hoog arXiv preprint arXiv:1708.00681, 2017 | 1 | 2017 |
| Tight Bounds for Sorting Under Partial Information I van der Hoog, D Rutschmann arXiv preprint arXiv:2404.08468, 2024 | | 2024 |
Maarten LöfflerComputer Science, Utrecht UniversityVerified email at cs.uu.nl
