Pages that link to "Item:Q2576350"

The following pages link to Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover (Q2576350):

Displaying 18 items.

• 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 generalization of Nemhauser and Trotter's local optimization theorem (Q657921) (← 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)
• Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
• Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852) (← links)
• Fixed-parameter algorithms for Vertex Cover \(P_3\) (Q1751145) (← links)
• Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes (Q1928521) (← links)
• Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing} (Q2091118) (← links)
• Sparse obstructions for minor-covering parameters (Q2174553) (← links)
• On structural parameterizations of the bounded-degree vertex deletion problem (Q2223699) (← links)
• Kernels for packing and covering problems (Q2272393) (← 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)
• A classification for community discovery methods in complex networks (Q4969805) (← links)
• On the Parameterized Complexity of Maximum Degree Contraction Problem. (Q6089673) (← links)