2019
Cross-sections of line configurations in $R^3$ and $(d-2)$-flat configurations in $R^d$ Computational Geometry: Theory and Applications 2019, 51-61, 2019 , DOI Show publication in PURE
2018
Computing Balanced Islands in Two Colored Point Sets in the Plane Information Processing Letters 2018, 28 - 32, 2018 , DOI Show publication in PURE
Modem Illumination of Monotone Polygons Computational Geometry: Theory and Applications 2018, 101-118, 2018 , DOI Show publication in PURE
Minimal Geometric Graph Representations of Order TypesMinimal Geometric Graph Representations of Order Types21:1-21:6 Show publication in PURE
A Note on Planar Monohedral TilingsA Note on Planar Monohedral Tilings31:1-31:6 Show publication in PURE
NP-Completeness of Max-Cut for Segment Intersection GraphsNP-Completeness of Max-Cut for Segment Intersection Graphs32:1-32:6 Show publication in PURE
Perfect $k$-Colored Matchings and $(k+2)$-Gonal Tilings Graphs and combinatorics 2018, 1333-1346, 2018 , DOI Show publication in PURE
In pursuit of a dynamic tree decompositionIn pursuit of a dynamic tree decomposition23-25 Show publication in PURE
Intersection Graphs of Rays and Grounded Segments Journal of Graph Algorithms and Applications 2018, 273-295, 2018 , DOI Show publication in PURE
Bishellable drawings of $K_n$ SIAM Journal on Discrete Mathematics 2018, 2482-2492, 2018 , DOI Show publication in PURE
Holes in 2-convex point sets Computational Geometry: Theory and Applications 2018, 38-49, 2018 , DOI Show publication in PURE
Linear transformation distance for bichromatic matchings Computational Geometry: Theory and Applications 2018, 77-88, 2018 , DOI Show publication in PURE
Lombardi Drawings of Knots and LinksLombardi Drawings of Knots and Links113-126 Show publication in PURE
The dual diameter of triangulations Computational Geometry: Theory and Applications 2018, 243-252, 2018 , DOI Show publication in PURE
Holes in 2-convex point setsHoles in 2-convex point sets169-181 Show publication in PURE
2017
A superlinear lower bound on the number of 5-holesA superlinear lower bound on the number of 5-holes8:1-8:16 Show publication in PURE
A superlinear lower bound on the number of 5-holesA superlinear lower bound on the number of 5-holes69-73 Show publication in PURE
Perfect $k$-colored matchings and $k+2$-gonal tilingsPerfect $k$-colored matchings and $k+2$-gonal tilings81-84 Show publication in PURE
Bishellable drawings of $K_n$Bishellable drawings of $K_n$17-20 Show publication in PURE
On semi-simple drawings of the complete graphOn semi-simple drawings of the complete graph25-28 Show publication in PURE
Intersection Graphs of Rays and Grounded SegmentsIntersection Graphs of Rays and Grounded Segments153-166 Show publication in PURE
Routing in Polygonal DomainsRouting in Polygonal Domains88-89 Show publication in PURE
Routing in Polygonal DomainsRouting in Polygonal Domains10:1-10:13 Show publication in PURE
Routing in Simple PolygonsRouting in Simple Polygons17-20 Show publication in PURE
2016
Holes in two convex point setHoles in two convex point set263-266 Show publication in PURE
An improved lower bound on the number of triangulationsAn improved lower bound on the number of triangulations7:1-7:16 Show publication in PURE
Packing Short Plane Spanning Trees in Complete Geometric GraphsPacking Short Plane Spanning Trees in Complete Geometric Graphs9:1--9:12 Show publication in PURE
A Note on the Number of General 4-holes in (Perturbed) GridsA Note on the Number of General 4-holes in (Perturbed) Grids1-12 Show publication in PURE
An improved lower bound on the minimum number of triangulationsAn improved lower bound on the minimum number of triangulations7.1-7.16 Show publication in PURE
2015
On k-Gons and k-Holes in Point Sets Computational geometry 2015, 528-537, 2015 Show publication in PURE
Embedding Four-directional Paths on Convex Point Sets Journal of Graph Algorithms and Applications 2015, 743-759, 2015 , DOI Show publication in PURE
A note on the number of general 4-holes in perturbed gridsA note on the number of general 4-holes in perturbed grids68-69 Show publication in PURE
All Good Drawings of Small Complete GraphsAll Good Drawings of Small Complete Graphs57-60 Show publication in PURE
3-Colorability of Pseudo-Triangulations International Journal of Computational Geometry and Applications 2015, 283-298, 2015 Show publication in PURE
Representing Directed Trees as Straight SkeletonsRepresenting Directed Trees as Straight Skeletons335-347 Show publication in PURE
Monotone Simultaneous Embedding of Upward Planar Digraphs Journal of Graph Algorithms and Applications 2015, 87-110, 2015 , DOI Show publication in PURE
$(n,m)$-Fold Covers of Spheres Proceedings of the Steklov Institute of Mathematics 2015, 203-208, 2015 , DOI Show publication in PURE
Deciding monotonicity of good drawings of the complete graphDeciding monotonicity of good drawings of the complete graph33-36 Show publication in PURE
Empty triangles in good drawings of the complete graph Graphs and combinatorics 2015, 335-345, 2015 , DOI Show publication in PURE
2014
Flips in combinatorial pointed pseudo-triangulations with face degree at most four International Journal of Computational Geometry and Applications 2014, 197-224, 2014 , DOI Show publication in PURE
Linear Transformation Distance for Bichromatic MatchingsLinear Transformation Distance for Bichromatic Matchings154-162 Show publication in PURE
Minimum Dual Diameter TriangulationsMinimum Dual Diameter Triangulations0-0 Show publication in PURE
On k-Convex Point Sets Computational geometry 2014, 809-832, 2014 , DOI Show publication in PURE
Geodesic-preserving polygon simplification International Journal of Computational Geometry and Applications 2014, 307-323, 2014 , DOI Show publication in PURE
Embedding Four-directional Paths on Convex Point SetsEmbedding Four-directional Paths on Convex Point Sets355-366 Show publication in PURE
Plane graphs with parity constraints Graphs and combinatorics 2014, 47-69, 2014 , DOI Show publication in PURE
Lower bounds for the number of small convex k-holes Computational geometry 2014, 605-613, 2014 , DOI Show publication in PURE
Geodesic Order Types Algorithmica 2014, 112-128, 2014 , DOI Show publication in PURE
Non-Shellable Drawings of Kn with Few CrossingsNon-Shellable Drawings of Kn with Few Crossingsonline-only Show publication in PURE
Order types and cross-sections of line arrangements in R3Order types and cross-sections of line arrangements in R3online-only Show publication in PURE
Monotone Simultaneous Embedding of Directed PathsMonotone Simultaneous Embedding of Directed Paths0-0 Show publication in PURE
Straight Skeletons by Means of Voronoi Diagrams Under Polyhedral Distance FunctionsStraight Skeletons by Means of Voronoi Diagrams Under Polyhedral Distance Functionsonline-only Show publication in PURE
4-Holes in Point Sets Computational geometry 2014, 644-650, 2014 , DOI Show publication in PURE
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane Discrete Mathematics & Theoretical Computer Science 2014, 317-332, 2014 Show publication in PURE
2013
Maximizing maximal angles for plane straight line graphs Computational geometry 2013, 17-28, 2013 , DOI Show publication in PURE
Balanced 6-holes in linearly separable bichromatic point sets. Electronic Notes in Discrete Mathematics 2013, 181-186, 2013 , DOI Show publication in PURE
Flips in combinatorial pointed pseudo-triangulations with face degree at most four (extended abstract)Flips in combinatorial pointed pseudo-triangulations with face degree at most four (extended abstract)131-134 Show publication in PURE
Cell-paths in mono- and bichromatic line arrangements in the planeCell-paths in mono- and bichromatic line arrangements in the plane169-174 Show publication in PURE
Empty triangles in good drawings of the complete graphEmpty triangles in good drawings of the complete graph21-29 Show publication in PURE
Blocking delaunay triangulations Computational geometry 2013, 154-159, 2013 , DOI Show publication in PURE
Simulating distributed algorithms for lattice agentsSimulating distributed algorithms for lattice agents81-84 Show publication in PURE
Geodesic-preserving polygon simplificationGeodesic-preserving polygon simplification11-21 Show publication in PURE
Balanced 6-holes in bichromatic point sets.Balanced 6-holes in bichromatic point sets.5-6 Show publication in PURE
2012
Lower bounds for the number of small convex k-holesLower bounds for the number of small convex k-holes261-266 Show publication in PURE
Geodesic order typesGeodesic order types216-227 Show publication in PURE
On 5-gons and 5-holes Lecture notes in computer science 2012, 1-13, 2012 Show publication in PURE
Compatible matchings for bichromatic plane straight-line graphsCompatible matchings for bichromatic plane straight-line graphs257-260 Show publication in PURE
Pointed drawings of planar graphs Computational geometry 2012, 482-494, 2012 , DOI Show publication in PURE
2011
Combinatorial Aspects of [Colored] Point Sets in the Plane Show publication in PURE
On k-Gons and k-Holes in Point SetsOn k-Gons and k-Holes in Point Sets21-26 Show publication in PURE
4-Holes in Point Sets4-Holes in Point Sets115-118 Show publication in PURE
On 5-gons and 5-holesOn 5-gons and 5-holes7-10 Show publication in PURE
2010
Blocking delaunay triangulationsBlocking delaunay triangulations21-24 Show publication in PURE
Large bichromatic point sets admit empty monochromatic 4-gons SIAM Journal on Discrete Mathematics 2010, 2147-2155, 2010 , DOI Show publication in PURE
Compatible pointed pseudo-triangulationsCompatible pointed pseudo-triangulations91-94 Show publication in PURE
3-Colorability of pseudo-triangulations3-Colorability of pseudo-triangulations21-24 Show publication in PURE