Anne Driemel

Orcid: 0000-0002-1943-2589

Affiliations:
  • University of Bonn, Hausdorff Center for Mathematics, Bonn, Germany
  • TU Eindhoven, Department of Mathematics and Computer Science, The Netherlands
  • Dortmund Technical University, Department of Computer Science, Germany
  • Utrecht University, The Netherlands (PhD 2013)


According to our database1, Anne Driemel authored at least 56 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the number of iterations of the DBA algorithm.
CoRR, 2024

Range Reporting for Time Series via Rectangle Stabbing.
CoRR, 2024

Revisiting the Fréchet distance between piecewise smooth curves.
CoRR, 2024

(1+ε)-ANN Data Structure for Curves via Subspaces of Bounded Doubling Dimension.
Comput. Geom. Topol., 2024

2023
Approximating (<i>k,ℓ</i>)-Median Clustering for Polygonal Curves.
ACM Trans. Algorithms, January, 2023

Computational Geometry of Earth System Analysis (Dagstuhl Seminar 23342).
Dagstuhl Reports, 2023

Finding Complex Patterns in Trajectory Data via Geometric Set Cover.
CoRR, 2023

Simplified and Improved Bounds on the VC-Dimension for Elastic Distance Measures.
CoRR, 2023

Subtrajectory Clustering: Finding Set Covers for Set Systems of Subcurves.
Comput. Geom. Topol., 2023

Learning Depth Vision-Based Personalized Robot Navigation From Dynamic Demonstrations in Virtual Reality.
IROS, 2023

2022
Introduction to the Special Issue on ACM-SIAM Symposium on Discrete Algorithms (SODA) 2020.
ACM Trans. Algorithms, 2022

Analysis of a Greedy Heuristic for the Labeling of a Map with a Time-Window Interface.
CoRR, 2022

Approximating Length-Restricted Means Under Dynamic Time Warping.
Proceedings of the Approximation and Online Algorithms - 20th International Workshop, 2022

Pattern Matching Under DTW Distance.
Proceedings of the String Processing and Information Retrieval, 2022

Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Fréchet Distance.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

On Computing the k-Shortcut Fréchet Distance.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Faster Approximate Covering of Subcurves Under the Fréchet Distance.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

On the Discrete Fréchet Distance in a Graph.
Proceedings of the 38th International Symposium on Computational Geometry, 2022

Minimum-Error Triangulations for Sea Surface Reconstruction.
Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021
The VC Dimension of Metric Balls under Fréchet and Hausdorff Distances.
Discret. Comput. Geom., 2021

Computational Geometry (Dagstuhl Seminar 21181).
Dagstuhl Reports, 2021

Covering a Curve with Subtrajectories.
CoRR, 2021

ANN for Time Series Under the Fréchet Distance.
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Bicriteria Aggregation of Polygons via Graph Cuts.
Proceedings of the 11th International Conference on Geographic Information Science, 2021

2020
Spatio-Temporal Top-k Similarity Search for Trajectories in Graphs.
CoRR, 2020

Approximating (k, 𝓁)-Median Clustering for Polygonal Curves.
CoRR, 2020

(2+ε)-ANN for time series under the Fréchet distance.
CoRR, 2020

On the Hardness of Computing an Average Curve.
Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

2019
Computational Geometry (Dagstuhl Seminar 19181).
Dagstuhl Reports, 2019

Sublinear data structures for short Fréchet queries.
CoRR, 2019

FRESH: Fréchet Similarity with Hashing.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Approximating (k, ℓ)-center clustering for curves.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

klcluster: Center-based Clustering of Trajectories.
Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2019

The VC Dimension of Metric Balls Under Fréchet and Hausdorff Distances.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018
Analysing Large Collections of Time Series (NII Shonan Meeting 2018-3).
NII Shonan Meet. Rep., 2018

Approximating (k, 𝓁)-center clustering for curves.
CoRR, 2018

Probabilistic Embeddings of the Fréchet Distance.
Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

On the complexity of range searching among curves.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017
Computational Geometry (Dagstuhl Seminar 17171).
Dagstuhl Reports, 2017

Locality-Sensitive Hashing of Curves.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016
On the Expected Complexity of Voronoi Diagrams on Terrains.
ACM Trans. Algorithms, 2016

Segmentation of Trajectories on Nonmonotone Criteria.
ACM Trans. Algorithms, 2016

Clustering time series under the Fréchet distance.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015
Computing the Fréchet distance between folded polygons.
Comput. Geom., 2015

2014
Computing the Fréchet distance with shortcuts is NP-hard.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013
Realistic Analysis for Algorithmic Problems on Geographical Data.
PhD thesis, 2013

Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts.
SIAM J. Comput., 2013

Flow computations on imprecise terrains.
J. Comput. Geom., 2013

Segmentation of Trajectories for Non-Monotone Criteria.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012
Approximating the Fréchet Distance for Realistic Curves in Near Linear Time.
Discret. Comput. Geom., 2012

2011
Segmenting trajectories: A framework and algorithms using spatiotemporal criteria.
J. Spatial Inf. Sci., 2011

Flow Computations on Imprecise Terrains
CoRR, 2011

Computing the Fréchet Distance between Folded Polygons.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Approximate Map Matching with respect to the Fréchet Distance.
Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, 2011

2010
An algorithmic framework for segmenting trajectories based on spatio-temporal criteria.
Proceedings of the 18th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2010

10491 Results of the break-out group: Aggregation.
Proceedings of the Representation, Analysis and Visualization of Moving Objects, 05.12., 2010


  Loading...