scientific article; zbMATH DE number 7559402

DOI10.4230/LIPIcs.MFCS.2020.31MaRDI QIDQ5089197

Martin Nöllenburg, Fabian Klute, Eduard Eiben, Thekla Hamm, Robert Ganian

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/2007.05346

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

extension problems\(1\)-planarity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

Parameterized analysis and crossing minimization problems ⋮ Planarizing graphs and their drawings by vertex splitting ⋮ Inserting one edge into a simple drawing is hard

Cites Work

• Unnamed Item
• Extending convex partial drawings of graphs
• Kernelization using structural parameters on sparse graph classes
• Fundamentals of parameterized complexity
• Extending partial representations of proper and unit interval graphs
• The partial visibility representation extension problem
• How to draw a planar graph on a grid
• L-visibility drawings of IC-planar graphs
• Convex drawings of graphs with non-convex boundary constraints
• Graphs drawn with few crossings per edge
• Extending simple drawings
• Extending partial representations of subclasses of chordal graphs
• Ein Sechsfarbenproblem auf der Kugel
• An annotated bibliography on 1-planarity
• Extending partial representations of interval graphs
• Algorithms for graphs embeddable with few crossings per edge
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Extending Partial Representations of Circle Graphs
• Extending Partial Representations of Function Graphs and Permutation Graphs
• Contact Representations of Planar Graphs: Extending a Partial Representation is Hard
• Chromatic number, independence ratio, and crossing number
• Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
• Recognizing IC-Planar and NIC-Planar Graphs
• Partial and Constrained Level Planarity
• Testing Planarity of Partially Embedded Graphs
• Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard
• ON EXTENDING A PARTIAL STRAIGHT-LINE DRAWING
• Parameterized Algorithms
• Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area
• Extending upward planar graph drawings
• Drawing Partially Embedded and Simultaneously Planar Graphs
• Embedding planar graphs at fixed vertex locations