Birgit Vogtenhuber

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024

Adjacency Graphs of Polyhedral Surfaces.

[BibT_eX]

[DOI]

Discret. Comput. Geom., June, 2024

Perfect Matchings with Crossings.

[BibT_eX]

[DOI]

Algorithmica, March, 2024

Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., January, 2024

Coloring circle arrangements: New 4-chromatic planar graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2024

Towards Crossing-Free Hamiltonian Cycles in Simple Drawings of Complete Graphs.

[BibT_eX]

[DOI]

Joachim Orthaber

Comput. Geom. Topol., 2024

Flip Graph Connectivity for Arrangements of Pseudolines and Pseudocircles.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Geometric Thickness of Multigraphs is ∃ ℝ-Complete.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

On the Uncrossed Number of Graphs.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

Separable Drawings: Extendability and Crossing-Free Hamiltonian Cycles.

[BibT_eX]

[DOI]

Joachim Orthaber

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

2023

Inserting One Edge into a Simple Drawing is Hard.

[BibT_eX]

[DOI]

Discret. Comput. Geom., April, 2023

Graphs with large total angular resolution.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2023

Empty Triangles in Generalized Twisted Drawings of Kn.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2023

Flipping Plane Spanning Paths.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2023

Different Types of Isomorphisms of Drawings of Complete Multipartite Graphs.

[BibT_eX]

[DOI]

Alexandra Weinberger

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

Bichromatic Perfect Matchings with Crossings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

Drawings of Complete Multipartite Graphs up to Triangle Flips.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

On Compatible Matchings.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2022

On Weighted Sums of Numbers of Convex Polygons in Point Sets.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2022

Drawing Graphs as Spanners.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2022

Blocking Delaunay Triangulations from the Exterior.

[BibT_eX]

[DOI]

CoRR, 2022

No Selection Lemma for Empty Triangles.

[BibT_eX]

[DOI]

Carlos Hidalgo-Toscano

Daniel Perz

CoRR, 2022

Flipping Plane Spanning Paths.

[BibT_eX]

[DOI]

CoRR, 2022

On crossing-families in planar point sets.

[BibT_eX]

[DOI]

Comput. Geom., 2022

Disjoint Compatibility via Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

Compatible Spanning Trees in Simple Drawings of Kn.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

Shooting Stars in Simple Drawings of Km, n.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

Edge Partitions of Complete Geometric Graphs.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Rainbow polygons for colored point sets in the plane.

[BibT_eX]

[DOI]

Leonardo Martínez-Sandoval

Mikio Kano

Discret. Math., 2021

Edge Partitions of Complete Geometric Graphs (Part 2).

[BibT_eX]

[DOI]

CoRR, 2021

Flip Distances Between Graph Orientations.

[BibT_eX]

[DOI]

Algorithmica, 2021

Crossing-Optimal Extension of Simple Drawings.

[BibT_eX]

[DOI]

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Minimal Representations of Order Types by Geometric Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2020

A superlinear lower bound on the number of 5-holes.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2020

Evacuating Robots from a Disk Using Face-to-Face Communication.

[BibT_eX]

[DOI]

Jurek Czyzowicz

Konstantinos Georgiou

Discret. Math. Theor. Comput. Sci., 2020

Routing in polygonal domains.

[BibT_eX]

[DOI]

Comput. Geom., 2020

Plane Spanning Trees in Edge-Colored Simple Drawings of Kn.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

Minimizing The Maximum Distance Traveled To Form Patterns With Systems of Mobile Robots.

[BibT_eX]

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019

Lombardi drawings of knots and links.

[BibT_eX]

[DOI]

J. Comput. Geom., 2019

Extending simple drawings with one edge is hard.

[BibT_eX]

[DOI]

CoRR, 2019

Cross-sections of line configurations in R3 and (d - 2)-flat configurations in Rd.

[BibT_eX]

[DOI]

Andres J. Ruiz-Vargas

Comput. Geom., 2019

Packing plane spanning graphs with short edges in complete geometric graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2019

