| Publication | Date of Publication | Type |
|---|
| Faster Fréchet distance under transformations | 2026-09-10 | Paper |
| Transforming dogs on the line: on the Fréchet distance under translation or scaling in 1D | 2026-08-11 | Paper |
| Approximating Klee's measure problem and a lower bound for union volume estimation | 2026-08-11 | Paper |
| Computing non-obtuse triangulations with few Steiner points (CG challenge) | 2026-08-11 | Paper |
| Fully-adaptive dynamic connectivity of square intersection graphs | 2026-05-12 | Paper |
| Translating Hausdorff is hard: fine-grained lower bounds for Hausdorff distance under translation | 2026-04-27 | Paper |
Constructing concise convex covers via clique covers
CGT. Computing in Geometry and Topology | 2026-03-09 | Paper |
Minimum star partitions of simple polygons in polynomial time
TheoretiCS | 2026-02-13 | Paper |
| Clustering with few disks to minimize the sum of radii | 2025-11-24 | Paper |
| Constructing concise convex covers via clique covers (CG challenge) | 2024-10-16 | Paper |
| Tight bounds for approximate near neighbor searching for time series under the Fréchet distance | 2024-07-19 | Paper |
| Polygon placement revisited: (degree of freedom + 1)-SUM hardness and an improvement via offline dynamic rectangle union | 2024-07-19 | Paper |
| Computing graph hyperbolicity using dominating sets | 2024-05-24 | Paper |
| Dynamic time warping under translation: approximation guided by space-filling curves | 2024-05-14 | Paper |
| Towards sub-quadratic diameter computation in geometric intersection graphs | 2024-05-14 | Paper |
| Computing continuous dynamic time warping of time series in polynomial time | 2024-05-14 | Paper |
Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation
ACM Journal of Experimental Algorithmics | 2024-04-14 | Paper |
Dynamic time warping under translation: approximation guided by space-filling curves
(available as arXiv preprint) | 2023-12-20 | Paper |
| Dynamic time warping under translation: approximation guided by space-filling curves | 2023-12-20 | Paper |
When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation
(available as arXiv preprint) | 2023-02-07 | Paper |
scientific article; zbMATH DE number 7610223 (Why is no real title available?)
(available as arXiv preprint) | 2022-10-31 | Paper |
| Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance | 2022-07-18 | Paper |
Discrete Fréchet Distance under Translation
ACM Transactions on Algorithms | 2022-02-16 | Paper |
The VC dimension of metric balls under Fréchet and Hausdorff distances
Discrete & Computational Geometry | 2021-11-18 | Paper |
Walking the dog fast in practice: algorithm engineering of the Fréchet distance
(available as arXiv preprint) | 2021-09-07 | Paper |
Phase transition of the 2-choices dynamics on core-periphery networks
Distributed Computing | 2021-09-06 | Paper |
Fréchet distance under translation: conditional hardness and an algorithm via offline dynamic grid reachability
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Growing balls in \(\mathbb{R}^d\)
2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Placement of loading stations for electric vehicles: no detours necessary!
Journal of Artificial Intelligence Research | 2015-08-25 | Paper |
