| Publication | Date of Publication | Type |
|---|
| Faster Fréchet distance under transformations | 2026-09-10 | Paper |
| Property testing of curve similarity | 2026-08-31 | Paper |
| Instance-optimal imprecise convex hull | 2026-08-31 | Paper |
| Computing oriented spanners and their dilation | 2026-08-11 | Paper |
| Spanner for the 0/1/ weighted region problem | 2026-08-11 | Paper |
| A WSPD, separator and small tree cover for c-packed graphs | 2026-08-11 | Paper |
| Data structures for approximate Fréchet distance for realistic curves | 2026-06-08 | Paper |
| Approximating the Fréchet distance when only one curve is c-packed | 2026-06-08 | Paper |
| Bicriteria approximation for minimum dilation graph augmentation | 2026-05-26 | Paper |
Oriented spanners
Algorithmica | 2025-12-30 | Paper |
| Dynamic L-budget clustering of curves | 2025-12-02 | Paper |
| Approximating multiplicatively weighted Voronoi diagrams: efficient construction with linear size | 2025-11-24 | Paper |
| Map-matching queries under Fréchet distance on low-density spanners | 2025-11-24 | Paper |
The tight spanning ratio of the rectangle Delaunay triangulation
Algorithmica | 2025-08-29 | Paper |
| Computing a subtrajectory cluster from c-packed trajectories | 2025-07-24 | Paper |
Map matching queries on realistic input graphs under the Fréchet distance
ACM Transactions on Algorithms | 2025-02-21 | Paper |
| Oriented spanners | 2025-01-06 | Paper |
| The tight spanning ratio of the rectangle Delaunay triangulation | 2025-01-06 | Paper |
| Approximating the -low-density value | 2024-08-22 | Paper |
| Cubic upper and lower bounds for subtrajectory clustering under the continuous Fréchet distance | 2024-07-19 | Paper |
| Computing continuous dynamic time warping of time series in polynomial time | 2024-05-14 | Paper |
| Map matching queries on realistic input graphs under the Fréchet distance | 2024-05-14 | Paper |
| Improving the dilation of a metric graph by adding edges | 2024-01-15 | Paper |
Approximating the Packedness of Polygonal Curves
(available as arXiv preprint) | 2023-11-14 | Paper |
Improving the Dilation of a Metric Graph by Adding Edges
ACM Transactions on Algorithms | 2023-10-31 | Paper |
Covering a set of line segments with a few squares
Lecture Notes in Computer Science | 2023-03-22 | Paper |
Approximating the packedness of polygonal curves
Computational Geometry | 2022-10-06 | Paper |
Covering a set of line segments with a few squares
Theoretical Computer Science | 2022-06-13 | Paper |
Translation invariant Fréchet distance queries
Algorithmica | 2021-11-19 | Paper |
| An algorithm for the Euclidean cell decomposition of a non-compact strictly convex projective surface | 2017-03-30 | Paper |
| An algorithm for the Euclidean cell decomposition of a cusped strictly convex projective surface | 2015-12-05 | Paper |