On the 2-Colored Crossing Number.

[BibT_eX]

[DOI]

Adrian Fuchs

Carlos Hidalgo-Toscano

Irene Parada

Francisco Zaragoza

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

On the Edge-Vertex Ratio of Maximal Thrackles.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

2018

Bishellable drawings of Kn.

[BibT_eX]

[DOI]

Bernardo M. Ábrego

Silvia Fernández-Merchant

SIAM J. Discret. Math., 2018

Intersection Graphs of Rays and Grounded Segments.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2018

Computing balanced islands in two colored point sets in the plane.

[BibT_eX]

[DOI]

Nieves Atienza

José Miguel Díaz-Báñez

Pablo Pérez-Lantero

Inf. Process. Lett., 2018

Perfect k-Colored Matchings and \((k+2)\) -Gonal Tilings.

[BibT_eX]

[DOI]

Graphs Comb., 2018

The dual diameter of triangulations.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Modem illumination of monotone polygons.

[BibT_eX]

[DOI]

Thomas Hackl

Comput. Geom., 2018

Linear transformation distance for bichromatic matchings.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Holes in 2-convex point sets.

[BibT_eX]

[DOI]

Comput. Geom., 2018

2017

Routing in Polygons with Holes.

[BibT_eX]

[DOI]

CoRR, 2017

Packing Short Plane Spanning Graphs in Complete Geometric Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Packing Short Plane Spanning Trees in Complete Geometric Graphs.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

An Improved Lower Bound on the Minimum Number of Triangulations.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

Embedding Four-directional Paths on Convex Point Sets.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

Monotone Simultaneous Embeddings of Upward Planar Digraphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

3-Colorability of Pseudo-Triangulations.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2015

Empty Triangles in Good Drawings of the Complete Graph.

[BibT_eX]

[DOI]

Graphs Comb., 2015

Balanced Islands in Two Colored Point Sets in the Plane.

[BibT_eX]

[DOI]

José Miguel Díaz-Báñez

CoRR, 2015

On k-gons and k-holes in point sets.

[BibT_eX]

[DOI]

Hernán González-Aguilar

Comput. Geom., 2015

A Note on the Number of General 4-holes in (Perturbed) Grids.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Representing Directed Trees as Straight Skeletons.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract).

[BibT_eX]

[DOI]

Jurek Czyzowicz

Konstantinos Georgiou

Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

2014

Flips in Combinatorial pointed Pseudo-Triangulations with Face degree at most Four.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2014

Geodesic-Preserving Polygon Simplification.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2014

Plane Graphs with Parity Constraints.

[BibT_eX]

[DOI]

Graphs Comb., 2014

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2014

Lower bounds for the number of small convex k-holes.

[BibT_eX]

[DOI]

Comput. Geom., 2014

4-Holes in point sets.

[BibT_eX]

[DOI]

Hernán González-Aguilar

Comput. Geom., 2014

On k-convex point sets.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Geodesic Order Types.

[BibT_eX]

[DOI]

Algorithmica, 2014

Straight Skeletons by Means of Voronoi Diagrams Under Polyhedral Distance Functions.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Order types and cross-sections of line arrangements in R^3.

[BibT_eX]

[DOI]

Andres J. Ruiz-Vargas

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Non-Shellable Drawings of Kn with Few Crossings.

[BibT_eX]

[DOI]

Bernardo M. Ábrego

Silvia Fernández-Merchant

Pedro Ramos

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

Balanced 6-holes in linearly separable bichromatic point sets.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Monotone Simultaneous Embedding of Directed Paths.

[BibT_eX]

[DOI]

CoRR, 2013

Blocking Delaunay triangulations.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Maximizing maximal angles for plane straight-line graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.

[BibT_eX]

[DOI]

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

Pointed drawings of planar graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2012

2011

On 5-Gons and 5-Holes.

[BibT_eX]

[DOI]

Thomas Hackl

Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

2010

Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Compatible pointed pseudo-triangulations.

[BibT_eX]

[DOI]

Thomas Hackl