A Linear-Time Algorithm for Finding Induced Planar Subgraphs (Q5140735): Difference between revisions

@@ label / en / label / en @@
+A Linear-Time Algorithm for Finding Induced Planar Subgraphs
@@ Property / DOI @@
-.4230/LIPIcs.SEA.2018.23
@@ Property / DOI: 10.4230/LIPIcs.SEA.2018.23 / rank @@
-Normal rank
@@ Property / cites work @@
+Harmonic functions on planar and almost planar graphs and manifolds, via circle packings
+Normal rank
@@ Property / cites work @@
+On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
+Normal rank
@@ Property / cites work @@
+Crossing and Weighted Crossing Number of Near-Planar Graphs
+Normal rank
@@ Property / cites work @@
+Regular graphs with small skewness and crossing numbers
+Normal rank
@@ Property / cites work @@
+Bar k-Visibility Graphs
@@ Property / cites work: Bar k-Visibility Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for drawing graphs: An annotated bibliography
+Normal rank
@@ Property / cites work @@
+The Crossing-Angle Resolution in Graph Drawing
@@ Property / cites work: The Crossing-Angle Resolution in Graph Drawing / rank @@
+Normal rank
@@ Property / cites work @@
+Q3043706
@@ Property / cites work: Q3043706 / rank @@
+Normal rank
@@ Property / cites work @@
+Planarization and fragmentability of some classes of graphs
+Normal rank
@@ Property / cites work @@
+Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs
+Normal rank
@@ Property / cites work @@
+Q3684121
@@ Property / cites work: Q3684121 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Crossing Number of Almost Planar Graphs
@@ Property / cites work: On the Crossing Number of Almost Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum planar subgraphs and nice embeddings: Practical layout tools
+Normal rank
@@ Property / cites work @@
+Node-Deletion NP-Complete Problems
@@ Property / cites work: Node-Deletion NP-Complete Problems / rank @@
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+Q5530470
@@ Property / cites work: Q5530470 / rank @@
+Normal rank
@@ Property / cites work @@
+The approximation of maximum subgraph problems
@@ Property / cites work: The approximation of maximum subgraph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems
+Normal rank
@@ Property / cites work @@
+A GRASP for graph planarization
@@ Property / cites work: A GRASP for graph planarization / rank @@
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / full work available at URL @@
+http://drops.dagstuhl.de/opus/volltexte/2018/8958/pdf/LIPIcs-SEA-2018-23.pdf/
+Normal rank
@@ Property / OpenAlex ID @@
+W2811281603
@@ Property / OpenAlex ID: W2811281603 / rank @@
+Normal rank
@@ Property / title @@
+A Linear-Time Algorithm for Finding Induced Planar Subgraphs (English)
+Normal rank
@@ Property / DOI @@
+.4230/LIPICS.SEA.2018.23
@@ Property / DOI: 10.4230/LIPICS.SEA.2018.23 / rank @@
+Normal rank