Pages that link to "Item:Q2464323"
From MaRDI portal
The following pages link to Crown structures for vertex cover kernelization (Q2464323):
Displaying 41 items.
- 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)
- Improved kernel results for some FPT problems based on simple observations (Q507431) (← links)
- Crowns in bipartite graphs (Q510531) (← links)
- Separator-based data reduction for signed graph balancing (Q613659) (← links)
- A generalization of Nemhauser and Trotter's local optimization theorem (Q657921) (← links)
- An improved kernelization algorithm for \(r\)-set packing (Q765496) (← links)
- A kernelization algorithm for \(d\)-hitting set (Q988567) (← links)
- A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing (Q1628680) (← links)
- A \(2k\)-kernelization algorithm for vertex cover based on crown decomposition (Q1643162) (← links)
- Critical and maximum independent sets of a graph (Q1671323) (← links)
- On upper bounds for the independent transversal domination number (Q1693131) (← links)
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes (Q1928521) (← links)
- Nearly optimal robust secret sharing against rushing adversaries (Q2102061) (← links)
- Critical sets, crowns and local maximum independent sets (Q2149605) (← links)
- Reoptimization of parameterized problems (Q2170282) (← links)
- Kernels for packing and covering problems (Q2272393) (← links)
- Efficient parallel algorithms for parameterized problems (Q2319897) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (Q2324243) (← links)
- Linear kernels for separating a graph into components of bounded size (Q2361357) (← links)
- From matchings to independent sets (Q2403787) (← links)
- On the kernelization of split graph problems (Q2636501) (← links)
- Preprocessing to reduce the search space: antler structures for feedback vertex set (Q2672419) (← links)
- Hitting Forbidden Minors: Approximation and Kernelization (Q2790404) (← links)
- On the Power of Simple Reductions for the Maximum Independent Set Problem (Q2817877) (← links)
- FPT is characterized by useful obstruction sets (Q2828222) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- On the Parameterized Parallel Complexity and the Vertex Cover Problem (Q2958339) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs (Q3656864) (← links)
- Kernelization of Two Path Searching Problems on Split Graphs (Q4632190) (← links)
- Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments (Q5009617) (← links)
- Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems (Q5048305) (← links)
- Autarkies and Persistencies for QUBO (Q5050145) (← links)
- Data Reduction for Maximum Matching on Real-World Graphs (Q5102046) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs (Q5111869) (← links)
- Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)
- Parameterized certificate dispersal and its variants (Q5964075) (← links)
- Kernelization for feedback vertex set via elimination distance to a forest (Q6153475) (← links)
- Preprocessing to reduce the search space: antler structures for feedback vertex set (Q6564613) (← links)
