default search action
Martin Seybold
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j3]Joachim Gudmundsson, Martin P. Seybold, Sampson Wong:
Map Matching Queries on Realistic Input Graphs Under the Fréchet Distance. ACM Trans. Algorithms 20(2): 14 (2024) - [c12]Kathrin Hanauer, Martin P. Seybold, Julian Unterweger:
Covering Rectilinear Polygons with Area-Weighted Rectangles. ALENEX 2024: 157-169 - [c11]Joachim Gudmundsson, Martin P. Seybold, Sampson Wong:
Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size. SoCG 2024: 62:1-62:14 - [c10]Monika Henzinger, Barna Saha, Martin P. Seybold, Christopher Ye:
On the Complexity of Algorithms with Predictions for Dynamic Graph Problems. ITCS 2024: 62:1-62:25 - [i13]Martin P. Seybold:
Online List Labeling with Near-Logarithmic Writes. CoRR abs/2405.04467 (2024) - 2023
- [j2]Joachim Gudmundsson, John Pfeifer, Martin P. Seybold:
On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance. ACM Trans. Spatial Algorithms Syst. 9(2): 14:1-14:24 (2023) - [c9]Joachim Gudmundsson, Martin P. Seybold, Sampson Wong:
Map matching queries on realistic input graphs under the Fréchet distance. SODA 2023: 1464-1492 - [i12]Roodabeh Safavi, Martin P. Seybold:
B-Treaps Revised: Write Efficient Randomized Block Search Trees with High Load. CoRR abs/2303.04722 (2023) - [i11]Monika Henzinger, Andrea Lincoln, Barna Saha, Martin P. Seybold, Christopher Ye:
On the Complexity of Algorithms with Predictions for Dynamic Graph Problems. CoRR abs/2307.16771 (2023) - [i10]Kathrin Hanauer, Martin P. Seybold, Julian Unterweger:
Covering Rectilinear Polygons with Area-Weighted Rectangles. CoRR abs/2312.08540 (2023) - 2022
- [c8]Milutin Brankovic, Martin P. Seybold:
Optimal Window Queries on Line Segments Using the Trapezoidal Search DAG. COCOON 2022: 521-528 - [c7]Joachim Gudmundsson, Martin P. Seybold, John Pfeifer:
Exploring Sub-skeleton Trajectories for Interpretable Recognition of Sign Language. DASFAA (1) 2022: 241-249 - [c6]Joachim Gudmundsson, Martin P. Seybold:
A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures. SODA 2022: 610-626 - [i9]Joachim Gudmundsson, Martin P. Seybold, John Pfeifer:
Exploring Sub-skeleton Trajectories for Interpretable Recognition of Sign Language. CoRR abs/2202.01390 (2022) - [i8]Joachim Gudmundsson, John Pfeifer, Martin P. Seybold:
On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance. CoRR abs/2203.10364 (2022) - [i7]Joachim Gudmundsson, Martin P. Seybold, Sampson Wong:
Map matching queries on realistic input graphs under the Fréchet distance. CoRR abs/2211.02951 (2022) - 2021
- [j1]Joachim Gudmundsson, Michael Horton, John Pfeifer, Martin P. Seybold:
A Practical Index Structure Supporting Fréchet Proximity Queries among Trajectories. ACM Trans. Spatial Algorithms Syst. 7(3): 15:1-15:33 (2021) - [c5]Joachim Gudmundsson, Martin P. Seybold, John Pfeifer:
On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance. SIGSPATIAL/GIS 2021: 596-605 - [i6]Joachim Gudmundsson, Martin P. Seybold:
A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures. CoRR abs/2101.04914 (2021) - [i5]Milutin Brankovic, Martin P. Seybold:
Optimal Window Queries on Line Segments using the Trapezoidal Search DAG. CoRR abs/2111.07024 (2021) - [i4]Joachim Gudmundsson, Martin P. Seybold, Sampson Wong:
Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size. CoRR abs/2112.12350 (2021) - 2020
- [c4]Milutin Brankovic, Nikola Grujic, André van Renssen, Martin P. Seybold:
A Simple Dynamization of Trapezoidal Point Location in Planar Subdivisions. ICALP 2020: 18:1-18:18 - [i3]Joachim Gudmundsson, Michael Horton, John Pfeifer, Martin P. Seybold:
A Practical Index Structure Supporting Fréchet Proximity Queries Among Trajectories. CoRR abs/2005.13773 (2020)
2010 – 2019
- 2019
- [i2]Milutin Brankovic, Nikola Grujic, André van Renssen, Martin P. Seybold:
A Simple Dynamization of Trapezoidal Point Location in Planar Subdivisions. CoRR abs/1912.03389 (2019) - 2018
- [b1]Martin P. Seybold:
Algorithm engineering in geometric network planning and data mining. Stuttgart University, Germany, 2018 - 2017
- [c3]Daniel Bahrdt, Michael Becher, Stefan Funke, Filip Krumpe, André Nusser, Martin Seybold, Sabine Storandt:
Growing Balls in ℝd. ALENEX 2017: 247-258 - [c2]Daniel Bahrdt, Martin P. Seybold:
Rational Points on the Unit Sphere: Approximation Complexity and Practical Constructions. ISSAC 2017: 29-36 - [c1]Martin P. Seybold:
Robust Map Matching for Heterogeneous Data via Dominance Decompositions. SDM 2017: 813-821 - [i1]Daniel Bahrdt, Martin P. Seybold:
Rational Points on the Unit Sphere: Approximation Complexity and Practical Constructions. CoRR abs/1707.08549 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint