| Publication | Date of Publication | Type |
|---|
| Approximate nearest neighbor for curves -- simple, efficient, and deterministic | 2026-03-18 | Paper |
| Minimum-complexity graph simplification under the Fréchet-like distance | 2026-01-13 | Paper |
| Robustly guarding polygons | 2025-11-24 | Paper |
| On two simple[st] learning tasks | 2025-11-11 | Paper |
Robustly guarding polygons
Journal of Computational Geometry | 2025-08-28 | Paper |
On flipping the Fréchet distance
Algorithmica | 2024-12-03 | Paper |
| On flipping the Fréchet distance | 2024-09-25 | Paper |
| Guarding polyominoes under \(k\)-hop visibility | 2024-05-31 | Paper |
Static and streaming data structures for Fréchet distance queries
(available as arXiv preprint) | 2024-01-15 | Paper |
A tour of general Hanoi graphs
Theoretical Computer Science | 2024-01-05 | Paper |
Approximate nearest neighbor for curves: simple, efficient, and deterministic
Algorithmica | 2023-04-28 | Paper |
Bipartite diameter and other measures under translation
Discrete & Computational Geometry | 2022-09-16 | Paper |
| scientific article; zbMATH DE number 7559117 (Why is no real title available?) | 2022-07-18 | Paper |
| A constant-factor approximation algorithm for vertex guarding a WV-polygon | 2022-05-13 | Paper |
A constant-factor approximation algorithm for vertex guarding a WV-polygon
(available as arXiv preprint) | 2022-03-22 | Paper |
| A constant-factor approximation algorithm for vertex guarding a WV-polygon | 2022-03-22 | Paper |
Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains
Computational Geometry | 2022-01-03 | Paper |
| Algorithms for the discrete Fréchet distance under translation | 2020-09-09 | Paper |
| scientific article; zbMATH DE number 7238975 (Why is no real title available?) | 2020-08-25 | Paper |
Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains
Approximation and Online Algorithms | 2020-08-24 | Paper |
Efficient nearest-neighbor query and clustering of planar curves
(available as arXiv preprint) | 2020-01-16 | Paper |
The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
ACM Transactions on Algorithms | 2018-10-30 | Paper |
The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
| On the general chain pair simplification problem | 2018-03-21 | Paper |
Universal approximate simplification under the discrete Fréchet distance
Information Processing Letters | 2018-03-16 | Paper |
Guarding orthogonal art galleries with sliding cameras
Computational Geometry | 2017-09-08 | Paper |
On the Chain Pair Simplification Problem
Lecture Notes in Computer Science | 2015-10-30 | Paper |
A (7/2)-approximation algorithm for guarding orthogonal art galleries with sliding cameras
Lecture Notes in Computer Science | 2014-03-31 | Paper |
