| Publication | Date of Publication | Type |
|---|
| Coordinated motion planning: multi-agent path finding in a densely packed, bounded domain | 2026-06-08 | Paper |
| Packing squares into a disk with optimal worst-case density | 2026-04-27 | Paper |
Worst-case optimal covering of triangles by disks
CGT. Computing in Geometry and Topology | 2025-10-21 | Paper |
| The lawn mowing problem: from algebra to algorithms | 2025-01-06 | Paper |
Worst-case optimal covering of rectangles by disks
Discrete & Computational Geometry | 2024-10-25 | Paper |
| Efficiently reconfiguring a connected swarm of labeled robots | 2024-09-11 | Paper |
| The dispersive art gallery problem | 2024-09-11 | Paper |
| A closer cut: computing near-optimal lawn mowing tours | 2024-05-24 | Paper |
| Space ants: Episode II -- coordinating connected catoms (media exposition) | 2024-05-14 | Paper |
scientific article; zbMATH DE number 7788582 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
The dispersive art gallery problem
Computational Geometry | 2023-11-23 | Paper |
Worst-case optimal covering of rectangles by disks
(available as arXiv preprint) | 2023-11-02 | Paper |
| Space ants: constructing and reconfiguring large-scale structures with finite automata (media exposition) | 2023-11-02 | Paper |
| Covering rectangles by disks: the video (media exposition) | 2023-11-02 | Paper |
Packing disks into disks with optimal worst-case density
Discrete & Computational Geometry | 2023-01-23 | Paper |
| Worst-case optimal squares packing into disks | 2022-10-31 | Paper |
Connected reconfiguration of lattice-based cellular structures by finite-memory robots
Algorithmica | 2022-10-06 | Paper |
Particle-based assembly using precise global control
Algorithmica | 2022-10-06 | Paper |
| Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition) | 2022-07-18 | Paper |
scientific article; zbMATH DE number 7559235 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
The prefix Fréchet similarity
Computational Geometry | 2022-04-08 | Paper |
Particle-based assembly using precise global control
Lecture Notes in Computer Science | 2022-03-25 | Paper |
Connected reconfiguration of lattice-based cellular structures by finite-memory robots
Algorithms for Sensor Systems | 2021-07-08 | Paper |
CADbots: algorithmic aspects of manipulating programmable matter with finite automata
Algorithmica | 2021-02-01 | Paper |
Tilt assembly: algorithms for micro-factories that build objects with uniform external forces
(available as arXiv preprint) | 2020-11-25 | Paper |
| Coordinated motion planning: the video (multimedia exposition) | 2020-08-18 | Paper |
| Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch | 2020-08-18 | Paper |
| Train scheduling: hardness and algorithms | 2020-07-22 | Paper |
Tilt assembly: algorithms for micro-factories that build objects with uniform external forces
Algorithmica | 2020-04-09 | Paper |
Don't rock the boat: algorithms for balanced dynamic loading and unloading
(available as arXiv preprint) | 2020-02-12 | Paper |
Online circle packing
(available as arXiv preprint) | 2020-01-16 | Paper |
| Approximate shortest distances among smooth obstacles in 3D | 2020-01-13 | Paper |
Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
SIAM Journal on Computing | 2019-12-09 | Paper |
The Prefix Fréchet Similarity
WALCOM: Algorithms and Computation | 2019-10-15 | Paper |
Split packing: algorithms for packing circles with optimal worst-case density
Discrete & Computational Geometry | 2019-03-13 | Paper |
Conflict-free coloring of graphs
SIAM Journal on Discrete Mathematics | 2018-11-28 | Paper |
Approximating the integral Fréchet distance
Computational Geometry | 2018-10-31 | Paper |
Path refinement in weighted regions
Algorithmica | 2018-10-18 | Paper |
Universal guard problems
International Journal of Computational Geometry & Applications | 2018-08-02 | Paper |
Three colors suffice: conflict-free coloring of planar graphs
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Approximate shortest distances among smooth obstacles in 3D | 2018-04-19 | Paper |
Universal guard problems
(available as arXiv preprint) | 2018-04-19 | Paper |
| Approximating the integral Fréchet distance | 2017-10-17 | Paper |
| Split packing: packing circles into triangles with optimal worst-case density | 2017-09-22 | Paper |
New geometric algorithms for fully connected staged self-assembly
Theoretical Computer Science | 2017-05-18 | Paper |
| Near-linear time medial axis approximation of smooth curves in \(\mathbb{R}^3\) | 2017-03-30 | Paper |
| Subquadratic medial-axis approximation in \(\mathbb{R}^3\) | 2017-03-30 | Paper |
More flexible curve matching via the partial Fréchet similarity
International Journal of Computational Geometry & Applications | 2016-05-27 | Paper |
New geometric algorithms for fully connected staged self-assembly
Lecture Notes in Computer Science | 2015-09-30 | Paper |
| Approximation algorithms for geometrical distance problems that are not solvable exactly | 2014-09-26 | Paper |
Approximating geodesic distances on 2-manifolds in \(\mathbb{R}^3\): The weighted case
Computational Geometry | 2014-06-27 | Paper |
Similarity of polygonal curves in the presence of outliers
Computational Geometry | 2014-04-09 | Paper |
Approximating geodesic distances on 2-manifolds in image R^3
Computational Geometry | 2014-01-22 | Paper |
