There should be a link to a publicly available version for each of my publications. If you find one for which it is not the case, tell me and I will fix it immediately.
Also see my DBLP page for more info.
Clustering with Few Disks to Minimize the Sum of Radii (arXiv)
Abrahamsen, de Berg, Meijer, Nusser, Theocharous
International Symposium on Computational Geometry (SoCG), 2024
Minimum Star Partitions of Simple Polygons in Polynomial Time (arXiv)
Abrahamsen, Blikstad, Nusser, Zhang
ACM Symposium on Theory of Computing (STOC), 2024
Constructing Concise Convex Covers via Clique Covers (CG Challenge) (pdf)
Abrahamsen, Bille Meyling, Nusser
International Symposium on Computational Geometry (SoCG), 2023
Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves (pdf)
Bringmann, Kisfaludi-Bak, Künnemann, Marx, Nusser International Symposium on Computational Geometry (SoCG), 2022
Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs (pdf)
Bringmann, Kisfaludi-Bak, Künnemann, Nusser, Parsaeian
International Symposium on Computational Geometry (SoCG), 2022
Computing Continuous Dynamic Time Warping of Time Series in Polynomial Time (pdf)
Buchin, Nusser, Wong
International Symposium on Computational Geometry (SoCG), 2022
Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Fréchet Distance (pdf, arXiv)
Bringmann, Driemel, Nusser, Psarros
ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022
Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Algorithm via Offline Dynamic Rectangle Union (pdf, arXiv)
Künnemann, Nusser
ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022
Computing Graph Hyperbolicity Using Dominating Sets (pdf)
Coudert, Nusser, Viennot
Meeting on Algorithm Engineering & Experiments (ALENEX), 2022
Translating Hausdorff is hard: fine-grained lower bounds for Hausdorff distance under translation (pdf)
Bringmann, Nusser
Journal of Computational Geometry (JoCG), 2022
Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation (pdf)
Coudert, Nusser, Viennot
ACM Journal of Experimental Algorithmics (JEA), 2022
Walking the dog fast in practice: Algorithm engineering of the Fréchet distance (pdf, arXiv)
Bringmann, Künnemann, Nusser
Journal of Computational Geometry (JoCG), 2021
Discrete Fréchet Distance under Translation: Conditional Hardness and an Improved Algorithm (pdf, arXiv)
Bringmann, Künnemann, Nusser
ACM Transactions on Algorithms (TALG), 2021
The VC Dimension of Metric Balls under Fréchet and Hausdorff Distances (pdf, arXiv)
Driemel, Nusser, Phillips, Psarros
Discrete & Computational Geometry (DCG), 2021
Phase Transition of the 2-Choices Dynamics on Core-Periphery Networks (pdf, arXiv)
Cruciani, Natale, Nusser, Scornavacca
Distributed Computing Journal, 2021
Translating Hausdorff is Hard: Fine-Grained Lower Bounds for Hausdorff Distance Under Translation (pdf, arXiv, slides)
Bringmann, Nusser
International Symposium on Computational Geometry (SoCG), 2021
(invited to special issue)
(k, l)-Medians Clustering of Trajectories Using Continuous Dynamic Time Warping (pdf, video, acm)
Brankovic, Buchin, Klaren, Nusser, Popov, Wong
International Conference on Advances in Geographic Information Systems (SIGSPATIAL), 2020
When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation (pdf, arXiv, video, slides)
Bringmann, Künnemann, Nusser
European Symposium on Algorithms (ESA), 2020
klcluster: Center-based Clustering of Trajectories (short paper; pdf, poster, acm)
Buchin, Driemel, van de L'Isle, Nusser
International Conference on Advances in Geographic Information Systems (SIGSPATIAL), 2019
(best poster runner-up)
PATHFINDER: Storage and Indexing of Massive Trajectory Sets (pdf, acm)
Funke, Nusser, Rupp, Storandt
International Symposium on Spatial and Temporal Databases (SSTD), 2019
Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance (arXiv, LIPIcs, poster)
Bringmann, Künnemann, Nusser
International Symposium on Computational Geometry (SoCG), 2019
Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability (pdf, arXiv)
Bringmann, Künnemann, Nusser
ACM-SIAM Symposium on Discrete Algorithms (SODA), 2019
On the Emergent Behavior of the 2-Choices Dynamics (Communication; pdf)
Cruciani, Natale, Nusser, Scornavacca
Italian Conference on Theoretical Computer Science (ICTCS), 2018
Phase Transition of the 2-Choices Dynamics on Core-Periphery Networks (pdf, arXiv, poster)
Cruciani, Natale, Nusser, Scornavacca
International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2018
The Simultaneous Maze Solving Problem (pdf)
Funke, Nusser, Storandt
AAAI Conference on Artificial Intelligence (AAAI), 2017
Growing Balls in R^d (pdf)
Bahrdt, Becher, Funke, Krumpe, Nusser, Seybold, Storandt
Meeting on Algorithm Engineering & Experiments (ALENEX), 2017
Placement of Loading Stations for Electric Vehicles: Allowing Small Detours (pdf)
Funke, Nusser, Storandt
International Conference on Automated Planning and Scheduling (ICAPS), 2016
On k-Path Covers and their Applications (pdf, springer)
Funke, Nusser, Storandt
VLDB Journal (VLDBJ), 2015, Special Issue ''Best Papers of VLDB Conference''
(invited)
Placement of Loading Stations for Electric Vehicles: No Detours Necessary! (pdf)
Funke, Nusser, Storandt
Journal of Artificial Intelligence Research (JAIR), 2015
(invited)
On k-Path Covers and their Applications (pdf)
Funke, Nusser, Storandt
Proceedings of the VLDB Endowment (VLDB), 2014
(best paper award)
Placement of Loading Stations for Electric Vehicles: No Detours Necessary! (pdf, poster)
Funke, Nusser, Storandt
AAAI Conference on Artificial Intelligence (AAAI), 2014
(honorable mention)