| 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 |
| Computing the Fréchet distance between uncertain curves in one dimension K Buchin, M Löffler, T Ophelders, A Popov, J Urhausen, K Verbeek Computational Geometry 109, 101923, 2023 | 8 | 2023 |
| Diverse partitions of colored points M van Kreveld, B Speckmann, J Urhausen Algorithms and Data Structures: 17th International Symposium, WADS 2021 …, 2021 | 6 | 2021 |
| The k-Fréchet distance: How to walk your dog while teleporting H Alves Akitaya, M Buchin, L Ryvkin, J Urhausen 30th International Symposium on Algorithms and Computation (ISAAC 2019), 2019 | 6 | 2019 |
| Obstructing classification via projection P Haghighatkhah, W Meulemans, B Speckman, J Urhausen, K Verbeek arXiv preprint arXiv:2105.09047, 2021 | 4 | 2021 |
| The k-Fréchet distance revisited and extended HA Akitaya, M Buchin, L Ryvkin, J Urhausen 35th European Workshop on Computational Geometry, 2019 | 4 | 2019 |
| Convex partial transversals of planar regions V Keikha, M van de Kerkhof, M van Kreveld, I Kostitsyna, M Löffler, ... arXiv preprint arXiv:1809.10078, 2018 | 4 | 2018 |
| 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 |
| Chasing puppies: Mobile beacon routing on closed curves M Abrahamsen, J Erickson, I Kostitsyna, M Löffler, T Miltzow, J Urhausen, ... arXiv preprint arXiv:2103.09811, 2021 | 3 | 2021 |
| -Stars or On Extending a Drawing of a Connected Subgraph T Mchedlidze, J Urhausen International Symposium on Graph Drawing and Network Visualization, 416-429, 2018 | 3 | 2018 |
| Computing the cut distance of two curves M Buchin, L Ryvkin, J Urhausen 36th European Workshop on Computational Geometry (EuroCG), 2020 | 2 | 2020 |
| The -Fr\'echet distance HA Akitaya, M Buchin, L Ryvkin, J Urhausen arXiv preprint arXiv:1903.02353, 2019 | 2 | 2019 |
| Complexity of Critter Crunch T Feng, L Ryvkin, J Urhausen, G Viglietta IEICE TRANSACTIONS on Information and Systems 105 (3), 517-531, 2022 | 1 | 2022 |
| 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 |
| New Results on Trajectory Grouping under Geodesic Distance M Löffler, F Staals, J Urhausen 32nd European Workshop on Computational Geometry, 2016 | 1 | 2016 |
| New results on trajectory grouping under geodesic distance J Urhausen Informatics Institute, 2015 | 1 | 2015 |
| Mapping Points to the Grid with Bounded Hausdorff Distance M Löffler, J Urhausen EasyChair, 2024 | | 2024 |
| On Geometric Measures and Their Computation JE Urhausen Utrecht University, 2023 | | 2023 |
| Spiroplots: a New Discrete-time Dynamical System to Generate Curve Patterns C van Dommelen, M van Kreveld, J Urhausen Bridges 2020 Conference Proceedings, 353-360, 2020 | | 2020 |
