| Publication | Date of Publication | Type |
|---|
| Edge-unfolding polycubes with orthogonally convex layers | 2025-11-14 | Paper |
Reconfiguration of non-crossing spanning trees
Journal of Computational Geometry | 2024-12-19 | Paper |
| Toward unfolding doubly covered \(n\)-stars | 2023-03-31 | Paper |
Unfolding \(3\)-separated polycube graphs of arbitrary genus
Computational Geometry | 2022-11-16 | Paper |
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers
(available as arXiv preprint) | 2022-05-11 | Paper |
Unfolding polycube trees with constant refinement
Computational Geometry | 2021-09-17 | Paper |
Universal reconfiguration of facet-connected modular robots by pivots: the \(O(1)\) musketeers
Algorithmica | 2021-04-19 | Paper |
Spanning properties of Theta-Theta-6
Graphs and Combinatorics | 2020-04-30 | Paper |
An infinite class of Sparse-Yao spanners
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
An infinite class of Sparse-Yao spanners
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
New and improved spanning ratios for Yao graphs
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Cone-based spanners of constant degree
Computational Geometry | 2018-02-19 | Paper |
Continuous Yao graphs
Computational Geometry | 2018-02-12 | Paper |
Unfolding genus-2 orthogonal polyhedra with linear refinement
Graphs and Combinatorics | 2017-12-12 | Paper |
Minimum forcing sets for Miura folding patterns
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Improved bounds on the stretch factor of \(Y_{4}\)
Computational Geometry | 2017-06-29 | Paper |
| New and improved spanning ratios for Yao graphs | 2017-03-30 | Paper |
On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere
(available as arXiv preprint) | 2017-03-30 | Paper |
Switching to directional antennas with constant increase in radius and hop distance
Algorithmica | 2017-03-27 | Paper |
| Minimal forcing sets for 1D origami | 2017-03-18 | Paper |
Spanning properties of theta-theta graphs
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Local approximation schemes for topology control
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
| Shape replication through self-assembly and RNase enzymes | 2014-05-22 | Paper |
Unfolding orthogonal polyhedra with quadratic refinement: the delta-unfolding algorithm
Graphs and Combinatorics | 2014-03-24 | Paper |
Spanning properties of graphs induced by directional antennas
Discrete Mathematics, Algorithms and Applications | 2013-11-26 | Paper |
Efficient reconfiguration of lattice-based modular robots
Computational Geometry | 2013-07-31 | Paper |
Distributed construction of low-interference spanners
Distributed Computing | 2013-06-28 | Paper |
Coverage with \(k\)-transmitters in the presence of obstacles
Journal of Combinatorial Optimization | 2013-03-25 | Paper |
| Connecting polygonizations via stretches and twangs | 2013-03-19 | Paper |
Establishing strong connectivity using optimal radius half-disk antennas
Computational Geometry | 2013-01-25 | Paper |
\(\pi /2\)-angle Xao graphs are spanners
International Journal of Computational Geometry & Applications | 2012-11-23 | Paper |
Yao graphs span theta graphs
Discrete Mathematics, Algorithms and Applications | 2012-10-15 | Paper |
Switching to directional antennas with constant increase in radius and hop distance
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Realistic reconfiguration of crystalline (and telecube) robots
Springer Tracts in Advanced Robotics | 2011-03-02 | Paper |
Coverage with \(k\)-transmitters in the presence of obstacles
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
Yao Graphs Span Theta Graphs
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
π/2-Angle Yao Graphs Are Spanners
Algorithms and Computation | 2010-12-09 | Paper |
Connecting polygonizations via stretches and twangs
Theory of Computing Systems | 2010-10-06 | Paper |
APX-hardness of domination problems in circle graphs
Information Processing Letters | 2009-12-18 | Paper |
Linear reconfiguration of cube-style modular robots
Computational Geometry | 2009-07-27 | Paper |
| scientific article; zbMATH DE number 5542495 (Why is no real title available?) | 2009-04-14 | Paper |
Linear Reconfiguration of Cube-Style Modular Robots
Algorithms and Computation | 2008-05-27 | Paper |
Unfolding Manhattan towers
Computational Geometry | 2008-04-28 | Paper |
Grid vertex-unfolding orthogonal polyhedra
Discrete & Computational Geometry | 2008-04-16 | Paper |
Grid Vertex-Unfolding Orthogonal Polyhedra
STACS 2006 | 2008-03-19 | Paper |
On corners of objects built from parallelepiped bricks
Computational Geometry | 2007-10-19 | Paper |
Efficient many-to-Many point matching in one dimension
Graphs and Combinatorics | 2007-07-19 | Paper |
Epsilon-unfolding orthogonal polyhedra
Graphs and Combinatorics | 2007-07-19 | Paper |
Computing optimal diameter-bounded polygon partitions
Algorithmica | 2004-10-01 | Paper |
Exact and approximation algorithms for computing optimal fat decompositions
Computational Geometry | 2004-08-06 | Paper |
