A tight lower bound for vertex planarization on graphs of bounded treewidth (Q2403808): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2963702094
@@ Property / OpenAlex ID: W2963702094 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.08283
@@ Property / arXiv ID: 1511.08283 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On search, decision, and the efficiency of polynomial-time algorithms
+Normal rank
@@ Property / cites work @@
+Efficient Planarity Testing
@@ Property / cites work: Efficient Planarity Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+A Near-Optimal Planarization Algorithm
@@ Property / cites work: A Near-Optimal Planarization Algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Planarity Allowing Few Error Vertices in Linear Time
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+Q4904144
@@ Property / cites work: Q4904144 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5365079
@@ Property / cites work: Q5365079 / rank @@
+Normal rank
@@ Property / cites work @@
+What’s Next? Future Directions in Parameterized Complexity
+Normal rank
@@ Property / cites work @@
+Obtaining a planar graph by vertex deletion
@@ Property / cites work: Obtaining a planar graph by vertex deletion / rank @@
+Normal rank
@@ Property / cites work @@
+Tree-depth, subgraph coloring and homomorphism bounds
+Normal rank
@@ Property / cites work @@
+Sparsity. Graphs, structures, and algorithms
@@ Property / cites work: Sparsity. Graphs, structures, and algorithms / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2403808