Author of the publication

A Note on Universal Point Sets for Planar Graphs.

, , and . GD, volume 11904 of Lecture Notes in Computer Science, page 350-362. Springer, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

On L-shaped point set embeddings of trees: first non-embeddable examples., and . J. Graph Algorithms Appl., 24 (3): 343-369 (2020)Minimal Representations of Order Types by Geometric Graphs., , , , , , , , , and 1 other author(s). GD, volume 11904 of Lecture Notes in Computer Science, page 101-113. Springer, (2019)A SAT attack on higher dimensional Erdős-Szekeres numbers.. CoRR, (2021)Flip Graph Connectivity for Arrangements of Pseudolines and Pseudocircles., , , , , and . CoRR, (2023)A Superlinear Lower Bound on the Number of 5-Holes., , , , , , , and . SoCG, volume 77 of LIPIcs, page 8:1-8:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Saturation Results Around the Erdős-Szekeres Problem., , , and . SoCG, volume 293 of LIPIcs, page 46:1-46:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Almost-Equidistant Sets., , , , and . Graphs Comb., 36 (3): 729-754 (2020)SAT-Based Generation of Planar Graphs., , and . SAT, volume 271 of LIPIcs, page 14:1-14:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)A Note on Universal Point Sets for Planar Graphs., , and . GD, volume 11904 of Lecture Notes in Computer Science, page 350-362. Springer, (2019)Topological Drawings Meet Classical Theorems from Convex Geometry., , , , and . GD, volume 12590 of Lecture Notes in Computer Science, page 281-294. Springer, (2020)