The Complexity of Snake. - Marzio De Biasi; Tim Ophelders (FUN, 2016)

Data Structures for Fréchet Queries in Trajectory Data. - Mark de Berg; Ali D. Mehrabi; Tim Ophelders (CCCG, 2017)

Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary. - Benjamin A. Burton; Erin W. Chambers; Marc J. van Kreveld; Wouter Meulemans; Tim Ophelders; Bettina Speckmann (ESA, 2017)

Computing the Fréchet Distance between Real-Valued Surfaces. - Kevin Buchin; Tim Ophelders; Bettina Speckmann (SODA, 2017)

Visual analytics of delays and interaction in movement data. - Maximilian Konzack; Thomas J. McKetterick; Tim Ophelders; Maike Buchin; Luca Giuggioli; Jed A. Long; Trisalyn A. Nelson; Michel A. Westenberg; Kevin Buchin (Int. J. Geogr. Inf. Sci., 2017)

Volume-based similarity of linear features on terrains. - Willem Sonke; Marc J. van Kreveld; Tim Ophelders; Bettina Speckmann; Kevin Verbeek (SIGSPATIAL/GIS, 2018)

On the complexity of optimal homotopies. - Erin Wolf Chambers; Arnaud de Mesmay; Tim Ophelders (SODA, 2018)

Computing the similarity between moving curves. - Kevin Buchin; Tim Ophelders; Bettina Speckmann (Comput. Geom., 2018)

The complexity of snake and undirected NCL variants. - Marzio De Biasi; Tim Ophelders (Theor. Comput. Sci., 2018)

Homotopy Height, Grid-Major Height and Graph-Drawing Height. - Therese Biedl; Erin Wolf Chambers; David Eppstein; Arnaud de Mesmay; Tim Ophelders (GD, 2019)

Topological Mapper for 3D Volumetric Images. - Daniel H. Chitwood; Mitchell Eithun; Elizabeth Munch; Tim Ophelders (ISMM, 2019)

SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension. - Kevin Buchin; Tim Ophelders; Bettina Speckmann (SODA, 2019)

Computing representative networks for braided rivers. - Maarten Kleinhans; Marc J. van Kreveld; Tim Ophelders; Willem Sonke; Bettina Speckmann; Kevin Verbeek (J. Comput. Geom., 2019)

Planar Emulators for Monge Matrices. - Hsien-Chih Chang; Tim Ophelders (CCCG, 2020)

Route-preserving Road Network Generalization. - Mees van de Kerkhof; Irina Kostitsyna; Marc J. van Kreveld; Maarten Löffler; Tim Ophelders (SIGSPATIAL/GIS, 2020)

Automatic Tree Ring Detection using Jacobi Sets. - Kayla Makela; Tim Ophelders; Michelle Quigley; Elizabeth Munch; Daniel H. Chitwood; Asia Dowtin (CoRR, 2020)

Convex polygons in cartesian products. - Jean-Lou De Carufel; Adrian Dumitrescu; Wouter Meulemans; Tim Ophelders; Claire Pennarun; Csaba D. Tóth; Sander Verdonschot (J. Comput. Geom., 2020)

A Family of Metrics from the Truncated Smoothing of Reeb Graphs. - Erin Wolf Chambers; Elizabeth Munch; Tim Ophelders (SoCG, 2021)

Polygon-Universal Graphs. - Tim Ophelders; Ignaz Rutter; Bettina Speckmann; Kevin Verbeek (SoCG, 2021)

Volume from Outlines on Terrains. - Marc J. van Kreveld; Tim Ophelders; Willem Sonke; Bettina Speckmann; Kevin Verbeek (GIScience (I), 2021)

A note on equitable Hamiltonian cycles. - Tim Ophelders; Roel Lambers; Frits C. R. Spieksma; Tjark Vredeveld (Discret. Appl. Math., 2021)

Minimum Height Drawings of Ordered Trees in Polynomial Time: Homotopy Height of Tree Duals. - Tim Ophelders; Salman Parsa (SoCG, 2022)

Efficient Fréchet Distance Queries for Segments. - Maike Buchin; Ivor van der Hoog; Tim Ophelders; Lena Schlipf; Rodrigo I. Silveira; Frank Staals (ESA, 2022)

Between shapes, using the Hausdorff distance. - Marc J. van Kreveld; Tillmann Miltzow; Tim Ophelders; Willem Sonke; Jordi L. Vermeulen (Comput. Geom., 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)

Shortest Paths in Portalgons. - Maarten Löffler; Tim Ophelders; Rodrigo I. Silveira; Frank Staals (SoCG, 2023)

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

Morphing Planar Graph Drawings Through 3D. - Kevin Buchin; William S. Evans; Fabrizio Frati; Irina Kostitsyna; Maarten Löffler; Tim Ophelders; Alexander Wolff 001 (Comput. Geom. Topol., 2023)

Computing the Fréchet distance between uncertain curves in one dimension. - Kevin Buchin; Maarten Löffler; Tim Ophelders; Aleksandr Popov 001; Jérôme Urhausen; Kevin Verbeek (Comput. Geom., 2023)

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

A Monotone Interleaving Distance for Merge Trees. - Thijs Beurskens; Tim Ophelders; Bettina Speckmann; Kevin Verbeek (CoRR, 2023)

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

Optimal In-Place Compaction of Sliding Cubes (Media Exposition). - Irina Kostitsyna; Tim Ophelders; Irene Parada; Tom Peters; Willem Sonke; Bettina Speckmann (SoCG, 2024)

The Complexity of Geodesic Spanners Using Steiner Points. - Sarita de Berg; Tim Ophelders; Irene Parada; Frank Staals; Jules Wulms (ISAAC, 2024)

Optimal In-Place Compaction of Sliding Cubes. - Irina Kostitsyna; Tim Ophelders; Irene Parada; Tom Peters; Willem Sonke; Bettina Speckmann (SWAT, 2024)

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

Computing Geomorphologically Salient Networks via Discrete Morse Theory. - Tim Ophelders; Anna Schenfisch; Willem Sonke; Bettina Speckmann (SoCG, 2025)

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

ParkView: Visualizing Monotone Interleavings. - Thijs Beurskens; Steven van den Broek; Arjen Simons; Willem Sonke; Kevin Verbeek; Tim Ophelders; Michael Hoffmann 001; Bettina Speckmann (PacificVis, 2025)

Relating Interleaving and Fréchet Distances via Ordered Merge Trees. - Thijs Beurskens; Tim Ophelders; Bettina Speckmann; Kevin Verbeek (SODA, 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)

Sweeping Orders for Simplicial Complex Reconstruction. - Tim Ophelders; Anna Schenfisch (CoRR, 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)

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)