Thijs van der Horst

Orcid: 0009-0002-6987-4489

According to our database1, Thijs van der Horst authored at least 13 papers between 2022 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Computing the Fréchet Distance When Just One Curve is <i>c</i>-Packed: A Simple Almost-Tight Algorithm.
CoRR, August, 2025

Fréchet Distance in Unweighted Planar Graphs.
CoRR, April, 2025

A near-linear time exact algorithm for the L<sub>1</sub>-geodesic Fréchet distance between two curves on the boundary of a simple polygon.
CoRR, April, 2025

The Geodesic Fréchet Distance Between Two Curves Bounding a Simple Polygon.
CoRR, January, 2025

A Near-Linear Time Exact Algorithm for the L₁-Geodesic Fréchet Distance Between Two Curves on the Boundary of a Simple Polygon.
Proceedings of the 19th International Symposium on Algorithms and Data Structures, 2025

Faster, Deterministic and Space Efficient Subtrajectory Clustering.
Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024
Faster and Deterministic Subtrajectory Clustering.
CoRR, 2024

Robust Bichromatic Classification Using Two Lines.
Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Faster Fréchet Distance Approximation Through Truncated Smoothing.
Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023
Simply Realising an Imprecise Polyline is NP-hard.
CoRR, 2023

A Subquadratic <i>n</i><sup>ε</sup>-approximation for the Continuous Fréchet Distance.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
A Subquadratic n<sup>ε</sup>-approximation for the Continuous Fréchet Distance.
CoRR, 2022

Chromatic k-Nearest Neighbor Queries.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022


  Loading...