Pages that link to "Item:Q657921"
From MaRDI portal
The following pages link to A generalization of Nemhauser and Trotter's local optimization theorem (Q657921):
Displayed 35 items.
- Linear-vertex kernel for the problem of packing \(r\)-stars into a graph without long induced paths (Q264204) (← links)
- Kernelization of the 3-path vertex cover problem (Q279214) (← links)
- Win-win kernelization for degree sequence completion problems (Q295647) (← links)
- Graph isomorphism parameterized by elimination distance to bounded degree (Q309797) (← links)
- On a generalization of Nemhauser and Trotter's local optimization theorem (Q340561) (← links)
- Parameterized complexity of three edge contraction problems with degree constraints (Q471188) (← links)
- A fixed-parameter algorithm for the vertex cover \(P_3\) problem (Q477591) (← links)
- On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
- Complexity and kernels for bipartition into degree-bounded induced graphs (Q730002) (← links)
- On bounded-degree vertex deletion parameterized by treewidth (Q765338) (← links)
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- Isolation concepts for efficiently enumerating dense subgraphs (Q837155) (← links)
- Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852) (← links)
- Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
- Fixed-parameter algorithms for Vertex Cover \(P_3\) (Q1751145) (← links)
- Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing} (Q2091118) (← links)
- Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs (Q2193275) (← links)
- On structural parameterizations of the bounded-degree vertex deletion problem (Q2223699) (← links)
- Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs (Q2341756) (← links)
- Linear kernels for separating a graph into components of bounded size (Q2361357) (← links)
- Edge-disjoint packing of stars and cycles (Q2629232) (← links)
- A Parameterized Algorithm for Bounded-Degree Vertex Deletion (Q2817850) (← links)
- A 2-approximation algorithm for the vertex cover<i>P</i><sub>4</sub>problem in cubic graphs (Q2931950) (← links)
- Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs (Q2942649) (← links)
- Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857) (← links)
- A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion (Q3196407) (← links)
- On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem (Q3304132) (← links)
- Edge-Disjoint Packing of Stars and Cycles (Q3467879) (← links)
- Approximating Partially Bounded Degree Deletion on Directed Graphs (Q5240368) (← links)
- Approximating Bounded Degree Deletion via Matroid Matching (Q5283370) (← links)
- Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses (Q5501928) (← links)
- A \(5k\)-vertex kernel for 3-path vertex cover (Q6041673) (← links)
- Approximating power node-deletion problems (Q6057334) (← links)
- On the Parameterized Complexity of Maximum Degree Contraction Problem. (Q6089673) (← links)
- Maximum weight <i>t</i>-sparse set problem on vector-weighted graphs (Q6140983) (← links)