Follow
André Nusser
André Nusser
Verified email at mpi-inf.mpg.de - Homepage
Title
Cited by
Cited by
Year
On k-path covers and their applications
S Funke, A Nusser, S Storandt
Proceedings of the VLDB Endowment 7 (10), 893-902, 2014
482014
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
392015
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
242019
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
222019
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
212021
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
162019
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
152018
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
122016
On k-path covers and their applications
S Funke, A Nusser, S Storandt
The VLDB Journal 25 (1), 103-123, 2016
92016
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
82017
(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
62020
The Simultaneous Maze Solving Problem.
S Funke, A Nusser, S Storandt
AAAI, 808-814, 2017
62017
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
52019
The simultaneous maze solving problem In 31st AAAI Conference on Artificial Intelligence
S Funke, A Nusser, S Storandt
AAAI, 2017
52017
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
42021
Translating Hausdorff is hard: fine-grained lower bounds for Hausdorff distance under translation
K Bringmann, A Nusser
arXiv preprint arXiv:2101.07696, 2021
42021
Enumeration of far-apart pairs by decreasing distance for faster hyperbolicity computation
D Coudert, A Nusser, L Viennot
arXiv preprint arXiv:2104.12523, 2021
32021
When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fr\'echet Distance under Translation
K Bringmann, M Künnemann, A Nusser
arXiv preprint arXiv:2008.07510, 2020
32020
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
22022
The simultaneous maze solving problems
A Nusser
22016
The system can't perform the operation now. Try again later.
Articles 1–20