Miriam Goetze

According to our database, Miriam Goetze authored at least 8 papers between 2022 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2026

Recognition Complexity of Subgraphs of bf k-Connected Planar Cubic Graphs.

Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt

Algorithmica, February, 2026

The r-dynamic chromatic number is bounded in the strong 2-coloring number.

Miriam Goetze, Torsten Ueckerdt

Discret. Math., 2026

2025

Boundedness and Separation in the Graph Covering Number Framework.

Miriam Goetze, Peter Stumpf, Torsten Ueckerdt

CoRR, April, 2025

Crossing Number of 3-Plane Drawings.

Miriam Goetze, Michael Hoffmann, Ignaz Rutter, Torsten Ueckerdt

CoRR, March, 2025

Saturated Drawings of Geometric Thickness k.

Patricia Bachmann, Anna Brötzner, Miriam Goetze, Philipp Kindermann, Matthias Pfretzschner, Soeren Terziadis

CoRR, March, 2025

Crossing Number of Simple 3-Plane Drawings.

Miriam Goetze, Michael Hoffmann, Ignaz Rutter, Torsten Ueckerdt

Proceedings of the 33rd International Symposium on Graph Drawing and Network Visualization, 2025

2024

Recognition Complexity of Subgraphs of 2- and 3-Connected Planar Cubic Graphs.

Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt

CoRR, 2024

2022

Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs.

Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt

Proceedings of the 30th Annual European Symposium on Algorithms, 2022