default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnne Driemel
Person information
- affiliation: University of Bonn, Hausdorff Center for Mathematics, Bonn, Germany
- affiliation: TU Eindhoven, Department of Mathematics and Computer Science, The Netherlands
- affiliation: Dortmund Technical University, Department of Computer Science, Germany
- affiliation (PhD 2013): Utrecht University, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Jacobus Conradi, Anne Driemel, Benedikt Kolbe:
(1+ε)-ANN Data Structure for Curves via Subspaces of Bounded Doubling Dimension. Comput. Geom. Topol. 3(2): 6:1-6:22 (2024)- [j12]Jacobus Conradi, Anne Driemel:
On Computing the k-Shortcut Fréchet Distance. ACM Trans. Algorithms 20(4): 29:1-29:37 (2024) - [c32]Lotte Blank, Anne Driemel:
A Faster Algorithm for the Fréchet Distance in 1D for the Imbalanced Case. ESA 2024: 28:1-28:15 - [c31]Frederik Brüning, Anne Driemel
, Alperen Ergür, Heiko Röglin:
On the number of iterations of the DBA algorithm. SDM 2024: 172-180 - [c30]Lotte Blank, Anne Driemel:
Range Reporting for Time Series via Rectangle Stabbing. SWAT 2024: 15:1-15:15 - [i40]Jacobus Conradi, Anne Driemel, Benedikt Kolbe:
Revisiting the Fréchet distance between piecewise smooth curves. CoRR abs/2401.03339 (2024) - [i39]Lotte Blank, Anne Driemel:
Range Reporting for Time Series via Rectangle Stabbing. CoRR abs/2401.03762 (2024) - [i38]Frederik Brüning, Anne Driemel, Alperen Ergür, Heiko Röglin:
On the number of iterations of the DBA algorithm. CoRR abs/2401.05841 (2024) - [i37]Lotte Blank, Anne Driemel:
A faster algorithm for the Fr%eacute;chet distance in 1D for the imbalanced case. CoRR abs/2404.18738 (2024) - 2023
- [j11]Frederik Brüning, Hugo A. Akitaya, Erin W. Chambers, Anne Driemel:
Subtrajectory Clustering: Finding Set Covers for Set Systems of Subcurves. Comput. Geom. Topol. 2(1): 1:1-1:48 (2023) - [j10]Maike Buchin, Anne Driemel, Dennis Rohde:
Approximating (k,ℓ)-Median Clustering for Polygonal Curves. ACM Trans. Algorithms 19(1): 4:1-4:32 (2023) - [c29]Jorge de Heuvel, Nathan Corral, Benedikt Kreis, Jacobus Conradi, Anne Driemel, Maren Bennewitz:
Learning Depth Vision-Based Personalized Robot Navigation From Dynamic Demonstrations in Virtual Reality. IROS 2023: 6757-6764 - [i36]Jacobus Conradi, Anne Driemel, Benedikt Kolbe:
(1+ε)-ANN Data Structure for Curves via Subspaces of Bounded Doubling Dimension. CoRR abs/2307.08521 (2023) - [i35]Frederik Brüning, Anne Driemel:
Simplified and Improved Bounds on the VC-Dimension for Elastic Distance Measures. CoRR abs/2308.05998 (2023) - [i34]Jacobus Conradi, Anne Driemel:
Finding Complex Patterns in Trajectory Data via Geometric Set Cover. CoRR abs/2308.14865 (2023) - [i33]Susanne Crewell, Anne Driemel, Jeff M. Phillips, Dwaipayan Chatterjee:
Computational Geometry of Earth System Analysis (Dagstuhl Seminar 23342). Dagstuhl Reports 13(8): 91-105 (2023) - 2022
- [j9]Gautam Kamath, Sepehr Assadi, Anne Driemel, Janardhan Kulkarni:
Introduction to the Special Issue on ACM-SIAM Symposium on Discrete Algorithms (SODA) 2020. ACM Trans. Algorithms 18(4): 30:1-30:2 (2022) - [c28]Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman J. Haverkort, Jürgen Kusche, Elmar Langetepe, Philip Mayer, Petra Mutzel, Heiko Röglin:
Minimum-Error Triangulations for Sea Surface Reconstruction. SoCG 2022: 7:1-7:18 - [c27]Anne Driemel, Ivor van der Hoog, Eva Rotenberg:
On the Discrete Fréchet Distance in a Graph. SoCG 2022: 36:1-36:18 - [c26]Frederik Brüning, Jacobus Conradi, Anne Driemel:
Faster Approximate Covering of Subcurves Under the Fréchet Distance. ESA 2022: 28:1-28:16 - [c25]Jacobus Conradi, Anne Driemel:
On Computing the k-Shortcut Fréchet Distance. ICALP 2022: 46:1-46:20 - [c24]Karl Bringmann, Anne Driemel, André Nusser, Ioannis Psarros:
Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Fréchet Distance. SODA 2022: 517-550 - [c23]Garance Gourdel, Anne Driemel, Pierre Peterlongo, Tatiana Starikovskaya:
Pattern Matching Under DTW Distance. SPIRE 2022: 315-330 - [c22]Maike Buchin, Anne Driemel, Koen van Greevenbroek, Ioannis Psarros, Dennis Rohde:
Approximating Length-Restricted Means Under Dynamic Time Warping. WAOA 2022: 225-253 - [i32]Anne Driemel, Ivor van der Hoog, Eva Rotenberg:
On the Discrete Fréchet Distance in a Graph. CoRR abs/2201.02121 (2022) - [i31]Jacobus Conradi, Anne Driemel:
On Computing the k-Shortcut Fréchet Distance. CoRR abs/2202.11534 (2022) - [i30]Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman J. Haverkort, Jürgen Kusche, Elmar Langetepe, Philip Mayer, Petra Mutzel, Heiko Röglin:
Minimum-Error Triangulations for Sea Surface Reconstruction. CoRR abs/2203.07325 (2022) - [i29]Frederik Brüning, Jacobus Conradi, Anne Driemel:
Faster Approximate Covering of Subcurves under the Fréchet Distance. CoRR abs/2204.09949 (2022) - [i28]Garance Gourdel, Anne Driemel, Pierre Peterlongo, Tatiana Starikovskaya:
Pattern matching under DTW distance. CoRR abs/2208.14669 (2022) - [i27]Annika Bonerath, Anne Driemel, Jan-Henrik Haunert, Herman J. Haverkort, Elmar Langetepe, Benjamin Niedermann:
Analysis of a Greedy Heuristic for the Labeling of a Map with a Time-Window Interface. CoRR abs/2209.00913 (2022) - 2021
- [j8]Anne Driemel, André Nusser, Jeff M. Phillips, Ioannis Psarros:
The VC Dimension of Metric Balls under Fréchet and Hausdorff Distances. Discret. Comput. Geom. 66(4): 1351-1381 (2021) - [c21]Peter Rottmann, Anne Driemel, Herman J. Haverkort, Heiko Röglin, Jan-Henrik Haunert:
Bicriteria Aggregation of Polygons via Graph Cuts. GIScience (II) 2021: 6:1-6:16 - [c20]Maike Buchin, Anne Driemel, Dennis Rohde:
Approximating (k, ℓ-Median Clustering for Polygonal Curves. SODA 2021: 2697-2717 - [c19]Anne Driemel, Ioannis Psarros:
ANN for Time Series Under the Fréchet Distance. WADS 2021: 315-328 - [i26]Hugo A. Akitaya, Frederik Brüning, Erin W. Chambers, Anne Driemel:
Covering a Curve with Subtrajectories. CoRR abs/2103.06040 (2021) - [i25]Karl Bringmann, Anne Driemel, André Nusser, Ioannis Psarros:
Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Fréchet Distance. CoRR abs/2107.07792 (2021) - [i24]Maike Buchin, Anne Driemel, Koen van Greevenbroek, Ioannis Psarros, Dennis Rohde:
Approximating Length-Restricted Means under Dynamic Time Warping. CoRR abs/2112.00408 (2021) - [i23]Siu-Wing Cheng, Anne Driemel, Jeff M. Phillips:
Computational Geometry (Dagstuhl Seminar 21181). Dagstuhl Reports 11(4): 1-19 (2021) - 2020
- [c18]Kevin Buchin, Anne Driemel, Martijn Struijs:
On the Hardness of Computing an Average Curve. SWAT 2020: 19:1-19:19 - [i22]Anne Driemel, Ioannis Psarros:
(2+ε)-ANN for time series under the Fréchet distance. CoRR abs/2008.09406 (2020) - [i21]Maike Buchin, Anne Driemel, Dennis Rohde:
Approximating (k, 𝓁)-Median Clustering for Polygonal Curves. CoRR abs/2009.01488 (2020) - [i20]Anne Driemel, Petra Mutzel, Lutz Oettershagen:
Spatio-Temporal Top-k Similarity Search for Trajectories in Graphs. CoRR abs/2009.06778 (2020)
2010 – 2019
- 2019
- [c17]Anne Driemel, Jeff M. Phillips, Ioannis Psarros:
The VC Dimension of Metric Balls Under Fréchet and Hausdorff Distances. SoCG 2019: 28:1-28:16 - [c16]Kevin Buchin, Anne Driemel, Natasja van de L'Isle, André Nusser:
klcluster: Center-based Clustering of Trajectories. SIGSPATIAL/GIS 2019: 496-499 - [c15]Kevin Buchin, Anne Driemel, Joachim Gudmundsson, Michael Horton, Irina Kostitsyna, Maarten Löffler, Martijn Struijs:
Approximating (k, ℓ)-center clustering for curves. SODA 2019: 2922-2938 - [c14]Matteo Ceccarello, Anne Driemel, Francesco Silvestri:
FRESH: Fréchet Similarity with Hashing. WADS 2019: 254-268 - [i19]Kevin Buchin, Anne Driemel, Martijn Struijs:
On the hardness of computing an average curve. CoRR abs/1902.08053 (2019) - [i18]Anne Driemel, Jeff M. Phillips, Ioannis Psarros:
The VC Dimension of Metric Balls under Fréchet and Hausdorff Distances. CoRR abs/1903.03211 (2019) - [i17]Anne Driemel, Ioannis Psarros, Melanie Schmidt:
Sublinear data structures for short Fréchet queries. CoRR abs/1907.04420 (2019) - [i16]Siu-Wing Cheng, Anne Driemel, Jeff Erickson:
Computational Geometry (Dagstuhl Seminar 19181). Dagstuhl Reports 9(4): 107-123 (2019) - 2018
- [c13]Peyman Afshani, Anne Driemel:
On the complexity of range searching among curves. SODA 2018: 898-917 - [c12]Anne Driemel, Amer Krivosija:
Probabilistic Embeddings of the Fréchet Distance. WAOA 2018: 218-237 - [i15]Kevin Buchin, Anne Driemel, Joachim Gudmundsson, Michael Horton, Irina Kostitsyna, Maarten Löffler:
Approximating (k, 𝓁)-center clustering for curves. CoRR abs/1805.01547 (2018) - [i14]Anne Driemel, Amer Krivosija:
Probabilistic embeddings of the Fréchet distance. CoRR abs/1808.01983 (2018) - [i13]Matteo Ceccarello, Anne Driemel, Francesco Silvestri:
FRESH: Fréchet Similarity with Hashing. CoRR abs/1809.02350 (2018) - [i12]Anne Driemel, Rob J. Hyndman, Galit Shmueli:
Analysing Large Collections of Time Series (NII Shonan Meeting 2018-3). NII Shonan Meet. Rep. 2018 (2018) - 2017
- [c11]Anne Driemel, Francesco Silvestri:
Locality-Sensitive Hashing of Curves. SoCG 2017: 37:1-37:16 - [i11]Anne Driemel, Francesco Silvestri:
Locality-sensitive hashing of curves. CoRR abs/1703.04040 (2017) - [i10]Peyman Afshani, Anne Driemel:
On the complexity of range searching among curves. CoRR abs/1707.04789 (2017) - [i9]Otfried Cheong, Anne Driemel, Jeff Erickson:
Computational Geometry (Dagstuhl Seminar 17171). Dagstuhl Reports 7(4): 107-127 (2017) - 2016
- [j7]Boris Aronov, Anne Driemel, Marc J. van Kreveld, Maarten Löffler, Frank Staals:
Segmentation of Trajectories on Nonmonotone Criteria. ACM Trans. Algorithms 12(2): 26:1-26:28 (2016) - [j6]Anne Driemel, Sariel Har-Peled, Benjamin Raichel:
On the Expected Complexity of Voronoi Diagrams on Terrains. ACM Trans. Algorithms 12(3): 37:1-37:20 (2016) - [c10]Anne Driemel, Amer Krivosija, Christian Sohler:
Clustering time series under the Fréchet distance. SODA 2016: 766-785 - 2015
- [j5]Atlas F. Cook IV, Anne Driemel, Jessica Sherette, Carola Wenk:
Computing the Fréchet distance between folded polygons. Comput. Geom. 50: 1-16 (2015) - [i8]Anne Driemel, Amer Krivosija, Christian Sohler:
Clustering time series under the Fréchet distance. CoRR abs/1512.04349 (2015) - 2014
- [c9]Maike Buchin, Anne Driemel, Bettina Speckmann:
Computing the Fréchet distance with shortcuts is NP-hard. SoCG 2014: 367 - 2013
- [b1]Anne Driemel:
Realistic Analysis for Algorithmic Problems on Geographical Data. Utrecht University, Netherlands, 2013 - [j4]Anne Driemel, Herman J. Haverkort, Maarten Löffler, Rodrigo I. Silveira:
Flow computations on imprecise terrains. J. Comput. Geom. 4(1): 38-78 (2013) - [j3]Anne Driemel, Sariel Har-Peled:
Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts. SIAM J. Comput. 42(5): 1830-1866 (2013) - [c8]Boris Aronov, Anne Driemel, Marc J. van Kreveld, Maarten Löffler, Frank Staals:
Segmentation of Trajectories for Non-Monotone Criteria. SODA 2013: 1897-1911 - [i7]Maike Buchin, Anne Driemel, Bettina Speckmann:
Computing the Fréchet distance with shortcuts is NP-hard. CoRR abs/1307.2097 (2013) - 2012
- [j2]Anne Driemel, Sariel Har-Peled, Carola Wenk:
Approximating the Fréchet Distance for Realistic Curves in Near Linear Time. Discret. Comput. Geom. 48(1): 94-127 (2012) - [c7]Anne Driemel, Sariel Har-Peled, Benjamin Raichel:
On the expected complexity of voronoi diagrams on terrains. SCG 2012: 101-110 - [c6]Anne Driemel, Sariel Har-Peled:
Jaywalking your dog: computing the Fréchet distance with shortcuts. SODA 2012: 318-337 - 2011
- [j1]Maike Buchin, Anne Driemel, Marc J. van Kreveld, Vera Sacristán:
Segmenting trajectories: A framework and algorithms using spatiotemporal criteria. J. Spatial Inf. Sci. 3(1): 33-63 (2011) - [c5]Daniel Chen, Anne Driemel, Leonidas J. Guibas, Andy Nguyen, Carola Wenk:
Approximate Map Matching with respect to the Fréchet Distance. ALENEX 2011: 75-83 - [c4]Atlas F. Cook, Anne Driemel, Sariel Har-Peled, Jessica Sherette, Carola Wenk:
Computing the Fréchet Distance between Folded Polygons. WADS 2011: 267-278 - [c3]Anne Driemel, Herman J. Haverkort, Maarten Löffler, Rodrigo I. Silveira:
Flow Computations on Imprecise Terrains. WADS 2011: 350-361 - [i6]Atlas F. Cook, Anne Driemel, Sariel Har-Peled, Jessica Sherette, Carola Wenk:
Computing the Fréchet Distance Between Folded Polygons. CoRR abs/1103.2865 (2011) - [i5]Anne Driemel, Sariel Har-Peled:
Jaywalking your Dog - Computing the Fréchet Distance with Shortcuts. CoRR abs/1107.1720 (2011) - [i4]Anne Driemel, Herman J. Haverkort, Maarten Löffler:
Flow Computations on Imprecise Terrains. CoRR abs/1111.1651 (2011) - [i3]Anne Driemel, Sariel Har-Peled, Benjamin Raichel:
On the Expected Complexity of Voronoi Diagrams on Terrains. CoRR abs/1112.0695 (2011) - 2010
- [c2]Anne Driemel, Sariel Har-Peled, Carola Wenk:
Approximating the Fréchet distance for realistic curves in near linear time. SCG 2010: 365-374 - [c1]Maike Buchin, Anne Driemel, Marc J. van Kreveld, Vera Sacristán:
An algorithmic framework for segmenting trajectories based on spatio-temporal criteria. GIS 2010: 202-211 - [i2]Mark de Berg, Jörg-Rüdiger Sack, Bettina Speckmann, Anne Driemel, Maike Buchin, Monika Sester, Marc J. van Kreveld:
10491 Results of the break-out group: Aggregation. Representation, Analysis and Visualization of Moving Objects 2010 - [i1]Anne Driemel, Sariel Har-Peled, Carola Wenk:
Approximating the Fréchet Distance for Realistic Curves in Near Linear Time. CoRR abs/1003.0460 (2010)
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-30 21:32 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:
