Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2018.05.032
@@ Property / DOI: 10.1016/j.dam.2018.05.032 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2018.05.032
+Normal rank
@@ Property / OpenAlex ID @@
+W2808514443
@@ Property / OpenAlex ID: W2808514443 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes
+Normal rank
@@ Property / cites work @@
+On bounded-degree vertex deletion parameterized by treewidth
+Normal rank
@@ Property / cites work @@
+Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion
+Normal rank
@@ Property / cites work @@
+Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for Vertex Cover \(P_3\)
+Normal rank
@@ Property / cites work @@
+A Linear Kernel for Co-Path/Cycle Packing
@@ Property / cites work: A Linear Kernel for Co-Path/Cycle Packing / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimum vertex cover
+Normal rank
@@ Property / cites work @@
+A generalization of Nemhauser and Trotter's local optimization theorem
+Normal rank
@@ Property / cites work @@
+Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems
+Normal rank
@@ Property / cites work @@
+Exact exponential algorithms.
@@ Property / cites work: Exact exponential algorithms. / rank @@
+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 @@
+A More Relaxed Model for Graph-Based Data Clustering: <i>s</i>-Plex Cluster Editing
+Normal rank
@@ Property / cites work @@
+On computing the minimum 3-path vertex cover and dissociation number of graphs
+Normal rank
@@ Property / cites work @@
+Isolation concepts for efficiently enumerating dense subgraphs
+Normal rank
@@ Property / cites work @@
+Combinatorial algorithms for the maximum \(k\)-plex problem
+Normal rank
@@ Property / cites work @@
+Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
+Normal rank
@@ Property / cites work @@
+Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
+Normal rank
@@ Property / cites work @@
+A new approach for approximating node deletion problems
+Normal rank
@@ Property / cites work @@
+A graph‐theoretic generalization of the clique concept
+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 @@
+An improved kernelization for \(P_{2}\)-packing
@@ Property / cites work: An improved kernelization for \(P_{2}\)-packing / rank @@
+Normal rank
@@ Property / cites work @@
+A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion
+Normal rank
@@ Property / cites work @@
+Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
+Normal rank
@@ Property / cites work @@
+Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
+Normal rank
@@ Property / cites work @@
+Exact algorithms for maximum independent set
@@ Property / cites work: Exact algorithms for maximum independent set / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002782
@@ Property / cites work: Q3002782 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2018.05.032
@@ Property / DOI: 10.1016/J.DAM.2018.05.032 / rank @@
+Normal rank