Testing gap \(k\)-planarity is NP-complete (Q2032139): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2020.106083
@@ Property / DOI: 10.1016/j.ipl.2020.106083 / rank @@
-Normal rank
@@ Property / author @@
-Jake L. Wellens
@@ Property / author: Jake L. Wellens / rank @@
-Normal rank
@@ Property / author @@
+Jake L. Wellens
@@ Property / author: Jake L. Wellens / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3126317692
@@ Property / OpenAlex ID: W3126317692 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for drawing graphs: An annotated bibliography
+Normal rank
@@ Property / cites work @@
+Empirical evaluation of aesthetics-based graph layout
+Normal rank
@@ Property / cites work @@
+An annotated bibliography on 1-planarity
@@ Property / cites work: An annotated bibliography on 1-planarity / rank @@
+Normal rank
@@ Property / cites work @@
+Crossing Numbers of Graphs
@@ Property / cites work: Crossing Numbers of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the \(k\)-planar local crossing number
@@ Property / cites work: On the \(k\)-planar local crossing number / rank @@
+Normal rank
@@ Property / cites work @@
+Note on \(k\)-planar crossing numbers
@@ Property / cites work: Note on \(k\)-planar crossing numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Crossing Number is NP-Complete
@@ Property / cites work: Crossing Number is NP-Complete / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for graphs embeddable with few crossings per edge
+Normal rank
@@ Property / cites work @@
+Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
+Normal rank
@@ Property / cites work @@
+Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity of 1-Planarity
@@ Property / cites work: Parameterized Complexity of 1-Planarity / rank @@
+Normal rank
@@ Property / cites work @@
+Gap-planar graphs
@@ Property / cites work: Gap-planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
+Normal rank
@@ Property / cites work @@
+On RAC drawings of 1-planar graphs
@@ Property / cites work: On RAC drawings of 1-planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
+Normal rank
@@ Property / cites work @@
+TRÉMAUX TREES AND PLANARITY
@@ Property / cites work: TRÉMAUX TREES AND PLANARITY / rank @@
+Normal rank
@@ Property / cites work @@
+Crossing numbers of beyond-planar graphs
@@ Property / cites work: Crossing numbers of beyond-planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Improving the crossing lemma by finding more crossings in sparse graphs
+Normal rank
@@ Property / cites work @@
+Crossing-Free Subgraphs
@@ Property / cites work: Crossing-Free Subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+New lower bound techniques for VLSI
@@ Property / cites work: New lower bound techniques for VLSI / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2020.106083
@@ Property / DOI: 10.1016/J.IPL.2020.106083 / rank @@
+Normal rank