| On k-path covers and their applications S Funke, A Nusser, S Storandt Proceedings of the VLDB Endowment 7 (10), 893-902, 2014 | 54 | 2014 |
| Placement of loading stations for electric vehicles: No detours necessary! S Funke, A Nusser, S Storandt Journal of Artificial Intelligence Research 53, 633-658, 2015 | 49 | 2015 |
| klcluster: Center-based clustering of trajectories K Buchin, A Driemel, N van de L'Isle, A Nusser Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances …, 2019 | 38 | 2019 |
| The VC dimension of metric balls under Fréchet and Hausdorff distances A Driemel, A Nusser, JM Phillips, I Psarros Discrete & Computational Geometry 66 (4), 1351-1381, 2021 | 31 | 2021 |
| Walking the Dog Fast in Practice: Algorithm Engineering of the Fr\'echet Distance K Bringmann, M Künnemann, A Nusser arXiv preprint arXiv:1901.01504, 2019 | 29 | 2019 |
| Tight bounds for approximate near neighbor searching for time series under the Fréchet distance K Bringmann, A Driemel, A Nusser, I Psarros Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 21 | 2022 |
| (k, l)-Medians Clustering of Trajectories Using Continuous Dynamic Time Warping M Brankovic, K Buchin, K Klaren, A Nusser, A Popov, S Wong Proceedings of the 28th International Conference on Advances in Geographic …, 2020 | 19 | 2020 |
| Phase transition of the 2-choices dynamics on core-periphery networks E Cruciani, E Natale, A Nusser, G Scornavacca arXiv preprint arXiv:1804.07223, 2018 | 19 | 2018 |
| On k-Path Covers and their applications S Funke, A Nusser, S Storandt The VLDB Journal 25, 103-123, 2016 | 19 | 2016 |
| Fréchet distance under translation: Conditional hardness and an algorithm via offline dynamic grid reachability K Bringmann, M Künnemann, A Nusser Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 17 | 2019 |
| Placement of loading stations for electric vehicles: Allowing small detours S Funke, A Nusser, S Storandt Proceedings of the international conference on automated planning and …, 2016 | 17 | 2016 |
| Translating Hausdorff is hard: fine-grained lower bounds for Hausdorff distance under translation K Bringmann, A Nusser arXiv preprint arXiv:2101.07696, 2021 | 11 | 2021 |
| Towards sub-quadratic diameter computation in geometric intersection graphs K Bringmann, S Kisfaludi-Bak, M Künnemann, A Nusser, Z Parsaeian arXiv preprint arXiv:2203.03663, 2022 | 9 | 2022 |
| Discrete Fréchet distance under translation: Conditional hardness and an improved algorithm K Bringmann, M Künnemann, A Nusser ACM Transactions on Algorithms (TALG) 17 (3), 1-42, 2021 | 9 | 2021 |
| Growing Balls in ℝd D Bahrdt, M Becher, S Funke, F Krumpe, A Nusser, M Seybold, S Storandt 2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and …, 2017 | 9 | 2017 |
| PATHFINDER: storage and indexing of massive trajectory sets S Funke, T Rupp, A Nusser, S Storandt Proceedings of the 16th International Symposium on Spatial and Temporal …, 2019 | 8 | 2019 |
| Phase transition of the 2-Choices dynamics on core–periphery networks E Cruciani, E Natale, A Nusser, G Scornavacca Distributed Computing 34 (3), 207-225, 2021 | 7 | 2021 |
| The Simultaneous Maze Solving Problem. S Funke, A Nusser, S Storandt AAAI, 808-814, 2017 | 7 | 2017 |
| Constructing concise convex covers via clique covers (cg challenge) M Abrahamsen, W Bille Meyling, A Nusser 39th International Symposium on Computational Geometry (SoCG 2023), 2023 | 5 | 2023 |
| Enumeration of far-apart pairs by decreasing distance for faster hyperbolicity computation D Coudert, A Nusser, L Viennot ACM Journal of Experimental Algorithmics 27, 1-29, 2022 | 5 | 2022 |
Karl BringmannProfessor in Computer Science, Saarland UniversityBestätigte E-Mail-Adresse bei cs.uni-saarland.de
