Pages that link to "Item:Q2473030"

The following pages link to Crown reductions for the minimum weighted vertex cover problem (Q2473030):

Displaying 29 items.

• Polynomial kernels for weighted problems (Q340549) (← links)
• On a generalization of Nemhauser and Trotter's local optimization theorem (Q340561) (← links)
• Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
• On bounded block decomposition problems for under-specified systems of equations (Q414888) (← links)
• Lower bounds on kernelization (Q456702) (← links)
• Blockers for the stability number and the chromatic number (Q489343) (← links)
• A kernel of order \(2k - c\) for Vertex Cover (Q534063) (← links)
• A generalization of Nemhauser and Trotter's local optimization theorem (Q657921) (← links)
• Improved upper bounds for vertex cover (Q708228) (← links)
• Connection between conjunctive capacity and structural properties of graphs (Q744094) (← links)
• The union of minimal hitting sets: parameterized combinatorial bounds and counting (Q1044023) (← links)
• Critical and maximum independent sets of a graph (Q1671323) (← links)
• A kernel of order \(2k-c\log k\) for vertex cover (Q1944208) (← links)
• Critical sets, crowns and local maximum independent sets (Q2149605) (← links)
• Kernels for packing and covering problems (Q2272393) (← links)
• On sparsification for computing treewidth (Q2343087) (← links)
• Linear kernels for separating a graph into components of bounded size (Q2361357) (← links)
• \(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs (Q2376794) (← links)
• A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
• Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey (Q2908541) (← links)
• Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q2946427) (← links)
• Parameterized Power Vertex Cover (Q3181050) (← links)
• A Multivariate Approach for Weighted FPT Algorithms (Q3452855) (← links)
• Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q4588848) (← links)
• Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems (Q5048305) (← links)
• Data Reduction for Maximum Matching on Real-World Graphs (Q5102046) (← links)
• Smaller Parameters for Vertex Cover Kernelization (Q5111879) (← links)
• Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)
• Kernelization for feedback vertex set via elimination distance to a forest (Q6153475) (← links)