On the $d$-claw vertex deletion problem (Q6182678): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-023-01144-w
@@ Property / DOI: 10.1007/s00453-023-01144-w / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-023-01144-w
+Normal rank
@@ Property / OpenAlex ID @@
+W4383552485
@@ Property / OpenAlex ID: W4383552485 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for eliminating claws in graphs
+Normal rank
@@ Property / cites work @@
+A fast branching algorithm for cluster vertex deletion
+Normal rank
@@ Property / cites work @@
+Vertex Deletion Problems on Chordal Graphs
@@ Property / cites work: Vertex Deletion Problems on Chordal Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex deletion problems on chordal graphs
@@ Property / cites work: Vertex deletion problems on chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for Vertex Cover \(P_3\)
+Normal rank
@@ Property / cites work @@
+Improved upper bounds for vertex cover
@@ Property / cites work: Improved upper bounds for vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of parameterized algorithms and the complexity of edge modification
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for hitting 3-vertex paths
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Inapproximability of $H$-Transversal/Packing
@@ Property / cites work: Inapproximability of $H$-Transversal/Packing / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Edge Dominating Sets
@@ Property / cites work: Minimum Edge Dominating Sets / rank @@
+Normal rank
@@ Property / cites work @@
+On the \(d\)-claw vertex deletion problem
@@ Property / cites work: On the \(d\)-claw vertex deletion problem / rank @@
+Normal rank
@@ Property / cites work @@
+Analyzing the 3-path vertex cover problem in planar bipartite graphs
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+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 @@
+Q4904144
@@ Property / cites work: Q4904144 / 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 @@
+Hard tiling problems with simple tiles
@@ Property / cites work: Hard tiling problems with simple tiles / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum-weight triangulation is NP-hard
@@ Property / cites work: Minimum-weight triangulation is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+Computing independent sets in graphs with large girth
+Normal rank
@@ Property / cites work @@
+Parameterized algorithm for 3-path vertex cover
@@ Property / cites work: Parameterized algorithm for 3-path vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+Faster parameterized algorithm for cluster vertex deletion
+Normal rank
@@ Property / cites work @@
+Node-Deletion Problems on Bipartite Graphs
@@ Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00453-023-01144-W
@@ Property / DOI: 10.1007/S00453-023-01144-W / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6182678

On the \(d\)-claw vertex deletion problem (Q6182678): Difference between revisions

Latest revision as of 19:12, 30 December 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)