| Publication | Date of Publication | Type |
|---|
Reconfiguration of non-crossing spanning trees
Journal of Computational Geometry | 2024-12-19 | Paper |
| Drawings of complete multipartite graphs up to triangle flips | 2024-10-16 | Paper |
| Different types of isomorphisms of drawings of complete multipartite graphs | 2024-10-14 | Paper |
There is a unique crossing-minimal rectilinear drawing of \(K_{18}\)
Ars Mathematica Contemporanea | 2024-05-29 | Paper |
| Twisted ways to find plane structures in simple drawings of complete graphs | 2024-05-14 | Paper |
| Edge partitions of complete geometric graphs | 2024-05-14 | Paper |
| Bicolored order types | 2024-04-02 | Paper |
Towards crossing-free Hamiltonian cycles in simple drawings of complete graphs
(available as arXiv preprint) | 2024-04-02 | Paper |
Perfect matchings with crossings
Algorithmica | 2024-03-25 | Paper |
Straight skeletons for general polygonal figures in the plane
Lecture Notes in Computer Science | 2024-01-29 | Paper |
Twisted ways to find plane structures in simple drawings of complete graphs
Discrete & Computational Geometry | 2024-01-09 | Paper |
Flipping plane spanning paths
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
| Bichromatic Perfect Matchings with Crossings | 2023-09-01 | Paper |
Compatible spanning trees in simple drawings of \(K_n\)
Lecture Notes in Computer Science | 2023-08-16 | Paper |
Shooting stars in simple drawings of \(K_{m,n}\)
Lecture Notes in Computer Science | 2023-08-16 | Paper |
Disjoint compatibility via graph classes
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
Graphs with large total angular resolution
Theoretical Computer Science | 2023-01-05 | Paper |
Drawing graphs as spanners
Graph-Theoretic Concepts in Computer Science | 2022-12-21 | Paper |
On Compatible Matchings
Journal of Graph Algorithms and Applications | 2022-11-14 | Paper |
Geometric dominating sets -- a minimum version of the no-three-in-line problem
Computational Geometry | 2022-10-06 | Paper |
Drawing graphs as spanners
Discrete & Computational Geometry | 2022-09-16 | Paper |
| Perfect matchings with crossings | 2022-08-30 | Paper |
On crossing-families in planar point sets
Computational Geometry | 2022-06-13 | Paper |
| Geometric Dominating Sets | 2022-03-24 | Paper |
| Edge Partitions of Complete Geometric Graphs (Part 2) | 2021-12-15 | Paper |
On compatible matchings
(available as arXiv preprint) | 2021-10-04 | Paper |
Flip distances between graph orientations
Algorithmica | 2021-02-01 | Paper |
Folding polyominoes with holes into a cube
Computational Geometry | 2021-01-07 | Paper |
On the edge-vertex ratio of maximal thrackles
(available as arXiv preprint) | 2020-10-26 | Paper |
Graphs with large total angular resolution
Lecture Notes in Computer Science | 2020-10-26 | Paper |
On the 2-colored crossing number
(available as arXiv preprint) | 2020-10-26 | Paper |
An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants
Journal of Graph Algorithms and Applications | 2020-09-04 | Paper |
A superlinear lower bound on the number of 5-holes
Journal of Combinatorial Theory. Series A | 2020-03-20 | Paper |
Flip distances between graph orientations
Graph-Theoretic Concepts in Computer Science | 2020-02-24 | Paper |
Flip distances between graph orientations
Graph-Theoretic Concepts in Computer Science | 2020-02-24 | Paper |
Packing plane spanning graphs with short edges in complete geometric graphs
Computational Geometry | 2019-10-25 | Paper |
On the edge-vertex ratio of maximal thrackles
(available as arXiv preprint) | 2019-08-23 | Paper |
On the 2-colored crossing number
(available as arXiv preprint) | 2019-08-18 | Paper |
| Transformed flips in triangulations and matchings | 2019-07-20 | Paper |
Perfect \(k\)-colored matchings and \((k+2)\)-gonal tilings
Graphs and Combinatorics | 2019-01-11 | Paper |
Folding Polyominoes into (Poly)Cubes
International Journal of Computational Geometry & Applications | 2018-11-26 | Paper |
Quickest paths, straight skeletons, and the city Voronoi diagram
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
On the crossing number of complete graphs
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Bishellable drawings of $K_n$
SIAM Journal on Discrete Mathematics | 2018-11-19 | Paper |
Cross-sections of line configurations in \(\mathbb{R}^3\) and (\(d-2\))-flat configurations in \(\mathbb{R}^d\)
Computational Geometry | 2018-11-19 | Paper |
Holes in 2-convex point sets
Computational Geometry | 2018-10-31 | Paper |
A superlinear lower bound on the number of 5-holes
(available as arXiv preprint) | 2018-08-13 | Paper |
Holes in 2-convex point sets
Lecture Notes in Computer Science | 2018-06-15 | Paper |
Linear transformation distance for bichromatic matchings
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Packing short plane spanning trees in complete geometric graphs
(available as arXiv preprint) | 2018-04-19 | Paper |
Computing balanced islands in two colored point sets in the plane
Information Processing Letters | 2018-04-05 | Paper |
Modem illumination of monotone polygons
Computational Geometry | 2018-02-19 | Paper |
Modem illumination of monotone polygons
Computational Geometry | 2018-02-19 | Paper |
Linear transformation distance for bichromatic matchings
Computational Geometry | 2018-02-19 | Paper |
| An improved lower bound on the minimum number of triangulations | 2018-01-30 | Paper |
An optimal algorithm for reconstructing point set order types from radial orderings
International Journal of Computational Geometry & Applications | 2017-10-20 | Paper |
Abstract order type extension and new results on the rectilinear crossing number
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Divide-and-conquer for Voronoi diagrams revisited
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
Spatial embedding of pseudo-triangulations
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Enumerating order types for small sets with applications
Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Packing plane spanning trees and paths in complete geometric graphs
Information Processing Letters | 2017-06-13 | Paper |
Reconstructing Point Set Order Types from Radial Orderings
International Journal of Computational Geometry & Applications | 2017-05-19 | Paper |
Representing directed trees as straight skeletons
Lecture Notes in Computer Science | 2017-02-10 | Paper |
A note on the number of general 4-holes in (perturbed) grids
Lecture Notes in Computer Science | 2017-02-01 | Paper |
New results on MWT subgraphs
Information Processing Letters | 2016-06-16 | Paper |
Geometric achromatic and pseudoachromatic indices
Graphs and Combinatorics | 2016-06-13 | Paper |
3-colorability of pseudo-triangulations
International Journal of Computational Geometry & Applications | 2016-03-14 | Paper |
An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings
Algorithms and Computation | 2016-01-11 | Paper |
Embedding Four-directional Paths on Convex Point Sets
Journal of Graph Algorithms and Applications | 2016-01-07 | Paper |
On \(k\)-gons and \(k\)-holes in point sets
Computational Geometry | 2015-12-30 | Paper |
Flip distance between triangulations of a simple polygon is NP-complete
Discrete & Computational Geometry | 2015-12-02 | Paper |
Reconstructing point set order types from radial orderings
Algorithms and Computation | 2015-09-11 | Paper |
Geodesic-preserving polygon simplification
International Journal of Computational Geometry & Applications | 2015-07-01 | Paper |
Empty triangles in good drawings of the complete graph
Graphs and Combinatorics | 2015-05-22 | Paper |
Reprint of: Theta-3 is connected
Computational Geometry | 2015-04-27 | Paper |
Flips in combinatorial pointed pseudo-triangulations with face degree at most four
International Journal of Computational Geometry & Applications | 2015-04-22 | Paper |
Disjoint compatibility graph of non-crossing matchings of points in convex position
The Electronic Journal of Combinatorics | 2015-03-19 | Paper |
Disjoint compatibility graph of non-crossing matchings of points in convex position
The Electronic Journal of Combinatorics | 2015-03-19 | Paper |
Monotone simultaneous embeddings of upward planar digraphs
Journal of Graph Algorithms and Applications | 2015-03-04 | Paper |
| Cell-paths in mono- and bichromatic line arrangements in the plane | 2015-02-09 | Paper |
Shellable drawings and the cylindrical crossing number of \(K_n\)
Discrete & Computational Geometry | 2015-02-03 | Paper |
Triangulations with Circular Arcs
Journal of Graph Algorithms and Applications | 2015-01-27 | Paper |
Geodesic order types
Algorithmica | 2015-01-19 | Paper |
Embedding four-directional paths on convex point sets
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
Theta-3 is connected
Computational Geometry | 2014-08-13 | Paper |
The \(2\)-page crossing number of \(K_n\)
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Empty monochromatic simplices
Discrete & Computational Geometry | 2014-07-04 | Paper |
On \(k\)-convex point sets
Computational Geometry | 2014-06-27 | Paper |
4-holes in point sets
Computational Geometry | 2014-05-19 | Paper |
| scientific article; zbMATH DE number 6289002 (Why is no real title available?) | 2014-04-25 | Paper |
Lower bounds for the number of small convex \(k\)-holes
Computational Geometry | 2014-04-09 | Paper |
Flip graphs of bounded degree triangulations
Graphs and Combinatorics | 2014-02-14 | Paper |
Reprint of: Extreme point and halving edge search in abstract order types
Computational Geometry | 2014-01-22 | Paper |
Geodesic-preserving polygon simplification
Algorithms and Computation | 2014-01-14 | Paper |
| There is a unique crossing-minimal rectilinear drawing of \(K_{18}\) | 2013-11-01 | Paper |
Flip graphs of bounded-degree triangulations
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Flip distance between triangulations of a simple polygon is NP-complete
Lecture Notes in Computer Science | 2013-09-17 | Paper |
The 2-page crossing number of \(K_{n}\)
Discrete & Computational Geometry | 2013-08-05 | Paper |
Extreme point and halving edge search in abstract order types
Computational Geometry | 2013-07-31 | Paper |
Compatible Geometric Matchings
Electronic Notes in Discrete Mathematics | 2013-06-28 | Paper |
Shape spaces via medial axis transforms for segmentation of complex geometry in 3D voxel data
Inverse Problems and Imaging | 2013-06-12 | Paper |
| Extremal antipodal polygons and polytopes | 2013-01-28 | Paper |
On 5-gons and 5-holes
Lecture Notes in Computer Science | 2013-01-07 | Paper |
Convexifying monotone polygons while maintaining internal visibility
Lecture Notes in Computer Science | 2013-01-07 | Paper |
Blocking Delaunay triangulations
Computational Geometry | 2012-12-04 | Paper |
Geodesic order types
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Pointed drawings of planar graphs
Computational Geometry | 2012-09-21 | Paper |
On \(k\)-convex polygons
Computational Geometry | 2012-06-13 | Paper |
Triangulations with Circular Arcs
Graph Drawing | 2012-03-09 | Paper |
Exact medial axis computation for circular arc boundaries
Curves and Surfaces | 2012-01-13 | Paper |
Exact medial axis computation for triangulated solids with respect to piecewise linear metrics
Curves and Surfaces | 2012-01-13 | Paper |
Computational and structural advantages of circular boundary representation
International Journal of Computational Geometry & Applications | 2011-06-17 | Paper |
Large bichromatic point sets admit empty monochromatic 4-gons
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
Divide-and-conquer for Voronoi diagrams revisited
Computational Geometry | 2010-09-02 | Paper |
On the number of plane graphs
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
| Introduction to applied geometry | 2010-08-11 | Paper |
| Edge-removal and non-crossing configurations in geometric graphs | 2010-07-27 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Playing with triangulations
Lecture Notes in Computer Science | 2010-02-05 | Paper |
Transforming spanning trees and pseudo-triangulations
Information Processing Letters | 2009-12-18 | Paper |
New results on lower bounds for the number of \((\leq k)\)-facets
European Journal of Combinatorics | 2009-11-30 | Paper |
Empty monochromatic triangles
Computational Geometry | 2009-08-14 | Paper |
Compatible geometric matchings
Computational Geometry | 2009-07-27 | Paper |
Compatible geometric matchings
Computational Geometry | 2009-07-27 | Paper |
On minimum weight pseudo-triangulations
Computational Geometry | 2009-07-27 | Paper |
scientific article; zbMATH DE number 5555978 (Why is no real title available?)
(available as arXiv preprint) | 2009-05-22 | Paper |
Computational and Structural Advantages of Circular Boundary Representation
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Improved upper bounds on the reflexivity of point sets
Computational Geometry | 2009-02-12 | Paper |
| scientific article; zbMATH DE number 5506219 (Why is no real title available?) | 2009-02-10 | Paper |
New results on lower bounds for the number of (⩽ k)-facets
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Triangulations without pointed spanning trees
Computational Geometry | 2008-03-26 | Paper |
On the number of pseudo-triangulations of certain point sets
Journal of Combinatorial Theory. Series A | 2008-03-06 | Paper |
On the number of pseudo-triangulations of certain point sets
Journal of Combinatorial Theory. Series A | 2008-03-06 | Paper |
Pre-triangulations and liftable complexes
Discrete & Computational Geometry | 2008-02-18 | Paper |
Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
Graphs and Combinatorics | 2007-12-10 | Paper |
Gray code enumeration of plane straight-line graphs
Graphs and Combinatorics | 2007-12-10 | Paper |
New lower bounds for the number of \((\leq k)\)-edges and the rectilinear crossing number of \(K_{n}\)
Discrete & Computational Geometry | 2007-10-11 | Paper |
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles
Lecture Notes in Computer Science | 2007-09-05 | Paper |
On the number of plane geometric graphs
Graphs and Combinatorics | 2007-07-19 | Paper |
A quadratic distance bound on sliding between crossing-free spanning trees
Computational Geometry | 2007-06-04 | Paper |
Abstract order type extension and new results on the rectilinear crossing number
Computational Geometry | 2007-03-12 | Paper |
Connecting colored point sets
Discrete Applied Mathematics | 2007-03-02 | Paper |
On the crossing number of complete graphs
Computing | 2006-03-02 | Paper |
Games on triangulations
Theoretical Computer Science | 2005-10-26 | Paper |
ON FLIPS IN POLYHEDRAL SURFACES
International Journal of Foundations of Computer Science | 2005-06-22 | Paper |
A lower bound on the number of triangulations of planar point sets
Computational Geometry | 2004-10-01 | Paper |
Convexity minimizes pseudo-triangulations
Computational Geometry | 2004-08-06 | Paper |
Quickest paths, straight skeletons, and the city Voronoi diagram
Discrete & Computational Geometry | 2004-03-11 | Paper |
Pseudotriangulations from Surfaces and a Novel Type of Edge Flip
SIAM Journal on Computing | 2004-01-08 | Paper |
Towards compatible triangulations.
Theoretical Computer Science | 2003-08-17 | Paper |
Long proteins with unique optimal foldings in the H-P model
Computational Geometry | 2003-05-19 | Paper |
Flipturning Polygons
Discrete & Computational Geometry | 2003-03-17 | Paper |
Enumerating order types for small point sets with applications
Order | 2003-03-11 | Paper |
| scientific article; zbMATH DE number 1796958 (Why is no real title available?) | 2002-09-05 | Paper |
Sequences of spanning trees and a fixed tree theorem
Computational Geometry | 2002-09-03 | Paper |
Reconfiguring convex polygons
Computational Geometry | 2002-01-14 | Paper |
Constant-level greedy triangulations approximate the MWT well
Journal of Combinatorial Optimization | 2001-11-06 | Paper |
Generalized self-approaching curves
Discrete Applied Mathematics | 2001-04-04 | Paper |
| scientific article; zbMATH DE number 1538123 (Why is no real title available?) | 2000-12-03 | Paper |
| scientific article; zbMATH DE number 1516561 (Why is no real title available?) | 2000-10-11 | Paper |
| scientific article; zbMATH DE number 1419244 (Why is no real title available?) | 2000-05-11 | Paper |
SKEW VORONOI DIAGRAMS
International Journal of Computational Geometry & Applications | 2000-05-07 | Paper |
Matching Shapes with a Reference Point
International Journal of Computational Geometry & Applications | 1998-03-16 | Paper |
Triangulations intersect nicely
Discrete & Computational Geometry | 1997-02-18 | Paper |
Classifying Hyperplanes in Hypercubes
SIAM Journal on Discrete Mathematics | 1996-09-12 | Paper |
Folding polyominoes into cubes
(available as arXiv preprint) | N/A | Paper |
