Chromatic k-Nearest Neighbor Queries. - Thijs van der Horst; Maarten Löffler; Frank Staals (ESA, 2022)

A Subquadratic nε-approximation for the Continuous Fréchet Distance. - Thijs van der Horst; Marc J. van Kreveld; Tim Ophelders; Bettina Speckmann (CoRR, 2022)

A Subquadratic nε-approximation for the Continuous Fréchet Distance. - Thijs van der Horst; Marc J. van Kreveld; Tim Ophelders; Bettina Speckmann (SODA, 2023)

Simply Realising an Imprecise Polyline is NP-hard. - Thijs van der Horst; Tim Ophelders; Bart van der Steenhoven (CoRR, 2023)

Faster Fréchet Distance Approximation Through Truncated Smoothing. - Thijs van der Horst; Tim Ophelders (SoCG, 2024)

Robust Bichromatic Classification Using Two Lines. - Erwin Glazenburg; Thijs van der Horst; Tom Peters; Bettina Speckmann; Frank Staals (ISAAC, 2024)

Faster and Deterministic Subtrajectory Clustering. - Ivor van der Hoog; Thijs van der Horst; Tim Ophelders (CoRR, 2024)

Faster, Deterministic and Space Efficient Subtrajectory Clustering. - Ivor van der Hoog; Thijs van der Horst; Tim Ophelders (ICALP, 2025)

A Near-Linear Time Exact Algorithm for the L₁-Geodesic Fréchet Distance Between Two Curves on the Boundary of a Simple Polygon. - Thijs van der Horst; Marc J. van Kreveld; Tim Ophelders; Bettina Speckmann (WADS, 2025)

The Geodesic Fréchet Distance Between Two Curves Bounding a Simple Polygon. - Thijs van der Horst; Marc J. van Kreveld; Tim Ophelders; Bettina Speckmann (CoRR, 2025)

A near-linear time exact algorithm for the L1-geodesic Fréchet distance between two curves on the boundary of a simple polygon. - Thijs van der Horst; Marc J. van Kreveld; Tim Ophelders; Bettina Speckmann (CoRR, 2025)

Fréchet Distance in Unweighted Planar Graphs. - Ivor van der Hoog; Thijs van der Horst; Eva Rotenberg; Lasse Wulf (CoRR, 2025)

Computing the Fréchet Distance When Just One Curve is c-Packed: A Simple Almost-Tight Algorithm. - Jacobus Conradi; Ivor van der Hoog; Thijs van der Horst; Tim Ophelders (CoRR, 2025)