default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTim Ophelders
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c29]Thijs Beurskens, Tim Ophelders, Bettina Speckmann, Kevin Verbeek:
Relating Interleaving and Fréchet Distances via Ordered Merge Trees. SODA 2025: 5027-5050- 2024
- [c28]Thijs van der Horst
, Tim Ophelders:
Faster Fréchet Distance Approximation Through Truncated Smoothing. SoCG 2024: 63:1-63:15 - [c27]Irina Kostitsyna, Tim Ophelders, Irene Parada, Tom Peters, Willem Sonke, Bettina Speckmann:
Optimal In-Place Compaction of Sliding Cubes (Media Exposition). SoCG 2024: 89:1-89:4 - [c26]Sarita de Berg, Tim Ophelders, Irene Parada, Frank Staals, Jules Wulms:
The Complexity of Geodesic Spanners Using Steiner Points. ISAAC 2024: 25:1-25:15 - [c25]Irina Kostitsyna, Tim Ophelders, Irene Parada, Tom Peters, Willem Sonke, Bettina Speckmann:
Optimal In-Place Compaction of Sliding Cubes. SWAT 2024: 31:1-31:14 - [i21]Thijs van der Horst, Tim Ophelders:
Faster Fréchet Distance Approximation through Truncated Smoothing. CoRR abs/2401.14815 (2024) - [i20]Sarita de Berg, Tim Ophelders, Irene Parada, Frank Staals, Jules Wulms:
The Complexity of Geodesic Spanners using Steiner Points. CoRR abs/2402.12110 (2024) - [i19]Ivor van der Hoog, Thijs van der Horst, Tim Ophelders:
Faster and Deterministic Subtrajectory Clustering. CoRR abs/2402.13117 (2024) - 2023
- [j9]Kevin Buchin, William S. Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, Alexander Wolff:
Morphing Planar Graph Drawings Through 3D. Comput. Geom. Topol. 2(1): 5:1-5:18 (2023) - [j8]Kevin Buchin, Maarten Löffler, Tim Ophelders, Aleksandr Popov, Jérôme Urhausen, Kevin Verbeek:
Computing the Fréchet distance between uncertain curves in one dimension. Comput. Geom. 109: 101923 (2023) - [c24]Maarten Löffler, Tim Ophelders, Rodrigo I. Silveira, Frank Staals:
Shortest Paths in Portalgons. SoCG 2023: 48:1-48:16 - [c23]Thijs van der Horst, Marc J. van Kreveld, Tim Ophelders, Bettina Speckmann:
A Subquadratic nε-approximation for the Continuous Fréchet Distance. SODA 2023: 1759-1776 - [c22]Kevin Buchin, William S. Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, Alexander Wolff:
Morphing Planar Graph Drawings Through 3D. SOFSEM 2023: 80-95 - [i18]Maarten Löffler, Tim Ophelders, Frank Staals, Rodrigo I. Silveira:
Shortest Paths in Portalgons. CoRR abs/2303.08937 (2023) - [i17]Thijs van der Horst, Tim Ophelders, Bart van der Steenhoven:
Simply Realising an Imprecise Polyline is NP-hard. CoRR abs/2304.13094 (2023) - [i16]Thijs Beurskens, Tim Ophelders, Bettina Speckmann, Kevin Verbeek:
A Monotone Interleaving Distance for Merge Trees. CoRR abs/2312.11113 (2023) - [i15]Irina Kostitsyna, Tim Ophelders, Irene Parada, Tom Peters, Willem Sonke, Bettina Speckmann:
Optimal In-Place Compaction of Sliding Cubes. CoRR abs/2312.15096 (2023) - 2022
- [j7]Marc J. van Kreveld, Tillmann Miltzow, Tim Ophelders, Willem Sonke, Jordi L. Vermeulen:
Between shapes, using the Hausdorff distance. Comput. Geom. 100: 101817 (2022) - [c21]Tim Ophelders, Salman Parsa:
Minimum Height Drawings of Ordered Trees in Polynomial Time: Homotopy Height of Tree Duals. SoCG 2022: 55:1-55:16 - [c20]Maike Buchin, Ivor van der Hoog, Tim Ophelders, Lena Schlipf, Rodrigo I. Silveira, Frank Staals:
Efficient Fréchet Distance Queries for Segments. ESA 2022: 29:1-29:14 - [i14]Maike Buchin, Ivor van der Hoog, Tim Ophelders, Lena Schlipf, Rodrigo I. Silveira, Frank Staals:
Efficient Fréchet distance queries for segments. CoRR abs/2203.01794 (2022) - [i13]Salman Parsa, Tim Ophelders:
Minimum Height Drawings of Ordered Trees in Polynomial Time: Homotopy Height of Tree Duals. CoRR abs/2203.08364 (2022) - [i12]Thijs van der Horst, Marc J. van Kreveld, Tim Ophelders, Bettina Speckmann:
A Subquadratic nε-approximation for the Continuous Fréchet Distance. CoRR abs/2208.12721 (2022) - [i11]Kevin Buchin, William S. Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, Alexander Wolff:
Morphing Planar Graph Drawings Through 3D. CoRR abs/2210.05384 (2022) - 2021
- [j6]Tim Ophelders, Roel Lambers, Frits C. R. Spieksma, Tjark Vredeveld:
A note on equitable Hamiltonian cycles. Discret. Appl. Math. 303: 127-136 (2021) - [c19]Erin Wolf Chambers, Elizabeth Munch, Tim Ophelders:
A Family of Metrics from the Truncated Smoothing of Reeb Graphs. SoCG 2021: 22:1-22:17 - [c18]Tim Ophelders, Ignaz Rutter, Bettina Speckmann, Kevin Verbeek:
Polygon-Universal Graphs. SoCG 2021: 55:1-55:15 - [c17]Marc J. van Kreveld, Tim Ophelders, Willem Sonke, Bettina Speckmann, Kevin Verbeek:
Volume from Outlines on Terrains. GIScience (I) 2021: 16:1-16:15 - [c16]Kevin Buchin, Maarten Löffler, Tim Ophelders, Aleksandr Popov, Jérôme Urhausen, Kevin Verbeek:
Computing the Fréchet Distance Between Uncertain Curves in One Dimension. WADS 2021: 243-257 - [i10]Tim Ophelders, Ignaz Rutter, Bettina Speckmann, Kevin Verbeek:
Polygon-Universal Graphs. CoRR abs/2103.06916 (2021) - [i9]Kevin Buchin, Maarten Löffler, Tim Ophelders, Aleksandr Popov, Jérôme Urhausen, Kevin Verbeek:
Computing the Fréchet Distance Between Uncertain Curves in One Dimension. CoRR abs/2105.09922 (2021) - 2020
- [j5]Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans, Tim Ophelders, Claire Pennarun, Csaba D. Tóth, Sander Verdonschot:
Convex polygons in cartesian products. J. Comput. Geom. 11(2): 205-233 (2020) - [c15]Hsien-Chih Chang, Tim Ophelders:
Planar Emulators for Monge Matrices. CCCG 2020: 141-147 - [c14]Mees van de Kerkhof, Irina Kostitsyna, Marc J. van Kreveld, Maarten Löffler, Tim Ophelders:
Route-preserving Road Network Generalization. SIGSPATIAL/GIS 2020: 381-384 - [c13]Marc J. van Kreveld, Tillmann Miltzow, Tim Ophelders, Willem Sonke, Jordi L. Vermeulen:
Between Shapes, Using the Hausdorff Distance. ISAAC 2020: 13:1-13:16 - [i8]Erin Wolf Chambers, Elizabeth Munch, Tim Ophelders:
A family of metrics from the truncated smoothing of Reeb graphs. CoRR abs/2007.07795 (2020) - [i7]Marc J. van Kreveld, Tillmann Miltzow, Tim Ophelders, Willem Sonke, Jordi L. Vermeulen:
Between Shapes, Using the Hausdorff Distance. CoRR abs/2009.14719 (2020) - [i6]Kayla Makela, Tim Ophelders, Michelle Quigley, Elizabeth Munch, Daniel H. Chitwood, Asia Dowtin:
Automatic Tree Ring Detection using Jacobi Sets. CoRR abs/2010.08691 (2020)
2010 – 2019
- 2019
- [j4]Maarten Kleinhans, Marc J. van Kreveld, Tim Ophelders, Willem Sonke, Bettina Speckmann, Kevin Verbeek:
Computing representative networks for braided rivers. J. Comput. Geom. 10(1): 423-443 (2019) - [c12]Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans, Tim Ophelders, Claire Pennarun, Csaba D. Tóth, Sander Verdonschot:
Convex Polygons in Cartesian Products. SoCG 2019: 22:1-22:17 - [c11]Therese Biedl, Erin Wolf Chambers, David Eppstein, Arnaud de Mesmay, Tim Ophelders:
Homotopy Height, Grid-Major Height and Graph-Drawing Height. GD 2019: 468-481 - [c10]Daniel H. Chitwood, Mitchell Eithun, Elizabeth Munch, Tim Ophelders:
Topological Mapper for 3D Volumetric Images. ISMM 2019: 84-95 - [c9]Kevin Buchin, Tim Ophelders, Bettina Speckmann:
SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension. SODA 2019: 2887-2901 - [i5]Therese Biedl, Erin Wolf Chambers, David Eppstein, Arnaud de Mesmay, Tim Ophelders:
Homotopy height, grid-major height and graph-drawing height. CoRR abs/1908.05706 (2019) - 2018
- [j3]Kevin Buchin, Tim Ophelders, Bettina Speckmann:
Computing the similarity between moving curves. Comput. Geom. 73: 2-14 (2018) - [j2]Marzio De Biasi, Tim Ophelders:
The complexity of snake and undirected NCL variants. Theor. Comput. Sci. 748: 55-65 (2018) - [c8]Willem Sonke, Marc J. van Kreveld, Tim Ophelders, Bettina Speckmann, Kevin Verbeek:
Volume-based similarity of linear features on terrains. SIGSPATIAL/GIS 2018: 444-447 - [c7]Erin Wolf Chambers, Arnaud de Mesmay, Tim Ophelders:
On the complexity of optimal homotopies. SODA 2018: 1121-1134 - [i4]Kevin Buchin, Tim Ophelders, Bettina Speckmann:
SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension. CoRR abs/1807.08699 (2018) - [i3]Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans, Tim Ophelders, Claire Pennarun, Csaba D. Tóth, Sander Verdonschot:
Convex Polygons in Cartesian Products. CoRR abs/1812.11332 (2018) - 2017
- [j1]Maximilian Konzack, Thomas J. McKetterick, Tim Ophelders, Maike Buchin, Luca Giuggioli, Jed A. Long, Trisalyn A. Nelson, Michel A. Westenberg, Kevin Buchin:
Visual analytics of delays and interaction in movement data. Int. J. Geogr. Inf. Sci. 31(2): 320-345 (2017) - [c6]Mark de Berg, Ali D. Mehrabi, Tim Ophelders:
Data Structures for Fréchet Queries in Trajectory Data. CCCG 2017: 214-219 - [c5]Maarten Kleinhans, Marc J. van Kreveld, Tim Ophelders, Willem Sonke, Bettina Speckmann, Kevin Verbeek:
Computing Representative Networks for Braided Rivers. SoCG 2017: 48:1-48:16 - [c4]Benjamin A. Burton, Erin W. Chambers, Marc J. van Kreveld, Wouter Meulemans, Tim Ophelders, Bettina Speckmann:
Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary. ESA 2017: 23:1-23:14 - [c3]Kevin Buchin, Tim Ophelders, Bettina Speckmann:
Computing the Fréchet Distance between Real-Valued Surfaces. SODA 2017: 2443-2455 - [i2]Erin Wolf Chambers, Arnaud de Mesmay, Tim Ophelders:
On the complexity of optimal homotopies. CoRR abs/1711.00788 (2017) - 2016
- [c2]Marzio De Biasi, Tim Ophelders:
The Complexity of Snake. FUN 2016: 11:1-11:13 - 2015
- [c1]Kevin Buchin, Tim Ophelders, Bettina Speckmann:
Computing the Similarity Between Moving Curves. ESA 2015: 928-940 - [i1]Kevin Buchin, Tim Ophelders, Bettina Speckmann:
Computing the Similarity Between Moving Curves. CoRR abs/1507.03819 (2015)
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 2025-01-29 22:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
