| Publication | Date of Publication | Type |
|---|
A superlinear lower bound on the number of 5-holes
Journal of Combinatorial Theory. Series A | 2020-03-20 | Paper |
Packing plane spanning graphs with short edges in complete geometric graphs
Computational Geometry | 2019-10-25 | 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 |
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 |
Divide-and-conquer for Voronoi diagrams revisited
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
Packing plane spanning trees and paths in complete geometric graphs
Information Processing Letters | 2017-06-13 | 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 |
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 |
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 |
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 |
Flips in combinatorial pointed pseudo-triangulations with face degree at most four
International Journal of Computational Geometry & Applications | 2015-04-22 | 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 |
Embedding four-directional paths on convex point sets
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-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 |
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 |
Geodesic-preserving polygon simplification
Algorithms and Computation | 2014-01-14 | Paper |
Flip graphs of bounded-degree triangulations
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Coloring hypergraphs induced by dynamic point sets and bottomless rectangles
Lecture Notes in Computer Science | 2013-08-12 | Paper |
On 5-gons and 5-holes
Lecture Notes in Computer Science | 2013-01-07 | Paper |
Blocking Delaunay triangulations
Computational Geometry | 2012-12-04 | Paper |
Exact medial axis computation for circular arc boundaries
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 |
| Edge-removal and non-crossing configurations in geometric graphs | 2010-07-27 | Paper |
Empty monochromatic triangles
Computational Geometry | 2009-08-14 | Paper |
On minimum weight pseudo-triangulations
Computational Geometry | 2009-07-27 | Paper |
Computational and Structural Advantages of Circular Boundary Representation
Lecture Notes in Computer Science | 2009-02-17 | Paper |
| scientific article; zbMATH DE number 5506219 (Why is no real title available?) | 2009-02-10 | Paper |
Pre-triangulations and liftable complexes
Discrete & Computational Geometry | 2008-02-18 | Paper |
On the number of plane geometric graphs
Graphs and Combinatorics | 2007-07-19 | Paper |
Connecting colored point sets
Discrete Applied Mathematics | 2007-03-02 | Paper |
