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

Rational Points on the Unit Sphere: Approximation Complexity and Practical Constructions. - Daniel Bahrdt; Martin P. Seybold (ISSAC, 2017)

Robust Map Matching for Heterogeneous Data via Dominance Decompositions. - Martin P. Seybold (SDM, 2017)

Algorithm engineering in geometric network planning and data mining - Martin P. Seybold (2018)

A Simple Dynamization of Trapezoidal Point Location in Planar Subdivisions. - Milutin Brankovic; Nikola Grujic; André van Renssen; Martin P. Seybold (ICALP, 2020)

A Practical Index Structure Supporting Fréchet Proximity Queries among Trajectories. - Joachim Gudmundsson; Michael Horton 001; John Pfeifer; Martin P. Seybold (ACM Trans. Spatial Algorithms Syst., 2021)

Optimal Window Queries on Line Segments Using the Trapezoidal Search DAG. - Milutin Brankovic; Martin P. Seybold (COCOON, 2022)

Exploring Sub-skeleton Trajectories for Interpretable Recognition of Sign Language. - Joachim Gudmundsson; Martin P. Seybold; John Pfeifer (DASFAA (1), 2022)

A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures. - Joachim Gudmundsson; Martin P. Seybold (SODA, 2022)

On the Complexity of Algorithms with Predictions for Dynamic Graph Problems. - Monika Henzinger; Andrea Lincoln; Barna Saha; Martin P. Seybold; Christopher Ye 001 (CoRR, 2023)

On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance. - Joachim Gudmundsson; John Pfeifer; Martin P. Seybold (ACM Trans. Spatial Algorithms Syst., 2023)

Covering Rectilinear Polygons with Area-Weighted Rectangles. - Kathrin Hanauer; Martin P. Seybold; Julian Unterweger (ALENEX, 2024)

Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size. - Joachim Gudmundsson; Martin P. Seybold; Sampson Wong (SoCG, 2024)

On the Complexity of Algorithms with Predictions for Dynamic Graph Problems. - Monika Henzinger; Barna Saha; Martin P. Seybold; Christopher Ye 001 (ITCS, 2024)

Online List Labeling with Near-Logarithmic Writes. - Martin P. Seybold (CoRR, 2024)

Map Matching Queries on Realistic Input Graphs Under the Fréchet Distance. - Joachim Gudmundsson; Martin P. Seybold; Sampson Wong (ACM Trans. Algorithms, 2024)

B-Treaps Revised: Write Efficient Randomized Block Search Trees with High Load. - Roodabeh Safavi; Martin P. Seybold (WADS, 2025)

Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time. - Gramoz Goranci; Peter Kiss; Neel Patel; Martin P. Seybold; Eva Szilagyi; Da Wei Zheng (CoRR, 2025)