| Publication | Date of Publication | Type |
|---|
Cross-sections of line configurations in \(\mathbb{R}^3\) and (\(d-2\))-flat configurations in \(\mathbb{R}^d\)
Computational Geometry | 2018-11-19 | Paper |
Pachinko
Computational Geometry | 2018-02-19 | Paper |
Pachinko
Computational Geometry | 2018-02-19 | Paper |
Colored ray configurations
Computational Geometry | 2018-02-19 | Paper |
Colored ray configurations
Computational Geometry | 2018-02-19 | Paper |
Colored spanning graphs for set visualization
Computational Geometry | 2018-02-19 | Paper |
Colored spanning graphs for set visualization
Computational Geometry | 2018-02-19 | Paper |
Separating point sets in polygonal environments
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Geodesic ham-sandwich cuts
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
| On contractible edges in convex decompositions | 2017-09-18 | Paper |
Distance 2-domination in prisms of graphs
Discussiones Mathematicae Graph Theory | 2017-04-12 | Paper |
Necklaces, convolutions, and \(X+Y\)
Algorithmica | 2017-03-27 | Paper |
Configurations of non-crossing rays and related problems
Discrete & Computational Geometry | 2016-05-12 | Paper |
Proximity drawings of high-degree trees
International Journal of Computational Geometry & Applications | 2015-12-22 | Paper |
Blocking the \(k\)-holes of point sets in the plane
Graphs and Combinatorics | 2015-09-24 | Paper |
TERRAIN VISIBILITY WITH MULTIPLE VIEWPOINTS
International Journal of Computational Geometry & Applications | 2015-07-01 | Paper |
Geometric biplane graphs. I: Maximal graphs
Graphs and Combinatorics | 2015-05-22 | Paper |
Geometric biplane graphs. II: Graph augmentation
Graphs and Combinatorics | 2015-05-22 | Paper |
Stabbing simplices of point sets with \(k\)-flats
International Journal of Computational Geometry & Applications | 2015-04-22 | Paper |
Bichromatic 2-center of pairs of points
Computational Geometry | 2015-03-06 | Paper |
| Cell-paths in mono- and bichromatic line arrangements in the plane | 2015-02-09 | Paper |
Scandinavian thins on top of cake: new and improved algorithms for stacking and packing
Theory of Computing Systems | 2015-01-21 | Paper |
Balanced partitions of 3-colored geometric sets in the plane
Discrete Applied Mathematics | 2014-12-05 | Paper |
Witness rectangle graphs
Graphs and Combinatorics | 2014-09-19 | Paper |
On \(k\)-convex point sets
Computational Geometry | 2014-06-27 | Paper |
Mutual witness proximity graphs
Information Processing Letters | 2014-06-23 | Paper |
Compatible spanning trees
Computational Geometry | 2014-04-09 | Paper |
scientific article; zbMATH DE number 6257577 (Why is no real title available?)
(available as arXiv preprint) | 2014-02-14 | Paper |
| scientific article; zbMATH DE number 6257577 (Why is no real title available?) | 2014-02-14 | Paper |
Draining a polygon-or-rolling a ball out of a polygon
Computational Geometry | 2014-01-22 | Paper |
Terrain visibility with multiple viewpoints
Algorithms and Computation | 2014-01-14 | Paper |
Colored spanning graphs for set visualization
Graph Drawing | 2013-12-20 | Paper |
Plane geometric graph augmentation: a generic perspective
Thirty Essays on Geometric Graph Theory | 2013-09-25 | Paper |
Witness Gabriel graphs
Computational Geometry | 2013-08-22 | Paper |
Witness Gabriel graphs
Computational Geometry | 2013-08-22 | Paper |
Proximity graphs inside large weighted graphs
Networks | 2013-08-06 | Paper |
Compatible Geometric Matchings
Electronic Notes in Discrete Mathematics | 2013-06-28 | Paper |
A Polynomial Bound for Untangling Geometric Planar Graphs
Electronic Notes in Discrete Mathematics | 2013-06-28 | Paper |
Proximity graphs: {\(E, \delta\)}, {\(\Delta\)}, {\(\chi\)} and {\(\omega\)}
International Journal of Computational Geometry & Applications | 2013-06-24 | Paper |
IMPROVING SHORTEST PATHS IN THE DELAUNAY TRIANGULATION
International Journal of Computational Geometry & Applications | 2013-06-24 | Paper |
Coverage with \(k\)-transmitters in the presence of obstacles
Journal of Combinatorial Optimization | 2013-03-25 | Paper |
Universal point subsets for planar graphs
Algorithms and Computation | 2013-03-21 | Paper |
Token graphs
Graphs and Combinatorics | 2012-12-27 | Paper |
Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs
Computational Geometry | 2012-12-04 | Paper |
Non-crossing matchings of points with geometric objects
Computational Geometry | 2012-10-12 | Paper |
Coverage restricted to an angle
Operations Research Letters | 2012-07-13 | Paper |
Bichromatic 2-center of pairs of points
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
On \(k\)-convex polygons
Computational Geometry | 2012-06-13 | Paper |
Approximation of point sets by 1-corner polygonal chains
INFORMS Journal on Computing | 2012-05-30 | Paper |
Every large point set contains many collinear points or an empty pentagon
Graphs and Combinatorics | 2012-01-24 | Paper |
Every large point set contains many collinear points or an empty pentagon
Graphs and Combinatorics | 2012-01-24 | Paper |
A generalized Winternitz theorem
Journal of Geometry | 2012-01-13 | Paper |
Witness rectangle graphs
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Witness (Delaunay) graphs
Computational Geometry | 2011-07-20 | Paper |
Transforming triangulations on nonplanar surfaces
SIAM Journal on Discrete Mathematics | 2011-06-17 | Paper |
Transforming triangulations on nonplanar surfaces
SIAM Journal on Discrete Mathematics | 2011-06-17 | Paper |
On crossing numbers of geometric proximity graphs
Computational Geometry | 2011-03-25 | Paper |
Red-blue separability problems in 3D
Computational Science and Its Applications — ICCSA 2003 | 2011-03-18 | Paper |
Coverage with \(k\)-transmitters in the presence of obstacles
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
Large bichromatic point sets admit empty monochromatic 4-gons
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
On the number of plane graphs
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
| On the chromatic number of some flip graphs | 2010-07-27 | Paper |
| Centerpoint theorems for wedges | 2010-07-27 | Paper |
| Edge-removal and non-crossing configurations in geometric graphs | 2010-07-27 | Paper |
A lower bound on the area of a 3-coloured disk packing
International Journal of Computational Geometry & Applications | 2010-07-27 | Paper |
The rotation graph of \(k\)-ary trees is Hamiltonian
Information Processing Letters | 2010-06-09 | Paper |
Matching points with things
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Augmenting the connectivity of outerplanar graphs
Algorithmica | 2010-02-23 | Paper |
On structural and graph theoretic properties of higher order Delaunay graphs
International Journal of Computational Geometry & Applications | 2010-02-12 | Paper |
Playing with triangulations
Lecture Notes in Computer Science | 2010-02-05 | Paper |
A polynomial bound for untangling geometric planar graphs
Discrete & Computational Geometry | 2009-12-14 | Paper |
On polygons enclosing point sets. II
Graphs and Combinatorics | 2009-12-09 | Paper |
Highway hull revisited
Computational Geometry | 2009-11-16 | Paper |
On triconnected and cubic plane graphs on given point sets
Computational Geometry | 2009-08-14 | Paper |
Compatible geometric matchings
Computational Geometry | 2009-07-27 | Paper |
Compatible geometric matchings
Computational Geometry | 2009-07-27 | Paper |
Gray codes for non-crossing partitions and dissections of a convex polygon
Discrete Applied Mathematics | 2009-06-30 | Paper |
Small weak epsilon-nets
Computational Geometry | 2009-06-18 | Paper |
Point set stratification and Delaunay depth
Computational Statistics and Data Analysis | 2009-05-29 | Paper |
Traversing a set of points with a minimum number of turns
Discrete & Computational Geometry | 2009-05-06 | Paper |
Matching points with squares
Discrete & Computational Geometry | 2009-03-24 | Paper |
Voronoi diagram for services neighboring a highway
Information Processing Letters | 2009-03-23 | Paper |
Traversing a set of points with a minimum number of turns
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
Flips in planar graphs
Computational Geometry | 2008-10-22 | Paper |
THE HEAVY LUGGAGE METRIC
International Journal of Computational Geometry & Applications | 2008-09-29 | Paper |
Optimal location of transportation devices
Computational Geometry | 2008-09-19 | Paper |
Augmenting the connectivity of geometric graphs
Computational Geometry | 2008-06-18 | Paper |
On embedding triconnected cubic graphs on point sets
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
A GENERAL APPROXIMATION ALGORITHM FOR PLANAR MAPS WITH APPLICATIONS
International Journal of Computational Geometry & Applications | 2008-05-20 | Paper |
Matching Points with Circles and Squares
Discrete and Computational Geometry | 2008-03-18 | Paper |
Necklaces, Convolutions, and X + Y
Lecture Notes in Computer Science | 2008-03-11 | Paper |
On local transformations in plane geometric graphs embedded on small grids
Computational Geometry | 2007-12-03 | Paper |
On polyhedra induced by point sets in space
Discrete Applied Mathematics | 2007-11-30 | Paper |
Encompassing colored planar straight line graphs
Computational Geometry | 2007-10-19 | Paper |
Computational Science and Its Applications – ICCSA 2004
Lecture Notes in Computer Science | 2007-07-19 | Paper |
On the number of plane geometric graphs
Graphs and Combinatorics | 2007-07-19 | Paper |
Efficient many-to-Many point matching in one dimension
Graphs and Combinatorics | 2007-07-19 | Paper |
Geodesic ham-sandwich cuts
Discrete & Computational Geometry | 2007-04-26 | Paper |
Hamiltonicity and colorings of arrangement graphs
Discrete Applied Mathematics | 2007-01-09 | Paper |
Combinatorial Geometry and Graph Theory
Lecture Notes in Computer Science | 2006-10-10 | Paper |
Partitions of complete geometric graphs into plane trees
Computational Geometry | 2006-05-16 | Paper |
SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS
International Journal of Computational Geometry & Applications | 2006-05-10 | Paper |
Moving coins
Computational Geometry | 2006-04-28 | Paper |
On the equipartition of plane convex bodies and convex polygons
Journal of Geometry | 2006-01-23 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Graphs of triangulations and perfect matchings
Graphs and Combinatorics | 2005-11-24 | Paper |
Computing obnoxious 1-corner polygonal chains
Computers & Operations Research | 2005-11-01 | Paper |
Games on triangulations
Theoretical Computer Science | 2005-10-26 | Paper |
SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
International Journal of Computational Geometry & Applications | 2005-09-29 | Paper |
| scientific article; zbMATH DE number 2209713 (Why is no real title available?) | 2005-09-28 | Paper |
RED-BLUE SEPARABILITY PROBLEMS IN 3D
International Journal of Computational Geometry & Applications | 2005-08-23 | Paper |
ON FLIPS IN POLYHEDRAL SURFACES
International Journal of Foundations of Computer Science | 2005-06-22 | Paper |
A problem on hinged dissections with colours
Graphs and Combinatorics | 2004-12-13 | Paper |
Small strictly convex quadrilateral meshes of point sets
Algorithmica | 2004-12-02 | Paper |
Separability by two lines and by nearly straight polygonal chains
Discrete Applied Mathematics | 2004-11-12 | Paper |
A lower bound on the number of triangulations of planar point sets
Computational Geometry | 2004-10-01 | Paper |
MINIMAL SET OF CONSTRAINTS FOR 2D CONSTRAINED DELAUNAY RECONSTRUCTION
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
| scientific article; zbMATH DE number 2081026 (Why is no real title available?) | 2004-08-04 | Paper |
The weighted farthest color Voronoi diagram on trees and graphs.
Computational Geometry | 2004-01-23 | Paper |
Chromatic variants of the Erdős--Szekeres theorem on points in convex position.
Computational Geometry | 2003-10-14 | Paper |
Towards compatible triangulations.
Theoretical Computer Science | 2003-08-17 | Paper |
Optimal and suboptimal robust algorithms for proximity graphs
Computational Geometry | 2003-05-19 | Paper |
Implicit convex polygons
JMMA. Journal of Mathematical Modelling and Algorithms | 2003-04-27 | Paper |
Graphs of non-crossing perfect matchings
Graphs and Combinatorics | 2003-03-25 | Paper |
Packing trees into planar graphs
Journal of Graph Theory | 2003-03-18 | Paper |
| scientific article; zbMATH DE number 1875425 (Why is no real title available?) | 2003-03-02 | Paper |
| scientific article; zbMATH DE number 1875422 (Why is no real title available?) | 2003-03-02 | Paper |
On polygons enclosing point sets
Geombinatorics | 2003-01-26 | Paper |
On local transformation of polygons with visibility properties.
Theoretical Computer Science | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1854302 (Why is no real title available?) | 2003-01-15 | Paper |
Splitting a Delaunay triangulation in linear time
Algorithmica | 2002-12-01 | Paper |
| scientific article; zbMATH DE number 1830717 (Why is no real title available?) | 2002-11-18 | Paper |
| scientific article; zbMATH DE number 1830733 (Why is no real title available?) | 2002-11-18 | 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 |
| scientific article; zbMATH DE number 1786500 (Why is no real title available?) | 2002-08-21 | Paper |
Structural tolerance and Delaunay triangulation
Information Processing Letters | 2002-07-25 | Paper |
| scientific article; zbMATH DE number 1696622 (Why is no real title available?) | 2002-07-22 | Paper |
On the minimum size of visibility graphs
Information Processing Letters | 2002-07-14 | Paper |
Reconfiguring convex polygons
Computational Geometry | 2002-01-14 | Paper |
On the number of visibility graphs of simple polygons
Discrete Mathematics | 2002-01-08 | Paper |
Some constrained minimax and maximin location problems
Studies in Locational Analysis | 2001-05-13 | Paper |
Separating objects in the plane by wedges and strips
Discrete Applied Mathematics | 2001-04-04 | Paper |
| scientific article; zbMATH DE number 1445299 (Why is no real title available?) | 2000-11-29 | Paper |
Graph of triangulations of a convex polygon and tree of triangulations
Computational Geometry | 2000-11-13 | Paper |
A class of point-sets with few \(k\)-sets
Computational Geometry | 2000-09-04 | Paper |
| scientific article; zbMATH DE number 1409186 (Why is no real title available?) | 2000-03-01 | Paper |
Flipping edges in triangulations
Discrete & Computational Geometry | 1999-11-23 | Paper |
Properties of random triangulations and trees
Discrete & Computational Geometry | 1999-06-28 | Paper |
Geometric tree graphs of points in convex position
Discrete Applied Mathematics | 1999-05-24 | Paper |
Stabbing information of a simple polygon
Discrete Applied Mathematics | 1999-03-30 | Paper |
Hiding points in arrangements of segments
Discrete Mathematics | 1997-07-07 | Paper |
Onion polygonizations
Information Processing Letters | 1997-02-27 | Paper |
Triangulations, visibility graph and reflex vertices of a simple polygon
Computational Geometry | 1996-12-08 | Paper |
Ears of triangulations and Catalan numbers
Discrete Mathematics | 1996-03-26 | Paper |
