C-planarity testing of embedded clustered graphs with bounded dual carving-width
type: Item
instance of: scholarly article
title: C-planarity testing of embedded clustered graphs with bounded dual carving-width
author: Giordano Da Lozzo
author: David Eppstein
author: Michael T. Goodrich
author: Siddharth Gupta
published in: Algorithmica
publication date: 2021-07-26T00:00:00Z
full work available at URL: https://arxiv.org/abs/1910.02057
Mathematics Subject Classification ID: 68Wxx
Mathematics Subject Classification ID: 05Cxx
zbMATH DE Number: 7374880
zbMATH Keywords: clustered planarity
zbMATH Keywords: carving-width
zbMATH Keywords: non-crossing partitions
zbMATH Keywords: fixed-parameter tractability
describes a project that uses: Algorithm 447
describes a project that uses: GDToolkit
describes a project that uses: NodeTrix
MaRDI profile type: Publication
OpenAlex ID: W3170034319
cites work: On the Boolean-Width of a Graph: Structure and Applications
cites work: Q4607898
cites work: Clustered planarity with pipes
cites work: Beyond Clustered Planar Graphs
cites work: Strip planarity testing for embedded planar graphs
cites work: Relaxing the constraints of clustered planarity
cites work: Intersection-Link Representations of Graphs
cites work: The Importance of Being Proper
cites work: Straight-line rectangular drawings of clustered graphs
cites work: Planarity of Overlapping Clusterings Including Unions of Two Partitions
cites work: Simultaneous Embeddability of Two Partitions
cites work: The point-set embeddability problem for plane graphs
cites work: An Almost Linear-Time Algorithm for Graph Realization
cites work: A new perspective on clustered planarity as a combinatorial embedding problem
cites work: Treewidth of planar graphs: connections with duality
cites work: Graph Drawing
cites work: Blocks of Hypergraphs
cites work: Path-based supports for hypergraphs
cites work: On planar supports for hypergraphs
cites work: Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
cites work: Shrinking the Search Space for Clustered Planarity
cites work: Completely connected clustered graphs
cites work: C-Planarity of C-Connected Clustered Graphs
cites work: On embedding a cycle in a plane graph
cites work: Clustered planarity = flat clustered planarity
cites work: Handle-rewriting hypergraph grammars
cites work: Computing NodeTrix Representations of Clustered Graphs
cites work: Subexponential-time and FPT algorithms for embedded flat clustered planarity
cites work: C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width.
cites work: Q3839007
cites work: Q3043705
cites work: Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
cites work: Overlapping Cluster Planarity
cites work: Planarity for clustered graphs
cites work: SOFSEM 2004: Theory and Practice of Computer Science
cites work: Hanani-Tutte for approximating maps of graphs
cites work: Clustered Planarity Testing Revisited
cites work: Clustered planarity testing revisited
cites work: Atomic Embeddability, Clustered Planarity, and Thickenability
cites work: Q2716030
cites work: Fibonacci and Catalan numbers. An introduction
cites work: Optimal branch-decomposition of planar graphs in O ( n 3 ) Time
cites work: Q4422278
cites work: Practical Experience with Hanani-Tutte for Testing c-Planarity
cites work: Convex drawings of hierarchical planar graphs and clustered planar graphs
cites work: Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs
cites work: Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
cites work: Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs
cites work: Hypergraph planarity and the complexity of drawing venn diagrams
cites work: Subdivision Drawings of Hypergraphs
cites work: Drawing \(c\)-planar biconnected clustered graphs
cites work: Approximating clique-width and branch-width
cites work: Graph minors. X: Obstructions to tree-decomposition
cites work: Dynamic programming for graphs on surfaces
cites work: Toward a theory of planarity: Hanani-Tutte and planarity variants
cites work: Call routing and the ratcatcher
cites work: Q4472491

C-planarity testing of embedded clustered graphs with bounded dual carving-width (cites work)
cites work: Twins in Subdivision Drawings of Hypergraphs

C-planarity testing of embedded clustered graphs with bounded dual carving-width (DOI)
DOI: 10.1007/S00453-021-00839-2