Martin Seybold

Orcid: 0000-0001-6901-3035

According to our database1, Martin Seybold authored at least 16 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the Complexity of Algorithms with Predictions for Dynamic Graph Problems.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023
On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance.
ACM Trans. Spatial Algorithms Syst., June, 2023

Covering Rectilinear Polygons with Area-Weighted Rectangles.
CoRR, 2023

On the Complexity of Algorithms with Predictions for Dynamic Graph Problems.
CoRR, 2023

B-Treaps Revised: Write Efficient Randomized Block Search Trees with High Load.
CoRR, 2023

Map matching queries on realistic input graphs under the Fréchet distance.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Exploring Sub-skeleton Trajectories for Interpretable Recognition of Sign Language.
Proceedings of the Database Systems for Advanced Applications, 2022

Optimal Window Queries on Line Segments Using the Trapezoidal Search DAG.
Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2021
A Practical Index Structure Supporting Fréchet Proximity Queries among Trajectories.
ACM Trans. Spatial Algorithms Syst., 2021

Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size.
CoRR, 2021

2020
A Simple Dynamization of Trapezoidal Point Location in Planar Subdivisions.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2018
Algorithm engineering in geometric network planning and data mining
PhD thesis, 2018

2017
Robust Map Matching for Heterogeneous Data via Dominance Decompositions.
Proceedings of the 2017 SIAM International Conference on Data Mining, 2017

Rational Points on the Unit Sphere: Approximation Complexity and Practical Constructions.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

Growing Balls in ℝ<sup><i>d</i></sup>.
Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017


  Loading...