2021
Plane paths in simple drawings of complete graphs Show publication in PURE
Plane Matchings in Simple Drawings of Complete GraphsAbstracts of the Young Researchers Forum of th 37th International Symposium on Computational Geometry (SoCG:YRF 2021)6-10 Show publication in PURE
Plane Spanning Trees in Edge-Colored Simple Drawings of KnGraph Drawing and Network Visualization - 28th International Symposium, GD 2020, Revised Selected Papers482-489 Show publication in PURE
Flip distances between graph orientations Algorithmica 83, 116-143, 2021 , DOI Show publication in PURE
2020
Simple Drawings of Km,n Contain Shooting Stars Show publication in PURE
Minimal representations of order types by geometric graphs Journal of Graph Algorithms and Applications 24, 551-572, 2020 , DOI Show publication in PURE
Scheduling drones to cover outdoor eventsProceedings of the 36th European Workshop on Computational Geometry (EuroCG 2020))24:1-24:7 Show publication in PURE
Drawing Graphs as SpannersGraph-Theoretic Concepts in Computer Science - 46th International Workshop, WG 2020, Revised Selected Papers310-324 Show publication in PURE
Minimizing The Maximum Distance Traveled To Form Patterns With Systems of Mobile RobotsProceedings of the 32nd Canadian Conference on Computational Geometry (CCCG 2020)73-79 Show publication in PURE
Inserting one edge into a simple drawing is hardGraph-Theoretic Concepts in Computer Science - 46th International Workshop, WG 2020, Revised Selected Papers325-338 Show publication in PURE
Routing in polygonal domains Computational Geometry: Theory and Applications 87, 2020 , DOI Show publication in PURE
2019
Shooting Stars in Simple Drawings of K<sub>m,n</sub> Show publication in PURE
Graphs with large total angular resolutionGraph Drawing and Network Visualization193-199 Show publication in PURE
Extending simple drawings with one edge is hard arXiv.org e-Print archive , 2019 Show publication in PURE
Minimal Representations of Order Types by Geometric Graphs Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD 2019)101-113 Show publication in PURE
On the 2-Colored Crossing NumberProceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD 2019)87-100 Show publication in PURE
Bounding the number of crossings for a particular class of drawings of $K_{n,n}$ Show publication in PURE
Hamiltonian meander paths and cycles on bichromatic point sets. Show publication in PURE
On the 2-colored crossing number Show publication in PURE
Erdos-Szekeres-Type GamesProc. $35^th$ European Workshop on Computational Geometry EuroCG '1923:1-23:7 Show publication in PURE
On the Edge-Vertex Ratio of Maximal ThracklesGraph Drawing and Network Visualization. GD 2019482-495 Show publication in PURE
Packing plane spanning graphs with short edges in complete geometric graphs Computational Geometry 782, 1-15, 2019 , DOI Show publication in PURE
Flip distances between graph orientations45th International Workshop on Graph-Theoretic Concepts in Computer Science120-134 Show publication in PURE
Perfect rainbow polygons for colored point sets in the planeProc. XVIII Encuentros de Geometría Computacional43-46 Show publication in PURE
Perfect rainbow polygons for colored point sets in the planeProc. 22nd Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG3 2019)57-58 Show publication in PURE
On weighted sums of numbers of convex polygons in point sets Show publication in PURE
Cross-sections of line configurations in $R^3$ and $(d-2)$-flat configurations in $R^d$ Computational Geometry 77, 51-61, 2019 , DOI Show publication in PURE
A superlinear lower bound on the number of 5-holes Journal of Combinatorial Theory / A , 1-31, 2019 , DOI Show publication in PURE
2018
In pursuit of a dynamic tree decompositionProceedings of the of the 21st Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG^3 2018)23-25 Show publication in PURE
Intersection Graphs of Rays and Grounded Segments Journal of Graph Algorithms and Applications 22, 273-295, 2018 , DOI Show publication in PURE
Bishellable drawings of $K_n$ SIAM Journal on Discrete Mathematics 32, 2482-2492, 2018 , DOI Show publication in PURE
Holes in 2-convex point sets Computational Geometry 74, 38-49, 2018 , DOI Show publication in PURE
Lombardi Drawings of Knots and LinksProceedings of the 25th International Symposium on Graph Drawing (GD 2017)113-126 Show publication in PURE
Linear transformation distance for bichromatic matchings Computational Geometry 68, 77-88, 2018 , DOI Show publication in PURE
The dual diameter of triangulations Computational Geometry 68, 243-252, 2018 , DOI Show publication in PURE
Holes in 2-convex point setsCombinatorial Algorithms - 28th International Workshop, IWOCA 2017, Revised Selected Papers169-181 Show publication in PURE
Minimal Geometric Graph Representations of Order Types Show publication in PURE
Computing Balanced Islands in Two Colored Point Sets in the Plane Information Processing Letters 135, 28 - 32, 2018 , DOI Show publication in PURE
Modem Illumination of Monotone Polygons Computational Geometry 68, 101-118, 2018 , DOI Show publication in PURE
A Note on Planar Monohedral TilingsProc. 34th European Workshop on Computational Geometry EuroCG '1831:1-31:6 Show publication in PURE
NP-Completeness of Max-Cut for Segment Intersection GraphsProc. $34^th$ European Workshop on Computational Geometry EuroCG '1832:1-32:6 Show publication in PURE
Perfect $k$-Colored Matchings and $(k+2)$-Gonal Tilings Graphs and Combinatorics 34, 1333-1346, 2018 , DOI Show publication in PURE
2017
Intersection Graphs of Rays and Grounded SegmentsProceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2017)153-166 Show publication in PURE
Routing in Polygonal DomainsProceedings of the of the 20th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG3$$2017)88-89 Show publication in PURE Routing in Polygonal Domains28th International Symposium on Algorithms and Computation (ISAAC 2017)10:1-10:13 Show publication in PURE A Superlinear Lower Bound on the Number of 5-Holes33rd International Symposium on Computational Geometry (SoCG 2017)8:1-8:16 Show publication in PURE Routing in Simple PolygonsProceedings of the 33rd European Workshop on Computational Geometry (EuroCG$$2017)17-20 Show publication in PURE
A superlinear lower bound on the number of 5-holes33rd International Symposium on Computational Geometry (SoCG 2017)8:1-8:16 Show publication in PURE
A superlinear lower bound on the number of 5-holesProceedings of the 33rd European Workshop on Computational Geometry (EuroCG '17)69-73 Show publication in PURE
Perfect $k$-colored matchings and $k+2$-gonal tilingsProc. $33^rd$ European Workshop on Computational Geometry EuroCG '1781-84 Show publication in PURE
Bishellable drawings of $K_n$Proc. XVII Encuentros de Geometría Computacional17-20 Show publication in PURE
On semi-simple drawings of the complete graphProc. XVII Encuentros de Geometría Computacional25-28 Show publication in PURE
2016
An improved lower bound on the minimum number of triangulations32nd International Symposium on Computational Geometry, SoCG 20167.1-7.16 Show publication in PURE
Holes in two convex point setProceedings of European Workshop on Computational Geometry 2016263-266 Show publication in PURE
An improved lower bound on the number of triangulationsProceedings of the Int. Sympos. Comput. Geom. (SoCG) of Leibniz International Proceedings in Informatics7:1-7:16 Show publication in PURE
Packing Short Plane Spanning Trees in Complete Geometric GraphsProceedings of the 27th Internationel Symposium on Algorithms and Computation9.1-9.12 Show publication in PURE
A Note on the Number of General 4-holes in (Perturbed) GridsDiscrete and Computational Geometry and Graphs. JCDCGG 2015.1-12 Show publication in PURE
2015
$(n,m)$-Fold Covers of Spheres Proceedings of the Steklov Institute of Mathematics 288, 203-208, 2015 , DOI Show publication in PURE
Monotone Simultaneous Embedding of Upward Planar Digraphs Journal of Graph Algorithms and Applications 19, 87-110, 2015 , DOI Show publication in PURE
Deciding monotonicity of good drawings of the complete graphEncuentros de Geometría Computacional33-36 Show publication in PURE
Empty triangles in good drawings of the complete graph Graphs and Combinatorics 31, 335-345, 2015 , DOI Show publication in PURE
On k-Gons and k-Holes in Point Sets Computational Geometry , 528-537, 2015 Show publication in PURE
Embedding Four-directional Paths on Convex Point Sets Journal of Graph Algorithms and Applications 19, 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 GraphsCollection of Abstracts of the 31st European Workshop on Computational Geometry 201557-60 Show publication in PURE
Representing Directed Trees as Straight SkeletonsInternational Symposium on Graph Drawing335-347 Show publication in PURE
3-Colorability of Pseudo-Triangulations International Journal of Computational Geometry and Applications , 283-298, 2015 Show publication in PURE
2014
Lower bounds for the number of small convex k-holes Computational Geometry 47, 605-613, 2014 , DOI Show publication in PURE
Geodesic Order Types Algorithmica 70, 112-128, 2014 , DOI Show publication in PURE
Non-Shellable Drawings of Kn with Few CrossingsProc. 26th Annual Canadian Conference on Computational Geometry CCCG 2014online-only Show publication in PURE
Order types and cross-sections of line arrangements in R3(Kopie von) Proc. 26th Annual Canadian Conference on Computational Geometry CCCG 2014online-only Show publication in PURE
Monotone Simultaneous Embedding of Directed PathsCollection of Abstracts of the 30th European Workshop on Computational Geometry 20140-0 Show publication in PURE
Straight Skeletons by Means of Voronoi Diagrams Under Polyhedral Distance FunctionsProc. 26th Annual Canadian Conference on Computational Geometry CCCG 2014online-only Show publication in PURE
4-Holes in Point Sets Computational Geometry 47, 644-650, 2014 , DOI Show publication in PURE
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane Discrete Mathematics & Theoretical Computer Science 16, 317-332, 2014 Show publication in PURE
Flips in combinatorial pointed pseudo-triangulations with face degree at most four International Journal of Computational Geometry and Applications 24, 197-224, 2014 , DOI Show publication in PURE
Linear Transformation Distance for Bichromatic MatchingsProceedings of the Thirtyth Annual Symposium on Computational Geometry (SCG '14)154-162 Show publication in PURE
Minimum Dual Diameter TriangulationsEuropean Workshop on Computational Geometry0-0 Show publication in PURE
On k-Convex Point Sets Computational Geometry 47, 809-832, 2014 , DOI Show publication in PURE
Geodesic-preserving polygon simplification International Journal of Computational Geometry and Applications 24, 307-323, 2014 , DOI Show publication in PURE
Embedding Four-directional Paths on Convex Point SetsProc. 22nd International Symposium on Graph Drawing (GD 2014)355-366 Show publication in PURE
Plane graphs with parity constraints Graphs and Combinatorics 30, 47-69, 2014 , DOI Show publication in PURE
2013
Balanced 6-holes in bichromatic point sets.Japanese Conference on Discrete and Computational Geometry5-6 Show publication in PURE
Maximizing maximal angles for plane straight line graphs Computational Geometry 46, 17-28, 2013 , DOI Show publication in PURE
Balanced 6-holes in linearly separable bichromatic point sets. Electronic Notes in Discrete Mathematics 44, 181-186, 2013 , DOI Show publication in PURE
Flips in combinatorial pointed pseudo-triangulations with face degree at most four (extended abstract)XV Spanish Meeting on Computational Geometry131-134 Show publication in PURE
Cell-paths in mono- and bichromatic line arrangements in the plane25th Canadian Conference on Computational Geometry169-174 Show publication in PURE
Empty triangles in good drawings of the complete graphMexican Conference on Discrete Mathematics and Computational Geometry21-29 Show publication in PURE
Blocking delaunay triangulations Computational Geometry 46, 154-159, 2013 , DOI Show publication in PURE
Simulating distributed algorithms for lattice agentsXV Spanish Meeting on Computational Geometry (2013)81-84 Show publication in PURE
Geodesic-preserving polygon simplificationAlgorithms and Computation, 24th International Symposium11-21 Show publication in PURE
2012
On 5-gons and 5-holes Lecture notes in computer science 7579, 1-13, 2012 Show publication in PURE
Compatible matchings for bichromatic plane straight-line graphs28th European Workshop on Computational Geometry, Booklet of Abstracts257-260 Show publication in PURE
Pointed drawings of planar graphs Computational Geometry , 482-494, 2012 , DOI Show publication in PURE
Lower bounds for the number of small convex k-holesProc. 24th Annual Canadian Conference on Computational Geometry CCCG 2012261-266 Show publication in PURE
Geodesic order typesProc. 18th Annual International Computing and Combinatorics Conference (COCOON '12),216-227 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 SetsProc. 23nd Annual Canadian Conference on Computational Geometry CCCG 201121-26 Show publication in PURE
4-Holes in Point SetsCollection of Abstracts of the 27th European Workshop on Computational Geometry 2011115-118 Show publication in PURE
On 5-gons and 5-holesProceedings of XIV Encuentros de Geometría Computacional 20117-10 Show publication in PURE
2010
Compatible pointed pseudo-triangulationsProc. 22nd Annual Canadian Conference on Computational Geometry CCCG 201091-94 Show publication in PURE
3-Colorability of pseudo-triangulationsCollection of Abstracts of the 26th European Workshop on Computational Geometry 201021-24 Show publication in PURE
Blocking delaunay triangulationsProc. 22nd Annual Canadian Conference on Computational Geometry CCCG 201021-24 Show publication in PURE
Large bichromatic point sets admit empty monochromatic 4-gons SIAM Journal on Discrete Mathematics 23, 2147-2155, 2010 , DOI Show publication in PURE