| Publication | Date of Publication | Type |
|---|
On the crossing number of 2-page book drawings of \(K_n\) with prescribed number of edges in each page
Graphs and Combinatorics | 2020-04-03 | Paper |
Decomposition of multiple coverings into more parts
| 2019-05-06 | Paper |
Bishellable drawings of $K_n$
SIAM Journal on Discrete Mathematics | 2018-11-19 | Paper |
Holes in 2-convex point sets
Computational Geometry | 2018-10-31 | Paper |
Holes in 2-convex point sets
Lecture Notes in Computer Science | 2018-06-15 | Paper |
Empty triangles in good drawings of the complete graph
Graphs and Combinatorics | 2015-05-22 | Paper |
Shellable drawings and the cylindrical crossing number of \(K_n\)
Discrete \& Computational Geometry | 2015-02-03 | Paper |
The \(2\)-page crossing number of \(K_n\)
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
On \(k\)-convex point sets
Computational Geometry | 2014-06-27 | Paper |
Flip graphs of bounded degree triangulations
Graphs and Combinatorics | 2014-02-14 | Paper |
Flip graphs of bounded-degree triangulations
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
The 2-page crossing number of \(K_{n}\)
Discrete \& Computational Geometry | 2013-08-05 | Paper |
Blocking Delaunay triangulations
Computational Geometry | 2012-12-04 | Paper |
On \(k\)-convex polygons
Computational Geometry | 2012-06-13 | Paper |
Decomposition of multiple coverings into more parts
Discrete \& Computational Geometry | 2010-11-08 | Paper |
The number of generalized balanced lines
Discrete \& Computational Geometry | 2010-11-08 | Paper |
On structural and graph theoretic properties of higher order Delaunay graphs
International Journal of Computational Geometry & Applications | 2010-02-12 | Paper |
New results on lower bounds for the number of \((\leq k)\)-facets
European Journal of Combinatorics | 2009-11-30 | Paper |
scientific article; zbMATH DE number 5555978 (Why is no real title available?)
| 2009-05-22 | Paper |
Balanced lines in two-coloured point sets
| 2009-05-20 | Paper |
Depth of segments and circles through points enclosing many points: A note
Computational Geometry | 2009-03-09 | Paper |
New results on lower bounds for the number of (⩽ k)-facets
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
On local transformations in plane geometric graphs embedded on small grids
Computational Geometry | 2007-12-03 | 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 |
Computational Science and Its Applications – ICCSA 2004
Lecture Notes in Computer Science | 2007-07-19 | Paper |
The maximin line problem with regional demand
European Journal of Operational Research | 2007-03-27 | Paper |
Separability by two lines and by nearly straight polygonal chains
Discrete Applied Mathematics | 2004-11-12 | Paper |
COMPUTING ROUNDNESS IS EASY IF THE SET IS ALMOST ROUND
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
MINIMAL SET OF CONSTRAINTS FOR 2D CONSTRAINED DELAUNAY RECONSTRUCTION
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
Structural tolerance and Delaunay triangulation
Information Processing Letters | 2002-07-25 | Paper |
Separating objects in the plane by wedges and strips
Discrete Applied Mathematics | 2001-04-04 | Paper |
A unified approach to conic visibility
Algorithmica | 2000-12-03 | Paper |
Bipartite embeddings of trees in the plane
Discrete Applied Mathematics | 1999-08-02 | Paper |
Fitting a set of points by a circle
Discrete \& Computational Geometry | 1998-12-02 | Paper |
