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