Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs (Q3438969): Difference between revisions

@@ Property / cites work @@
+Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Q4699283
@@ Property / cites work: Q4699283 / rank @@
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Partitioning Planar Graphs
@@ Property / cites work: Partitioning Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Approximation Schemes for Maximization Problems onK3,3-free orK5-free Graphs
+Normal rank
@@ Property / cites work @@
+Parallel approximation schemes for problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Diameter and treewidth in minor-closed graph families
+Normal rank
@@ Property / cites work @@
+Q4273877
@@ Property / cites work: Q4273877 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5766469
@@ Property / cites work: Q5766469 / rank @@
+Normal rank