| Publication | Date of Publication | Type |
|---|
| Reconfiguration of polygonal subdivisions via recombination | 2025-01-06 | Paper |
Reconfiguration of connected graph partitions
Journal of Graph Theory | 2023-10-05 | Paper |
Reconfiguration of connected graph partitions via recombination
Lecture Notes in Computer Science | 2023-03-22 | Paper |
Combinatorial complexity of signed discs
Lecture Notes in Computer Science | 2023-01-18 | 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 |
Circumscribing polygons and polygonizations for disjoint line segments
Discrete & Computational Geometry | 2022-06-03 | Paper |
Circumscribing polygons and polygonizations for disjoint line segments
Discrete & Computational Geometry | 2022-06-03 | Paper |
Minimum weight connectivity augmentation for planar straight-line graphs
Theoretical Computer Science | 2019-09-10 | Paper |
Planar minimally rigid graphs and pseudo-triangulations
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Minimum weight connectivity augmentation for planar straight-line graphs
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
The flip diameter of rectangulations and convex subdivisions
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2017-03-03 | Paper |
| Algorithms for designing pop-up cards | 2017-01-30 | Paper |
Diffuse reflection diameter in simple polygons
Discrete Applied Mathematics | 2016-06-22 | Paper |
Bichromatic compatible matchings
Computational Geometry | 2015-07-27 | Paper |
Isoperimetric enclosures
Graphs and Combinatorics | 2015-05-22 | Paper |
Bichromatic compatible matchings
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
The flip diameter of rectangulations and convex subdivisions
Lecture Notes in Computer Science | 2014-03-31 | Paper |
Disjoint compatible geometric matchings
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
Constrained tri-connected planar straight line graphs
Thirty Essays on Geometric Graph Theory | 2013-09-25 | Paper |
Compatible Geometric Matchings
Electronic Notes in Discrete Mathematics | 2013-06-28 | Paper |
Coverage with \(k\)-transmitters in the presence of obstacles
Journal of Combinatorial Optimization | 2013-03-25 | Paper |
Disjoint compatible geometric matchings
Discrete & Computational Geometry | 2013-03-18 | Paper |
Simultaneously flippable edges in triangulations
Lecture Notes in Computer Science | 2013-01-07 | Paper |
Bounded-degree polyhedronization of point sets
Computational Geometry | 2012-12-04 | Paper |
Augmenting the edge connectivity of planar straight line graphs to three
Algorithmica | 2011-12-14 | Paper |
Coverage with \(k\)-transmitters in the presence of obstacles
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
Cuttings for disks and axis-aligned rectangles in three-space
Discrete & Computational Geometry | 2010-03-04 | Paper |
Tri-edge-connectivity augmentation for planar straight line graphs
Algorithms and Computation | 2009-12-17 | Paper |
Compatible geometric matchings
Computational Geometry | 2009-07-27 | Paper |
Compatible geometric matchings
Computational Geometry | 2009-07-27 | Paper |
A vertex-face assignment for plane graphs
Computational Geometry | 2009-06-18 | Paper |
Topological sweep of the complete graph
Discrete Applied Mathematics | 2009-03-04 | Paper |
Cuttings for Disks and Axis-Aligned Rectangles
Lecture Notes in Computer Science | 2009-02-17 | Paper |
| Tight bounds for connecting sites across barriers | 2009-02-10 | Paper |
Deflating the Pentagon
Computational Geometry and Graph Theory | 2009-01-13 | Paper |
Tight bounds for connecting sites across barriers
Discrete & Computational Geometry | 2008-12-02 | Paper |
Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
Natural Computing | 2008-09-02 | Paper |
Testing simple polygons.
Computational Geometry | 2008-04-25 | Paper |
Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues
DNA Computing | 2008-04-04 | Paper |
Efficient many-to-Many point matching in one dimension
Graphs and Combinatorics | 2007-07-19 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
| Computational geometry and statistical depth measures | 2006-04-28 | Paper |
Planar minimally rigid graphs and pseudo-triangulations
Computational Geometry | 2005-05-04 | Paper |
| scientific article; zbMATH DE number 1926667 (Why is no real title available?) | 2003-06-11 | Paper |
| Fast implementation of depth contours using topological sweep | 2002-03-24 | Paper |
The Floodlight Problem
International Journal of Computational Geometry & Applications | 1997-07-27 | Paper |
Combinatorial complexity of signed discs
Computational Geometry | 1996-11-10 | Paper |
An efficient algorithm for guard placement in polygons with holes
Discrete & Computational Geometry | 1995-03-20 | Paper |
| scientific article; zbMATH DE number 432849 (Why is no real title available?) | 1993-10-20 | Paper |
On compatible triangulations of simple polygons
Computational Geometry | 1993-08-23 | Paper |
Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions
SIAM Journal on Computing | 1992-12-14 | Paper |
Detecting the intersection of convex objects in the plane
Computer Aided Geometric Design | 1992-06-28 | Paper |
| Computing Least Median of Squares Regression Lines and Guided Topological Sweep | 1990-01-01 | Paper |
Computational geometry in a curved world
Algorithmica | 1990-01-01 | Paper |
Decomposition and intersection of simple splinegons
Algorithmica | 1988-01-01 | Paper |
| Time- and Space-Efficient Algorithms for Least Median of Squares Regression | 1987-01-01 | Paper |
