André Nusser

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

Dynamic time warping under translation: Approximation guided by space-filling curves.

[BibT_eX]

[DOI]

J. Comput. Geom., 2022

Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation.

[BibT_eX]

[DOI]

David Coudert

Laurent Viennot

ACM J. Exp. Algorithmics, 2022

Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Improvement via Offline Dynamic Rectangle Union.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Fréchet Distance.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Computing Continuous Dynamic Time Warping of Time Series in Polynomial Time.

[BibT_eX]

[DOI]

Kevin Buchin

Sampson Wong

Proceedings of the 38th International Symposium on Computational Geometry, 2022

Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

Computing Graph Hyperbolicity Using Dominating Sets.

[BibT_eX]

[DOI]

David Coudert

Laurent Viennot

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022

2021

Fine-grained complexity and algorithm engineering of geometric similarity measures.

[BibT_eX]

[DOI]

PhD thesis, 2021

Discrete Fréchet Distance under Translation: Conditional Hardness and an Improved Algorithm.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2021

Translating Hausdorff is hard: fine-grained lower bounds for Hausdorff distance under translation.

[BibT_eX]

[DOI]

J. Comput. Geom., 2021

Walking the dog fast in practice: Algorithm engineering of the Fréchet distance.

[BibT_eX]

[DOI]

J. Comput. Geom., 2021

The VC Dimension of Metric Balls under Fréchet and Hausdorff Distances.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2021

Phase transition of the 2-Choices dynamics on core-periphery networks.

[BibT_eX]

[DOI]

Distributed Comput., 2021

Hyperbolicity Computation through Dominating Sets.

[BibT_eX]

[DOI]

David Coudert

Laurent Viennot

CoRR, 2021

2020

(k, l)-Medians Clustering of Trajectories Using Continuous Dynamic Time Warping.

[BibT_eX]

[DOI]

Proceedings of the SIGSPATIAL '20: 28th International Conference on Advances in Geographic Information Systems, 2020

When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance Under Translation.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

PATHFINDER: Storage and Indexing of Massive Trajectory Sets.

[BibT_eX]

[DOI]

Proceedings of the 16th International Symposium on Spatial and Temporal Databases, 2019

Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

klcluster: Center-based Clustering of Trajectories.

[BibT_eX]

[DOI]

Kevin Buchin

Anne Driemel

Natasja van de L'Isle

Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2019

2018

On the Emergent Behavior of the 2-Choices Dynamics.

[BibT_eX]

[DOI]

Proceedings of the 19th Italian Conference on Theoretical Computer Science, 2018

2017

Growing Balls in ℝ<sup><i>d</i></sup>.

[BibT_eX]

[DOI]

Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

The Simultaneous Maze Solving Problem.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Placement of Loading Stations for Electric Vehicles: Allowing Small Detours.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, 2016

2015

Placement of Loading Stations for Electric Vehicles: No Detours Necessary!

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2015

2014

On k-Path Covers and their Applications.

[BibT_eX]

[DOI]