Publications

  • Hamiltonian meander paths and cycles on bichromatic point sets
    Oswin Aichholzer, Carlos Alegría Galicia, Irene Parada, Alexander Pilz, Javier Tejel, Csaba D. Tóth, Jorge Urrutia, and Birgit Vogtenhuber
    In the Proceedings of XVIII Encuentros de Geometría Computacional, pages 35-38, 2019. [url]
  • Transformed flips in triangulations and matchings
    Oswin Aichholzer, Lukas Andritsch, Karin Baur, and Birgit Vogtenhuber
    Submitted.
    [arXiv:1907.08758]
  • On Compatible Matchings
    Oswin Aichholzer, Alan Arroyo, Zuzana Masarova, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, and Birgit Vogtenhuber
    In Proceedings of the 15th International Workshop of Algorithms and Computation (WALCOM), LNCS 12635, pages 221-233, Springer, 2021. [doi]
    [arXiv:1703.05253]
  • A superlinear lower bound on the number of 5-holes
    Oswin Aichholzer, Martin Balko, Thomas Hackl, Jan Kynčl, Irene Parada, Manfred Scheucher, Pavel Valtr, and Birgit Vogtenhuber
    Journal of Combinatorial Theory, Series A, 173:1-31, 2020 [url]
    In Proceedings of the 33rd International Symposium on Computational Geometry (SoCG 2017), LIPIcs 77, pages 8:1-8:16, Dagstuhl, 2017. [doi]
    Extended Abstract in Proceedings of the 33rd European Workshop on Computational Geometry (EuroCG), 2017. [url]
    [arXiv:1703.05253]
  • Minimal Geometric Graph Representations of Order Types
    Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kynčl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, and Emo Welzl.
    In Proceedings of 27th International Symposium on Graph Drawing and Network Visualization (GD 2019), LNCS 11904, pages 101-113, Springer, 2019. [doi]
    Extended Abstract in Proceedings of the 34th European Workshop on Computational Geometry (EuroCG), 2018. [url]
    [arXiv:1908.05124]
  • Drawing graphs as spanners
    Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin, and Birgit Vogtenhuber
    In Proceedings of 46th International Workshop on Graph-Theoretic Concepts in Computer Science. (WG 2020), LNCS 12301, pages 310-324, Springer, 2020. [doi]
    [arXiv:2002.05580]
  • Scheduling drones to cover outdoor events
    Oswin Aichholzer, Luis E. Caraballo, José-Miguel Díaz-Báñez, Ruy Fabila-Monroy, Irene Parada, Inmaculada Ventura and Birgit Vogtenhuber
    Extended Abstract in Proceedings of the 36th European Workshop on Computational Geometry (EuroCG), 2020. [url]
  • Flip distances between graph orientations
    Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, and Birgit Vogtenhuber
    Algorithmica (2020), pages 1-28, 2020. [doi]
    In Proceedings of 45th International Workshop on Graph-Theoretic Concepts in Computer Science, LNCS 11789, pages 120-134, Springer, 2019. [doi]
    [arXiv:1902.06103]
  • Erdős-Szekeres-Type Games
    Oswin Aichholzer, José-Miguel Díaz-Báñez, Thomas Hackl, David Orden, Alexander Pilz, Inmaculada Ventura, and Birgit Vogtenhuber
    Extended Abstract in Proceedings of the 35th European Workshop on Computational Geometry (EuroCG), 2019. [url]
  • An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants
    Oswin Aichholzer, Frank Duque, Ruy Fabila-Monroy, Carlos Hidalgo-Toscano, and Oscar E. García-Quintero
    Journal of Graph Algorithms and Applications, 24(3):421-432, 2020 [doi]
    [arXiv:1907.07796]
  • On the 2-Colored Crossing Number
    Oswin Aichholzer, Ruy Fabila-Monroy, Adrian Fuchs, Carlos Hidalgo Toscano, Irene Parada, Birgit Vogtenhuber, and Francisco Zaragoza
    In Proceedings of 27th International Symposium on Graph Drawing and Network Visualization (GD 2019), LNCS 11904, pages 87-100, Springer, 2019. [doi]
    Extended Abstract in Proceedings of the 35th European Workshop on Computational Geometry (EuroCG), 2019. [url]
    [arXiv:1908.06461]
  • On the Triangle Vector
    Oswin Aichholzer, Ruy Fabila-Monroy, and Julia Obmann
    In the Proceedings of XVIII Encuentros de Geometría Computacional, pages 55-58, 2019. [url]
  • Simple Drawings of Km,n Contain Shooting Stars
    Oswin Aichholzer and Alfredo García and Irene Parada and Birgit Vogtenhuber and Alexandra Weinberger
    Extended Abstract in Proceedings of the 36th European Workshop on Computational Geometry (EuroCG), 2020. [url]
  • Plane Matchings in Simple Drawings of Complete Graphs
    Oswin Aichholzer and Alfredo García and Javier Tejel and Birgit Vogtenhuber and Alexandra Weinberger
    Extended Abstract in Proceedings of the Computational Geometry: Young Researchers Forum (CG:YRF 2021), pages 6-10, 2021. [url]
  • Plane Paths in Simple Drawings of Complete Graphs
    Oswin Aichholzer and Alfredo García and Javier Tejel and Birgit Vogtenhuber and Alexandra Weinberger
    In Proceedings of of XIX Encuentros de Geometría Computacional, page 4, 2021. [url]
  • Plane spanning trees in edge-colored simple drawings of Kn
    Oswin Aichholzer, Michael Hoffmann, Johannes Obenaus, Rosna Paul, Daniel Perz, Nadja Seiferth, Birgit Vogtenhuber, and Alexandra Weinberger
    In Proceedings of 28th International Symposium on Graph Drawing and Network Visualization (GD 2020), LNCS 12590, pages 482-489, Springer, 2020. [doi]
    [arXiv:2008.08827]
  • On the Edge-Vertex Ratio of Maximal Thrackles
    Oswin Aichholzer, Linda Kleist, Boris Klemz, Felix Schröder, and Birgit Vogtenhuber
    In Proceedings of 27th International Symposium on Graph Drawing and Network Visualization (GD 2019), LNCS 11904, pages 87-100, Springer, 2019. [doi]
    [arXiv:1908.08857]
  • Graphs with large total angular resolution
    Oswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, Andre van Renssen, and Birgit Vogtenhuber
    In Proceedings of 27th International Symposium on Graph Drawing and Network Visualization (GD 2019), LNCS 11904, pages 193-199, Springer, 2019. [doi]
    [arXiv:1908.06504]
  • On 4-Crossing-Families in Point Sets and an Asymptotic Upper Bound.
    Oswin Aichholzer, Jan Kyncl, Manfred Scheucher and Birgit Vogtenhuber
    Extended Abstract in Proceedings of the 37th European Workshop on Computational Geometry (EuroCG 2021), 2021. [url]
  • NP-Completeness of Max-Cut for Segment Intersection Graphs
    Oswin Aichholzer, Wolfgang Mulzer, Patrick Schnider, and Birgit Vogtenhuber
    Extended Abstract in Proceedings of the 34th European Workshop on Computational Geometry (EuroCG), 2018. [url]
  • Disjoint tree-compatible plane perfect matchings
    Oswin Aichholzer and Julia Obmann and Pavel Paták and Daniel Perz and Josef Tkadlec
    Extended Abstract in Proceedings of the 36th European Workshop on Computational Geometry (EuroCG), 2020. [url]
  • Shooting Stars in Simple Drawings of Km,n
    Oswin Aichholzer, Irene Parada, Manfred Scheucher, Birgit Vogtenhuber, and Alexandra Weinberger
    Extended Abstract in Proceedings of the 35th European Workshop on Computational Geometry (EuroCG), 2019. [url]
  • Triangles in the colored Euclidean plane
    Oswin Aichholzer and Daniel Perz
    Extended Abstract in Proceedings of the 35th European Workshop on Computational Geometry (EuroCG), 2019. [url]
  • 3D-disk-packing Helmut Alt, Otfried Cheong, Ji-won Park, and Nadja Scharf
    Extended Abstract in Proceedings of the 34th European Workshop on Computational Geometry (EuroCG), 2019. [url]
  • Packing 2D Disks into a 3D Container
    Helmut Alt, Otfried Cheong, Ji-won Park, and Nadja Scharf
    In Proceedings of the 13th International Conference on Algorithms and Computation (WALCOM), LNCS 11355, pages 369-380, Springer, 2019. [doi]
    Extended Abstract in Proceedings of the 34th European Workshop on Computational Geometry (EuroCG), 2018. [url]
  • Approximating Smallest Containers for Packing Three-Dimensional Convex Objects
    Helmut Alt and Nadja Scharf
    International Journal of Computational Geometry and Applications, 28(2):111-128, 2018. [doi]
  • Simple $k$-Planar Graphs are Simple $(k + 1)$-Quasiplanar
    Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Michael Hoffmann, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter, and Csaba D. Tóth
    Journal of Combinatorial Theory, Series B. 142:1-35, 2020. [doi]
  • The QuaSEFE Problem
    Patrizio Angelini, Henry Förster, Michael Hoffmann, Michael Kaufmann, Stephen Kobourov, Giuseppe Liotta, and Maurizio Patrignani
    In Proceedings of 27th International Symposium on Graph Drawing and Network Visualization (GD 2019), LNCS 11904, pages 268-275. Springer, 2019. [doi]
    [arXiv:1908.08708]
  • Inserting one edge into a simple drawing is hard
    Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber and Tilo Wiedera
    In Proceedings of the 46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2020), LNCS 12301, pages 325-338, 2020. [doi]
    [arXiv:1909.07347]
  • Representing Graphs by Polygons with Side Contacts in 3D
    Elena Arseneva and Linda Kleist and Boris Klemz and Maarten Löffler and André Schulz and Birgit Vogtenhuber and Alexander Wolff
    Extended Abstract in Proceedings of the 36th European Workshop on Computational Geometry (EuroCG), 2020. [url]
  • Almost-equidistant sets. Martin Balko, Attila Pór, Manfred Scheucher, Konrad Swanepoel and Pavel Valtr
    Graphs and Combinatorics, 36(3):729-754, 2020. [doi]
    [arXiv:1706.06375]
  • Holes and islands in random point sets Martin Balko, Manfred Scheucher, and Pavel Valtr
    To appear in Random Structures & Algorithms.
    In Proceedings of th 36th Symposium on Computational Geometry (SoCG 2020), LIPIcs 164, pages 14:1-16, 2020. [doi]
    Extended Abstract in Proceedings of the 36th European Workshop on Computational Geometry (EuroCG), [url]
    [arXiv:2003.00909]
  • Tight bounds on the expected number of holes in random point sets. Martin Balko, Manfred Scheucher, and Pavel Valtr
    Extended Abstract in Proceedings of the 37th European Workshop on Computational Geometry (EuroCG), [url]
    [arXiv:2003.00909]
  • Asymmetric Convex Intersection Testing
    Luis Barba and Wolfgang Mulzer
    In Proceedings of the 2nd Symposium on Simplicity in Algorithms (SOSA 2019), OASIcs 69, pages 9:1-14, Dagstuhl, 2019. [doi]
    [arXiv:1808.06460]
  • Topological drawings meet classical theorems from convex geometry
    Helena Bergold, Stefan Felsner, Manfred Scheucher, Felix Schröder, and Raphael Steiner
    In proceedings of 28th International Symposium on Graph Drawing and Network Visualization (GD 2020), LNCS 12590, pages 281-294. Springer, 2020. [doi]
    Extended Abstract in Proceedings of the 36th European Workshop on Computational Geometry (EuroCG), [url]
    [arXiv:2005.12568]
  • Line and Plane Cover Numbers Revisited
    Therese C. Biedl, Stefan Felsner, Henk Meijer, and Alexander Wolff
    In Proceedings of 27th International Symposium on Graph Drawing and Network Visualization (GD 2019), LNCS 11904, pages 409-415. Springer, 2019. [doi]
    [arXiv:1908.07647]
  • Maximum Clique in Disk-Like Intersection Graphs
    Édouard Bonnet, Nicolas Grelier, and Tillmann Miltzow
    Proceedings of 40th conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020), LIPIcs 182, pages 17:1-18, Dagstuhl, 2020. [doi]
    [arXiv:2003.02583]
  • A better approximation for longest noncrossingspanning trees
    Sergio Cabello, Aruni Choudhary, Michael Hoffmann, Katharina Klost, Meghana M. Reddy, Wolfgang Mulzer, Felix Schröder, and Josef Tkadlec
    Extended Abstract in Proceedings of the 36th European Workshop on Computational Geometry (EuroCG) [url]
  • Long Plane Trees
    Sergio Cabello, Michael Hoffmann, Katharina Klost, Wolfgang Mulzer, and Josef Tkadlec
    Extended Abstract in Proceedings of the 37th European Workshop on Computational Geometry (EuroCG), 2021. [url]
    [arXiv:2101.00445]
  • Intersection Graphs of Rays and Grounded Segments
    Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, and Birgit Vogtenhuber
    Journal of Graph Algorithms and Applications, 22(2):273-295, 2018. [doi]
    Proceedings of the 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2017), LNCS 10520, pages 153-166. Springer, 2017. [doi]
    [arXiv:1612.03638]
  • Monotone Arc Diagrams with few Biarcs
    Steven Chaplick, Henry Förster, Michael Hoffmann, and Michael Kaufmann
    Extended Abstract in Proceedings of the 36th European Workshop on Computational Geometry (EuroCG) [url]
  • Recognizing Embedded Caterpillars with Weak Unit Disk Contact Representations is NP-hard
    Man-Kwun Chiu, Jonas Cleve, and Martin Nöllenburg
    Extended Abstract in Proceedings of the 35th European Workshop on Computational Geometry (EuroCG), 2019. [url]
  • On the average complexity of the k-level.
    Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher, Patrick Schnider, Raphael Steiner, and Pavel Valtr
    Journal of Computational Geometry, 11:493-506, 2020. [url]
    Extended Abstract in Proceedings of the 36th European Workshop on Computational Geometry (EuroCG 2020) [url]
  • Coloring Circle Arrangements: New 4-Chromatic Planar Graphs.
    Man Kwun Chiu, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner and Birgit Vogtenhuber
    Extended Abstract in Proceedings of the 37th European Workshop on Computational Geometry (EuroCG 2021), 2021. [url]
  • Nearest-Neighbor Decompositions of Drawings.
    Jonas Cleve, Nicolas Grelier, Kristin Knorr, Maarten Löffler, Wolfgang Mulzer and Daniel Perz
    Extended Abstract in Proceedings of the 37th European Workshop on Computational Geometry (EuroCG 2021), 2021. [url]
  • Drawing Shortest Paths in Geodetic Graphs
    Sabine Cornelsen, Maximilian Pfister, Henry Förster, Martin Gronemann, Michael Hoffmann, Stephen Kobourov, and Thomas Schneck
    In Proceedings of 28th International Symposium on Graph Drawing and Network Visualization (GD 2020). LNCS 12590, pages 333-340, Springer, 2020. [doi]
    [arXiv:2008.07637]
  • On Area-Universal Quadrangulations
    William S. Evans, Stefan Felsner, Linda Kleist and Stephen G. Kobourov
    Journal of Graph Algorithms and Applications, 25(1): 171-193. 2021. [doi]
    [arXiv:2008.07637]
  • No Selection Lemma for Empty Triangles
    Ruy Fabila-Monroy, Carlos Hidalgo-Toscano, Daniel Perz and Birgit Vogtenhuber
    In Proceedings of XIX Encuentros de Geometría Computacional, page 36, 2021. [url]
  • Empty Rainbow Triangles in k-colored Point Sets
    Ruy Fabila-Monroy, Daniel Perz, and Ana Laura Trujillo
    Computational Geometry, 95: 101731, 2021. [doi]
    Extended Abstract in Proceedings of the 36th European Workshop on Computational Geometry (EuroCG 2020). [url]
    [arXiv:2007.07863]
  • On the Maximum Number of Crossings in Star-Simple Drawings of Kn with No Empty Lens
    Stefan Felsner, Michael Hoffmann, Kristin Knorr, and Irene Parada
    Proceedings of 28th International Symposium on Graph Drawing and Network Visualization (GD 2020), LNCS 12590, pages 382-389, 2020. [doi]
    Extended Abstract in Proceedings of the 36th European Workshop on Computational Geometry (EuroCG 2020) [url]
    [arXiv:2008.11058]
  • Rainbow cycles in flip graphs
    Stefan Felsner, Linda Kleist, Torsten Mütze, and Leon Sering
    Proceedings of 34th International Symposium on Computational Geometry (SoCG2018),LIPIcs 99, pages 38:1-14, 2018. [doi]
  • Plattenbauten: Touching Rectangles in Space
    Stefan Felsner, Kolja Knauer and Torsten Ueckerdt
    Proceedings of the 46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2020), LNCS 12301, pages 161-173. Springer, 2017. [doi]
    [arXiv:2007.07806]
  • Arrangements of Approaching Pseudo-Lines
    Stefan Felsner, Alexander Pilz and Patrick Schnider
    Submitted to journal, 2020
    [arXiv:2001.08419]
  • Arrangements of Pseudocircles: On Circularizability
    Stefan Felsner and Manfred Scheucher
    Discrete & Computational Geometry, 64:776-813, 2020. Ricky Pollack Memorial Issue (DCG). [doi]
    In Proceedings of 26th International Symposium on Graph Drawing and Network Visualization (GD 2018),LNCS 11282, pages 555-568. Springer, 2018. [doi]
    Extended Abstract in Proceedings of the 34th European Workshop on Computational Geometry (EuroCG), 2018. [url]
    [arXiv:1712.02149]
  • Arrangements of Pseudocircles: Triangles and Drawings
    Stefan Felsner and Manfred Scheucher
    Discrete & Computational Geometry (DCG),2020. [doi]
    Proceedings of 25th International Symposium on Graph Drawing and Network Visualization (GD 2017), LNCS 10692, pages 127-139. Springer, 2018. [doi]
    Extended Abstract in Proceedings of the 33rd European Workshop on Computational Geometry (EuroCG), 2017. [url]
    [arXiv:1708.06449]
  • The Complexity of Finding Tangles
    Oksana Firman, Stefan Felsner, Philipp Kindermann, Alexander Ravsky, Alexander Wolff, and Johannes Zink
    Extended Abstract in Proceedings of the 36rd European Workshop on Computational Geometry (EuroCG), 2020. [url]
  • Perfect rainbow polygons for colored point sets in the plane
    David Flores-Peñaloza, Mikio Kano, Leonardo Martínez-Sandoval, David Orden, Javier Tejel, Csaba D. Tóth, Jorge Urrutia, and Birgit Vogtenhuber
    In Proceedings of XVIII Encuentros de Geometría Computacional, pages 43-46, 2019. [url]
    In Proceedings of 22nd Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG3 2019), pages 57-58, 2019. [url]
  • Simultaneous Embeddings with Few Bends and Crossings
    Fabrizio Frati, Michael Hoffmann, and Vincent Kusters
    Journal of Graph Algorithms and Applications, Volume 23(4), 683-713, 2019. [url]
  • Universal Geometric Graphs Fabrizio Frati, Michael Hoffmann and Csaba D. Tóth
    Proceedings of 46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2020), LNCS 12301, pages 174-186, 2020. [doi]
  • Crossing-optimal extension of simple drawings
    Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada and Birgit Vogtenhuber
    In Proceedings of the 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 2021 [doi]
    In Proceedings of XIX Encuentros de Geometría Computacional, page 5, 2021. [url]
  • Convex hulls of random order types
    Xavier Goaoc and Emo Welzl
    Proceedings of 36th International Symposium on Computational Geometry (SoCG 2020), LIPIcs 164, 49:1-49:15, 2020. [doi]
  • Computing a Maximum Clique in Geometric Superclasses of Disk Graphs
    Nicolas Grelier
    In Proceedings of 26th International Computing and Combinatorics Conference (COCOON 2020), LNCS 12273, pages 299-310, 2020. [doi]
  • Minimum Convex Partition of Degenerate PointSets is NP-Hard
    Nicolas Grelier
    Extended Abstract in Proceedings of the 36rd European Workshop on Computational Geometry (EuroCG), 2020. [url]
  • On the VC-dimension of convex sets and half-spaces
    Nicolas Grelier, Saeed Gh. Ilchi, Tillmann Miltzow, and Shakhar Smorodinsky
    To appear in Discrete Mathematics & Theoretical Computer Science (DMTCS)
    [arXiv:1907.01241]
  • Approximate strong edge-colouring of unit disk graphs
    Nicolas Grelier, Rémi de Joannis de Verclos, Ross J. Kang, and François Pirot
    Proceedings of 17th International Workshop on Approximation and Online Algorithms (WAOA 2019), LNCS 11926, 154-169, 2019. [doi]
    Extended Abstract in Proceedings of the 35th European Workshop on Computational Geometry (EuroCG 2019), 2019. [url]
  • Coloring drawings of graphs
    Christoph Hertrich, Felix Schröder, and Raphael Steiner
    [arXiv:2008.09692]
  • Triconnected Planar Graphs of Maximum Degree Five are Subhamiltonian
    Michael Hoffmann and Boris Klemz
    In Proceedings of 27th European Symposium of Algorithms (ESA '19), LIPIcs 144, 58:1-14, 2019. [doi]
  • Simple Topological Drawings of k-Planar Graphs
    Michael Hoffmann, Chih-Hung Liu, Meghana M. Reddy, Csaba D. Tóth
    In Proceedings of 28th International Symposium on Graph Drawing and Network Visualization (GD 2020), LNCS 12590, pages 390-402, 2020. [doi]
    Extended Abstract in Proceedings of the 36th European Workshop on Computational Geometry (EuroCG), 2020. [url]
    [arXiv:2008.10794]
  • An Improved Searching Algorithm on a Line by Four Truthful Robots and Two Byzantine Robots
    Michael Hoffmann, Malte Milatz, Yoshio Okamoto, and Manuel Wettstein
    Appeared in Abstracts 22nd Japan Conf. Discrete Comput. Geom. Graphs (JCDCG3 '19), Tokyo, Japan, 2019, 69--70. [url]
  • Green-Wins Solitaire Revisited-Simultaneous Flips that Affect Many Edges
    Michael Hoffmann, János Pach, and Miloš Stojaković
    Extended Abstract in Proceedings of the 35th European Workshop on Computational Geometry (EuroCG), 2019. [url]
  • On weighted sums of numbers of convex polygons in point sets
    Clemens Huemer, Deborah Oliveros, Pablo Pérez-Lantero, Ferran Torra, and Birgit Vogtenhuber
    Submitted to journal
    [arXiv:1910.08736]
  • Lombardi drawings of knots and links
    Philipp Kindermann, Stephen Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz, and Birgit Vogtenhuber
    Journal of Comutational Geometry, 10(1):444-476,2019. [doi]
    Proceedings of 25th International Symposium on Graph Drawing and Network Visualization (GD 2017), LNCS 10692, 113-126, 2018. [doi]
  • Local Complexity of Polygons
    Fabian Klute, Meghana M. Reddy and Tillmann Miltzow
    Extended Abstract in Proceedings of the 37th European Workshop on Computational Geometry (EuroCG), 2021. [url]
  • Bounding the number of crossings for a particular class of drawings of Kn,n
    Carolina Medina, Irene Parada, Gelasio Salazar, and Birgit Vogtenhuber
    In the Proceedings of XVIII Encuentros de Geometría Computacional, page 34, 2019. [url]
  • The Tree Stabbing Number is not Monotone
    Wolfgang Mulzer and Johannes Obenaus
    Extended Abstract in Proceedings of the 36th European Workshop on Computational Geometry (EuroCG), 2020. [url]
  • Long Alternating Paths Exist
    Wolfgang Mulzer and Pavel Valtr
    Proceedings of 36th International Symposium on Computational Geometry (SoCG 2020), LIPIcs 164, 57:1-16, 2020. [doi]
  • On L-shaped Point Set Embeddings of Trees: First Non-embeddable Examples
    Torsten Mütze and Manfred Scheucher
    In the Proceedings of 26th International Symposium on Graph Drawing and Network Visualization (GD 2018), pages 354--360, LNCS 11282, Springer, 2018. [doi]
    [arXiv:1807.11043]
  • Spanning trees with low (shallow) stabbing number
    Johannes Obenaus
    Master's thesis, ETH Zürich and FU Berlin, 2019 [url]
  • Many Order Types on Integer Grids of Polynomial Size
    Manfred Scheucher
    [arXiv:2007.15334], 2020.
  • Two disjoint 5-holes in point sets
    Manfred Scheucher
    Computational Geometry Theory and Application, 91:id:101670, 2020. [doi]
    Extended Abstract in Proceedings of the 35th European Workshop on Computational Geometry (EuroCG), 2019. [url]
    Short version in Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB 2019), Acta Mathematica Universitatis Comenianae 88(3), pages 1049-1056, 2019. [url]
    [arXiv:1807.10848]
  • A Note On Universal Point Sets for Planar Graphs
    Manfred Scheucher, Hendrik Schrezenmaier, and Raphael Steiner
    In Proceedings of 27th International Symposium on Graph Drawing and Network Visualization (GD 2019), LNCS 11904, 350-362, 2019. [doi]
    Extended Abstract in Proceedings of the 35th European Workshop on Computational Geometry (EuroCG), 2019. [url]
    [arXiv:1811.06482]
  • Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips)
    Uli Wagner and Emo Welzl
    In Proceedings of 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), pages 2823-2841, SIAM, 2020. [doi]
  • Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips)
    Uli Wagner and Emo Welzl
    Proceedings of 36th International Symposium on Computational Geometry (SoCG 2020), LIPIcs 164, 67:1-67:16, 2020. [doi]