Birgit Vogtenhuber

From MaRDI portal
Person:452447

Available identifiers

zbMath Open vogtenhuber.birgitDBLP95/3225WikidataQ92590823 ScholiaQ92590823MaRDI QIDQ452447

List of research outcomes





PublicationDate of PublicationType
Flip graph connectivity for arrangements of pseudolines and pseudocircles2024-11-28Paper
Drawings of complete multipartite graphs up to triangle flips2024-10-16Paper
Different types of isomorphisms of drawings of complete multipartite graphs2024-10-14Paper
Coloring circle arrangements: new 4-chromatic planar graphs2024-09-30Paper
No selection lemma for empty triangles2024-09-19Paper
Coloring circle arrangements: new 4-chromatic planar graphs2024-09-13Paper
Geometric thickness of multigraphs is \(\exists \mathbb{R} \)-complete2024-05-31Paper
Adjacency graphs of polyhedral surfaces2024-05-21Paper
Twisted ways to find plane structures in simple drawings of complete graphs2024-05-14Paper
Edge partitions of complete geometric graphs2024-05-14Paper
https://portal.mardi4nfdi.de/entity/Q62046592024-04-02Paper
Perfect matchings with crossings2024-03-25Paper
Twisted ways to find plane structures in simple drawings of complete graphs2024-01-09Paper
Empty Triangles in Generalized Twisted Drawings of $K_n$2023-12-20Paper
Flipping plane spanning paths2023-11-24Paper
Flip Graph Connectivity for Arrangements of Pseudolines and Pseudocircles2023-10-30Paper
Bichromatic Perfect Matchings with Crossings2023-09-01Paper
Empty triangles in generalized twisted drawings of \(K_n\)2023-08-16Paper
Compatible spanning trees in simple drawings of \(K_n\)2023-08-16Paper
Shooting stars in simple drawings of \(K_{m,n}\)2023-08-16Paper
Disjoint compatibility via graph classes2023-05-05Paper
Inserting one edge into a simple drawing is hard2023-03-09Paper
Graphs with large total angular resolution2023-01-05Paper
Inserting one edge into a simple drawing is hard2022-12-21Paper
Drawing graphs as spanners2022-12-21Paper
On Compatible Matchings2022-11-14Paper
Drawing graphs as spanners2022-09-16Paper
Perfect matchings with crossings2022-08-30Paper
On weighted sums of numbers of convex polygons in point sets2022-08-25Paper
On crossing-families in planar point sets2022-06-13Paper
Coloring circle arrangements: New $4$-chromatic planar graphs2022-05-17Paper
Edge Partitions of Complete Geometric Graphs (Part 2)2021-12-15Paper
On compatible matchings2021-10-04Paper
Rainbow polygons for colored point sets in the plane2021-06-14Paper
Flip distances between graph orientations2021-02-01Paper
https://portal.mardi4nfdi.de/entity/Q33866252021-01-05Paper
Routing in Polygonal Domains2020-11-25Paper
On the 2-colored crossing number2020-10-26Paper
On the edge-vertex ratio of maximal thrackles2020-10-26Paper
Graphs with large total angular resolution2020-10-26Paper
Routing in polygonal domains2020-04-22Paper
A superlinear lower bound on the number of 5-holes2020-03-20Paper
Flip distances between graph orientations2020-02-24Paper
https://portal.mardi4nfdi.de/entity/Q52078772020-01-13Paper
Packing plane spanning graphs with short edges in complete geometric graphs2019-10-25Paper
On the edge-vertex ratio of maximal thrackles2019-08-23Paper
On the 2-colored crossing number2019-08-18Paper
Transformed flips in triangulations and matchings2019-07-20Paper
Lombardi Drawings of Knots and Links2019-02-20Paper
Perfect \(k\)-colored matchings and \((k+2)\)-gonal tilings2019-01-11Paper
Cross-sections of line configurations in \(\mathbb{R}^3\) and (\(d-2\))-flat configurations in \(\mathbb{R}^d\)2018-11-19Paper
Bishellable drawings of $K_n$2018-11-19Paper
Holes in 2-convex point sets2018-10-31Paper
Intersection Graphs of Rays and Grounded Segments2018-09-06Paper
A superlinear lower bound on the number of 5-holes2018-08-13Paper
Holes in 2-convex point sets2018-06-15Paper
Linear transformation distance for bichromatic matchings2018-04-23Paper
https://portal.mardi4nfdi.de/entity/Q46364912018-04-19Paper
Computing balanced islands in two colored point sets in the plane2018-04-05Paper
Modem illumination of monotone polygons2018-02-19Paper
Linear transformation distance for bichromatic matchings2018-02-19Paper
The dual diameter of triangulations2018-02-19Paper
An improved lower bound on the minimum number of triangulations2018-01-30Paper
Intersection graphs of rays and grounded segments2018-01-04Paper
Representing Directed Trees as Straight Skeletons2017-02-10Paper
A Note on the Number of General 4-holes in (Perturbed) Grids2017-02-01Paper
3-colorability of pseudo-triangulations2016-03-14Paper
Embedding Four-directional Paths on Convex Point Sets2016-01-07Paper
On \(k\)-gons and \(k\)-holes in point sets2015-12-30Paper
\((n,m)\)-fold covers of spheres2015-08-20Paper
GEODESIC-PRESERVING POLYGON SIMPLIFICATION2015-07-01Paper
Empty triangles in good drawings of the complete graph2015-05-22Paper
FLIPS IN COMBINATORIAL POINTED PSEUDO-TRIANGULATIONS WITH FACE DEGREE AT MOST FOUR2015-04-22Paper
Monotone Simultaneous Embeddings of Upward Planar Digraphs2015-03-04Paper
https://portal.mardi4nfdi.de/entity/Q51731632015-02-09Paper
Geodesic order types2015-01-19Paper
Embedding Four-Directional Paths on Convex Point Sets2015-01-07Paper
On \(k\)-convex point sets2014-06-27Paper
4-holes in point sets2014-05-19Paper
Lower bounds for the number of small convex \(k\)-holes2014-04-09Paper
Geodesic-Preserving Polygon Simplification2014-01-14Paper
On 5-Gons and 5-Holes2013-01-07Paper
Blocking Delaunay triangulations2012-12-04Paper
Geodesic Order Types2012-09-25Paper
Pointed drawings of planar graphs2012-09-21Paper
Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons2010-12-03Paper
On the number of plane graphs2010-08-16Paper
Gray code enumeration of plane straight-line graphs2007-12-10Paper
On the number of plane geometric graphs2007-07-19Paper

Research outcomes over time

This page was built for person: Birgit Vogtenhuber