| Publication | Date of Publication | Type |
|---|
Compacting squares: input-sensitive in-place reconfiguration of sliding squares
| 2024-05-27 | Paper |
Pushing blocks by sweeping lines
| 2024-05-16 | Paper |
Complexity of simple folding of mixed orthogonal crease patterns
| 2024-04-09 | Paper |
scientific article; zbMATH DE number 7779759 (Why is no real title available?)
| 2023-12-16 | Paper |
Reconfiguration of connected graph partitions
Journal of Graph Theory | 2023-10-05 | Paper |
When Can You Tile an Integer Rectangle with Integer Squares?
| 2023-08-29 | Paper |
Negative instance for the edge patrolling beacon problem
| 2023-03-31 | Paper |
Toward unfolding doubly covered \(n\)-stars
| 2023-03-31 | Paper |
The Minimum Moving Spanning Tree Problem
Journal of Graph Algorithms and Applications | 2023-03-30 | Paper |
Reconfiguration of connected graph partitions via recombination
Lecture Notes in Computer Science | 2023-03-22 | Paper |
scientific article; zbMATH DE number 7662168 (Why is no real title available?)
| 2023-03-10 | Paper |
Distance Measures for Embedded Graphs
| 2023-02-03 | Paper |
How to fit a tree in a box
Graphs and Combinatorics | 2022-09-28 | Paper |
scientific article; zbMATH DE number 7559209 (Why is no real title available?)
| 2022-07-18 | Paper |
Reconfiguration of connected graph partitions via recombination
Theoretical Computer Science | 2022-06-13 | Paper |
On the spanning and routing ratios of the directed \(\Theta_6\)-graph
Computational Geometry | 2022-06-13 | Paper |
Circumscribing polygons and polygonizations for disjoint line segments
Discrete & Computational Geometry | 2022-06-03 | Paper |
Unfolding simple folds from crease patterns
Origami⁶ | 2022-05-24 | Paper |
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers
| 2022-05-11 | Paper |
Ununfoldable polyhedra with \(6\) vertices or \(6\) faces
Computational Geometry | 2022-04-08 | Paper |
On the spanning and routing ratios of the directed \(\varTheta_6\)-graph
| 2022-03-25 | Paper |
The minimum moving spanning tree problem
| 2022-03-25 | Paper |
Snipperclips: cutting tools into desired polygons using themselves
Computational Geometry | 2021-09-17 | Paper |
Distance measures for embedded graphs
Computational Geometry | 2021-09-16 | Paper |
Maximum area axis-aligned square packings
| 2021-08-04 | Paper |
Universal reconfiguration of facet-connected modular robots by pivots: the \(O(1)\) musketeers
Algorithmica | 2021-04-19 | Paper |
Folding polyominoes with holes into a cube
Computational Geometry | 2021-01-07 | Paper |
Face flips in origami tessellations
| 2020-11-12 | Paper |
Rigid foldability is NP-hard
| 2020-09-09 | Paper |
Multi-colored spanning graphs
Theoretical Computer Science | 2020-08-03 | Paper |
The reach of axis-aligned squares in the plane
Discrete Optimization | 2020-07-30 | Paper |
Escaping a Polygon
| 2020-07-17 | Paper |
Infinite all-layers simple foldability
Graphs and Combinatorics | 2020-04-03 | Paper |
Recognizing Weak Embeddings of Graphs
ACM Transactions on Algorithms | 2019-12-02 | Paper |
Minimum weight connectivity augmentation for planar straight-line graphs
Theoretical Computer Science | 2019-09-10 | Paper |
Upward partitioned book embeddings
Lecture Notes in Computer Science | 2019-02-20 | Paper |
How to fit a tree in a box
Lecture Notes in Computer Science | 2019-02-15 | Paper |
Reconstruction of Weakly Simple Polygons from Their Edges
International Journal of Computational Geometry & Applications | 2018-08-02 | Paper |
Reconstruction of weakly simple polygons from their edges
| 2018-04-19 | Paper |
Recognizing weak embeddings of graphs
| 2018-03-15 | Paper |
Pachinko
Computational Geometry | 2018-02-19 | Paper |
Recognizing weakly simple polygons
| 2018-01-30 | Paper |
Recognizing weakly simple polygons
Discrete & Computational Geometry | 2018-01-11 | Paper |
Minimum weight connectivity augmentation for planar straight-line graphs
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
Multi-colored spanning graphs
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Box pleating is hard
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Super Guarding and Dark Rays in Art Galleries
| N/A | Paper |
