On k-Path Covers and their Applications. - Stefan Funke; André Nusser; Sabine Storandt (Proc. VLDB Endow., 2014)

Placement of Loading Stations for Electric Vehicles: No Detours Necessary! - Stefan Funke; André Nusser; Sabine Storandt (J. Artif. Intell. Res., 2015)

Placement of Loading Stations for Electric Vehicles: Allowing Small Detours. - Stefan Funke; André Nusser; Sabine Storandt (ICAPS, 2016)

The Simultaneous Maze Solving Problem. - Stefan Funke; André Nusser; Sabine Storandt (AAAI, 2017)

Growing Balls in ℝd. - Daniel Bahrdt; Michael Becher; Stefan Funke; Filip Krumpe; André Nusser; Martin Seybold; Sabine Storandt (ALENEX, 2017)

On the Emergent Behavior of the 2-Choices Dynamics. - Emilio Cruciani; Emanuele Natale; André Nusser; Giacomo Scornavacca (ICTCS, 2018)

klcluster: Center-based Clustering of Trajectories. - Kevin Buchin; Anne Driemel; Natasja van de L'Isle; André Nusser (SIGSPATIAL/GIS, 2019)

Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability. - Karl Bringmann; Marvin Künnemann; André Nusser (SODA, 2019)

PATHFINDER: Storage and Indexing of Massive Trajectory Sets. - Stefan Funke; Tobias Rupp; André Nusser; Sabine Storandt (SSTD, 2019)

When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance Under Translation. - Karl Bringmann; Marvin Künnemann; André Nusser (ESA, 2020)

(k, l)-Medians Clustering of Trajectories Using Continuous Dynamic Time Warping. - Milutin Brankovic; Kevin Buchin; Koen Klaren; André Nusser; Aleksandr Popov 001; Sampson Wong (SIGSPATIAL/GIS, 2020)

Hyperbolicity Computation through Dominating Sets. - David Coudert; André Nusser; Laurent Viennot (CoRR, 2021)

Phase transition of the 2-Choices dynamics on core-periphery networks. - Emilio Cruciani; Emanuele Natale; André Nusser; Giacomo Scornavacca (Distributed Comput., 2021)

The VC Dimension of Metric Balls under Fréchet and Hausdorff Distances. - Anne Driemel; André Nusser; Jeff M. Phillips; Ioannis Psarros (Discret. Comput. Geom., 2021)

Walking the dog fast in practice: Algorithm engineering of the Fréchet distance. - Karl Bringmann; Marvin Künnemann; André Nusser (J. Comput. Geom., 2021)

Translating Hausdorff is hard: fine-grained lower bounds for Hausdorff distance under translation. - Karl Bringmann; André Nusser (J. Comput. Geom., 2021)

Discrete Fréchet Distance under Translation: Conditional Hardness and an Improved Algorithm. - Karl Bringmann; Marvin Künnemann; André Nusser (ACM Trans. Algorithms, 2021)

Fine-grained complexity and algorithm engineering of geometric similarity measures. - André Nusser (2021)

Computing Graph Hyperbolicity Using Dominating Sets. - David Coudert; André Nusser; Laurent Viennot (ALENEX, 2022)

Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs. - Karl Bringmann; Sándor Kisfaludi-Bak; Marvin Künnemann; André Nusser; Zahra Parsaeian (SoCG, 2022)

Computing Continuous Dynamic Time Warping of Time Series in Polynomial Time. - Kevin Buchin; André Nusser; Sampson Wong (SoCG, 2022)

Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Fréchet Distance. - Karl Bringmann; Anne Driemel; André Nusser; Ioannis Psarros (SODA, 2022)

Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Improvement via Offline Dynamic Rectangle Union. - Marvin Künnemann; André Nusser (SODA, 2022)

Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation. - David Coudert; André Nusser; Laurent Viennot (ACM J. Exp. Algorithmics, 2022)

Dynamic time warping under translation: Approximation guided by space-filling curves. - Karl Bringmann; Sándor Kisfaludi-Bak; Marvin Künnemann; Dániel Marx; André Nusser (J. Comput. Geom., 2022)

Constructing Concise Convex Covers via Clique Covers (CG Challenge). - Mikkel Abrahamsen; William Bille Meyling; André Nusser (SoCG, 2023)

Clustering with Few Disks to Minimize the Sum of Radii. - Mikkel Abrahamsen; Sarita de Berg; Lucas Meijer; André Nusser; Leonidas Theocharous (SoCG, 2024)

Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs. - Ivor van der Hoog; André Nusser; Eva Rotenberg; Frank Staals (MFCS, 2024)

Minimum Star Partitions of Simple Polygons in Polynomial Time. - Mikkel Abrahamsen; Joakim Blikstad; André Nusser; Hanwen Zhang 003 (STOC, 2024)

Computing Non-Obtuse Triangulations with Few Steiner Points (CG Challenge). - Mikkel Abrahamsen; Florestan Brunck; Jacobus Conradi; Benedikt Kolbe; André Nusser (SoCG, 2025)

Transforming Dogs on the Line: On the Fréchet Distance Under Translation or Scaling in 1D. - Lotte Blank; Jacobus Conradi; Anne Driemel; Benedikt Kolbe; André Nusser; Marena Richter (SoCG, 2025)

Approximating Klee's Measure Problem and a Lower Bound for Union Volume Estimation. - Karl Bringmann; Kasper Green Larsen; André Nusser; Eva Rotenberg; Yanheng Wang (SoCG, 2025)

Faster Fréchet Distance Under Transformations. - Kevin Buchin; Maike Buchin; Zijin Huang; André Nusser; Sampson Wong (ICALP, 2025)

Cutting Through Privacy: A Hyperplane-Based Data Reconstruction Attack in Federated Learning. - Francesco Diana; André Nusser; Chuan Xu 002; Giovanni Neglia (UAI, 2025)

Algorithm Engineering of SSSP with Negative Edge Weights. - Alejandro Cassis; Andreas Karrenbauer; André Nusser; Paolo Luigi Rinaldi (SEA, 2025)

Computing Non-Obtuse Triangulations with Few Steiner Points. - Mikkel Abrahamsen; Florestan Brunck; Jacobus Conradi; Benedikt Kolbe; André Nusser (CoRR, 2025)

Improved Learning via k-DTW: A Novel Dissimilarity Measure for Curves. - Amer Krivosija; Alexander Munteanu; André Nusser; Chris Schwiegelshohn (CoRR, 2025)

nonObtuseTri. - Mikkel Abrahamsen; Florestan Brunck; Jacobus Conradi; Benedikt Kolbe; André Nusser (DROPS Artifacts, 2025)