Beyond Clustered Planar Graphs (Q5001664): Difference between revisions

@@ Property / describes a project that uses @@
+NodeTrix
@@ Property / describes a project that uses: NodeTrix / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-981-15-6533-5_12
+Normal rank
@@ Property / OpenAlex ID @@
+W3089399698
@@ Property / OpenAlex ID: W3089399698 / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing Weak Embeddings of Graphs
@@ Property / cites work: Recognizing Weak Embeddings of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Clustered planarity with pipes
@@ Property / cites work: Clustered planarity with pipes / rank @@
+Normal rank
@@ Property / cites work @@
+Relaxing the constraints of clustered planarity
@@ Property / cites work: Relaxing the constraints of clustered planarity / rank @@
+Normal rank
@@ Property / cites work @@
+Advancements on SEFE and partitioned book embedding problems
+Normal rank
@@ Property / cites work @@
+Testing Planarity of Partially Embedded Graphs
@@ Property / cites work: Testing Planarity of Partially Embedded Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Intersection-Link Representations of Graphs
@@ Property / cites work: Intersection-Link Representations of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Strip planarity testing for embedded planar graphs
+Normal rank
@@ Property / cites work @@
+Turning cliques into paths to achieve planarity
@@ Property / cites work: Turning cliques into paths to achieve planarity / rank @@
+Normal rank
@@ Property / cites work @@
+Computing k-modal embeddings of planar digraphs
@@ Property / cites work: Computing k-modal embeddings of planar digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+A new perspective on clustered planarity as a combinatorial embedding problem
+Normal rank
@@ Property / cites work @@
+On simultaneous planar graph embeddings
@@ Property / cites work: On simultaneous planar graph embeddings / rank @@
+Normal rank
@@ Property / cites work @@
+Partial and Constrained Level Planarity
@@ Property / cites work: Partial and Constrained Level Planarity / rank @@
+Normal rank
@@ Property / cites work @@
+The partial visibility representation extension problem
+Normal rank
@@ Property / cites work @@
+Shrinking the Search Space for Clustered Planarity
+Normal rank
@@ Property / cites work @@
+Computing Maximum C-Planar Subgraphs
@@ Property / cites work: Computing Maximum C-Planar Subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
+Normal rank
@@ Property / cites work @@
+Completely connected clustered graphs
@@ Property / cites work: Completely connected clustered graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Clustered planarity = flat clustered planarity
@@ Property / cites work: Clustered planarity = flat clustered planarity / rank @@
+Normal rank
@@ Property / cites work @@
+C-Planarity of C-Connected Clustered Graphs
@@ Property / cites work: C-Planarity of C-Connected Clustered Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On embedding a cycle in a plane graph
@@ Property / cites work: On embedding a cycle in a plane graph / rank @@
+Normal rank
@@ Property / cites work @@
+Computing NodeTrix Representations of Clustered Graphs
+Normal rank
@@ Property / cites work @@
+Subexponential-time and FPT algorithms for embedded flat clustered planarity
+Normal rank
@@ Property / cites work @@
+C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width.
+Normal rank
@@ Property / cites work @@
+Q3839007
@@ Property / cites work: Q3839007 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
+Normal rank
@@ Property / cites work @@
+Simultaneous Embedding of Planar Graphs with Few Bends
+Normal rank
@@ Property / cites work @@
+Planarity for clustered graphs
@@ Property / cites work: Planarity for clustered graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded Embeddings of Graphs in the Plane
@@ Property / cites work: Bounded Embeddings of Graphs in the Plane / rank @@
+Normal rank
@@ Property / cites work @@
+\(c\)-planarity of embedded cyclic \(c\)-graphs
@@ Property / cites work: \(c\)-planarity of embedded cyclic \(c\)-graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding Graphs into Embedded Graphs
@@ Property / cites work: Embedding Graphs into Embedded Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Hanani-Tutte for approximating maps of graphs
@@ Property / cites work: Hanani-Tutte for approximating maps of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Atomic Embeddability, Clustered Planarity, and Thickenability
+Normal rank
@@ Property / cites work @@
+Clustered Planarity Testing Revisited
@@ Property / cites work: Clustered Planarity Testing Revisited / rank @@
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+Crossing Number is NP-Complete
@@ Property / cites work: Crossing Number is NP-Complete / rank @@
+Normal rank
@@ Property / cites work @@
+NodeTrix planarity testing with small clusters
@@ Property / cites work: NodeTrix planarity testing with small clusters / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Drawing
@@ Property / cites work: Graph Drawing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4422278
@@ Property / cites work: Q4422278 / rank @@
+Normal rank
@@ Property / cites work @@
+Planarity Testing and Optimal Edge Insertion with Embedding Constraints
+Normal rank
@@ Property / cites work @@
+Practical Experience with Hanani-Tutte for Testing c-Planarity
+Normal rank
@@ Property / cites work @@
+Simpler algorithms for testing two-page book embedding of partitioned graphs
+Normal rank
@@ Property / cites work @@
+Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
+Normal rank
@@ Property / cites work @@
+Clustered Planarity: Clusters with Few Outgoing Edges
+Normal rank
@@ Property / cites work @@
+A Kuratowski-type theorem for planarity of partially embedded graphs
+Normal rank
@@ Property / cites work @@
+Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs
+Normal rank
@@ Property / cites work @@
+Simultaneous Embedding with Two Bends per Edge in Polynomial Area
+Normal rank
@@ Property / cites work @@
+Hierarchical planarity testing algorithms
@@ Property / cites work: Hierarchical planarity testing algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Simultaneous FPQ-ordering and hybrid planarity testing
+Normal rank
@@ Property / cites work @@
+Extending convex partial drawings of graphs
@@ Property / cites work: Extending convex partial drawings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants
+Normal rank
@@ Property / cites work @@
+Q3787505
@@ Property / cites work: Q3787505 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5001664