| Publication | Date of Publication | Type |
|---|
Stability analysis of kinetic orientation-based shape descriptors
CGT. Computing in Geometry and Topology | 2026-03-09 | Paper |
Graph drawing contest report
Lecture Notes in Computer Science | 2023-08-16 | Paper |
| Obstructing Classification via Projection | 2023-08-08 | Paper |
scientific article; zbMATH DE number 7662163 (Why is no real title available?)
(available as arXiv preprint) | 2023-03-10 | Paper |
| Competitive Searching for a Line on a Line Arrangement. | 2022-07-21 | Paper |
Convex polygons in Cartesian products
(available as arXiv preprint) | 2022-07-18 | Paper |
Graph drawing contest report
Lecture Notes in Computer Science | 2022-07-01 | Paper |
Graph Drawing Contest Report
Lecture Notes in Computer Science | 2021-12-01 | Paper |
Topological stability of kinetic \(k\)-centers
Theoretical Computer Science | 2021-04-14 | Paper |
| scientific article; zbMATH DE number 7324096 (Why is no real title available?) | 2021-03-17 | Paper |
Computing stable Demers cartograms
(available as arXiv preprint) | 2020-10-26 | Paper |
| Computing stable Demers cartograms | 2020-10-26 | Paper |
| Computing optimal homotopies over a spiked plane with polygonal boundary | 2020-05-27 | Paper |
| A framework for algorithm stability and its application to kinetic Euclidean MSTs | 2020-02-12 | Paper |
Topological stability of kinetic \(k\)-centers
WALCOM: Algorithms and Computation | 2019-10-15 | Paper |
Short plane supports for spatial hypergraphs
Journal of Graph Algorithms and Applications | 2019-09-16 | Paper |
Geometry and generation of a new graph planarity game
Journal of Graph Algorithms and Applications | 2019-09-16 | Paper |
Four Soviets walk the dog -- with an application to Alt's conjecture
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
The painter's problem: covering a grid with colored connected polygons
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Experimental analysis of the accessibility of drawings with few segments
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Short plane supports for spatial hypergraphs
(available as arXiv preprint) | 2019-02-15 | Paper |
Locally correct Fréchet matchings
Computational Geometry | 2018-11-16 | Paper |
Experimental analysis of the accessibility of drawings with few segments
Journal of Graph Algorithms and Applications | 2018-10-25 | Paper |
Drawing planar graphs with few geometric primitives
Journal of Graph Algorithms and Applications | 2018-09-06 | Paper |
| Folding free-space diagrams: computing the Fréchet distance between 1-dimensional curves | 2018-08-13 | Paper |
Mapping polygons to the grid with small Hausdorff and Fréchet distance
(available as arXiv preprint) | 2018-03-02 | Paper |
Drawing planar graphs with few geometric primitives
(available as arXiv preprint) | 2018-01-04 | Paper |
Four Soviets walk the dog: improved bounds for computing the Fréchet distance
Discrete & Computational Geometry | 2017-10-10 | Paper |
Drawing planar cubic 3-connected graphs with few segments: algorithms \& experiments
Journal of Graph Algorithms and Applications | 2017-05-16 | Paper |
Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments
Lecture Notes in Computer Science | 2017-02-10 | Paper |
A tale of two communities: assessing homophily in node-link diagrams
Lecture Notes in Computer Science | 2017-02-10 | Paper |
Computing the Fréchet distance with a retractable leash
Discrete & Computational Geometry | 2016-09-14 | Paper |
Computing the Fréchet distance with a retractable leash
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Locally correct Fréchet matchings
Lecture Notes in Computer Science | 2012-09-25 | Paper |
