PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122): Difference between revisions

@@ Property / author @@
-Xiao-hui Huang
@@ Property / author: Xiao-hui Huang / rank @@
-Normal rank
@@ Property / author @@
+Xiao-hui Huang
@@ Property / author: Xiao-hui Huang / 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.1016/j.dam.2017.12.039
+Normal rank
@@ Property / OpenAlex ID @@
+W2794290187
@@ Property / OpenAlex ID: W2794290187 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3337223
@@ Property / cites work: Q3337223 / rank @@
+Normal rank
@@ Property / cites work @@
+Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness
+Normal rank
@@ Property / cites work @@
+On bounded-degree vertex deletion parameterized by treewidth
+Normal rank
@@ Property / cites work @@
+Narrow sieves for parameterized paths and packings
+Normal rank
@@ Property / cites work @@
+On the vertex \(k\)-path cover
@@ Property / cites work: On the vertex \(k\)-path cover / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum \(k\)-path vertex cover
@@ Property / cites work: Minimum \(k\)-path vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+On the weighted \(k\)-path vertex cover problem
@@ Property / cites work: On the weighted \(k\)-path vertex cover problem / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for maximum independent set of pseudo-disks
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for Vertex Cover \(P_3\)
+Normal rank
@@ Property / cites work @@
+A unified approximation algorithm for node-deletion problems
+Normal rank
@@ Property / cites work @@
+Approximating Bounded Degree Deletion via Matroid Matching
+Normal rank
@@ Property / cites work @@
+Faster parameterized algorithms for deletion to split graphs
+Normal rank
@@ Property / cites work @@
+Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier
+Normal rank
@@ Property / cites work @@
+The \(k\)-path vertex cover of rooted product graphs
+Normal rank
@@ Property / cites work @@
+On the \(k\)-path vertex cover of some graph products
+Normal rank
@@ Property / cites work @@
+On computing the minimum 3-path vertex cover and dissociation number of graphs
+Normal rank
@@ Property / cites work @@
+Node-Deletion NP-Complete Problems
@@ Property / cites work: Node-Deletion NP-Complete Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+A 2-approximation algorithm for the vertex cover<i>P</i><sub>4</sub>problem in cubic graphs
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover
+Normal rank
@@ Property / cites work @@
+PTAS for the minimum \(k\)-path connected vertex cover problem in unit disk graphs
+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 @@
+Separators for sphere-packings and nearest neighbor graphs
+Normal rank
@@ Property / cites work @@
+Improved results on geometric hitting set problems
+Normal rank
@@ Property / cites work @@
+A new approach for approximating node deletion problems
+Normal rank
@@ Property / cites work @@
+A fixed-parameter algorithm for the vertex cover \(P_3\) problem
+Normal rank
@@ Property / cites work @@
+The vertex cover \(P_3\) problem in cubic graphs
@@ Property / cites work: The vertex cover \(P_3\) problem in cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem
+Normal rank
@@ Property / cites work @@
+A primal-dual approximation algorithm for the vertex cover \(P^3\) problem
+Normal rank
@@ Property / cites work @@
+A PTAS for minimum weighted connected vertex cover \(P_3\) problem in 3-dimensional wireless sensor networks
+Normal rank
@@ Property / cites work @@
+A PTAS for the minimum weight connected vertex cover \(P_3\) problem on unit disk graphs
+Normal rank
@@ Property / cites work @@
+A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion
+Normal rank
@@ Property / cites work @@
+Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs
+Normal rank
@@ Property / cites work @@
+Node-Deletion Problems on Bipartite Graphs
@@ Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+PTAS for minimum \(k\)-path vertex cover in ball graph
+Normal rank
@@ Property / cites work @@
+Approximation algorithm for the minimum weight connected \(k\)-subgraph cover problem
+Normal rank
@@ Property / cites work @@
+Minimum vertex cover in ball graphs through local search
+Normal rank