Pages that link to "Item:Q4962217"
From MaRDI portal
The following pages link to Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions (Q4962217):
Displaying 50 items.
- A \(13k\)-kernel for planar feedback vertex set via region decomposition (Q306250) (← links)
- Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
- A linear kernel for planar red-blue dominating set (Q516887) (← links)
- Editing to a planar graph of given degrees (Q730508) (← links)
- A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem (Q743120) (← links)
- Compactors for parameterized counting problems (Q826317) (← links)
- Characterising bounded expansion by neighbourhood complexity (Q1621072) (← links)
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
- Bivariate complexity analysis of \textsc{Almost Forest Deletion} (Q1686068) (← links)
- Explicit linear kernels for packing problems (Q1739112) (← links)
- Paths to trees and cacti (Q1998842) (← links)
- Twin-width and polynomial kernels (Q2093574) (← links)
- Towards constant-factor approximation for chordal/distance-hereditary vertex deletion (Q2149107) (← links)
- Distance from triviality 2.0: hybrid parameterizations (Q2169932) (← links)
- Lower bounds for protrusion replacement by counting equivalence classes (Q2174552) (← links)
- Sparse obstructions for minor-covering parameters (Q2174553) (← links)
- Polynomial kernels for hitting forbidden minors under structural parameterizations (Q2202024) (← links)
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs (Q2316938) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (Q2324243) (← links)
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (Q2408197) (← links)
- On kernelization and approximation for the vector connectivity problem (Q2408198) (← links)
- A polynomial kernel for block graph deletion (Q2408204) (← links)
- Quick but odd growth of cacti (Q2408205) (← links)
- Meta-kernelization using well-structured modulators (Q2413976) (← links)
- Finite Integer Index of Pathwidth and Treewidth (Q2946024) (← links)
- Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property (Q3181061) (← links)
- Editing to a Planar Graph of Given Degrees (Q3194713) (← links)
- Bivariate Complexity Analysis of Almost Forest Deletion (Q3196379) (← links)
- Bidimensionality and Kernels (Q3387764) (← links)
- Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets (Q3448816) (← links)
- Uniform Kernelization Complexity of Hitting Forbidden Minors (Q3448821) (← links)
- A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity (Q3452840) (← links)
- Approximation and Kernelization for Chordal Vertex Deletion (Q4586151) (← links)
- Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. (Q5009611) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- Modification to Planarity is Fixed Parameter Tractable (Q5090477) (← links)
- (Q5091010) (← links)
- (Q5111863) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs (Q5111869) (← links)
- Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds (Q5130572) (← links)
- (Q5136298) (← links)
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes (Q5150814) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q5234662) (← links)
- A naive algorithm for feedback vertex set (Q5240414) (← links)
- Paths to Trees and Cacti (Q5283353) (← links)
- (Q5326596) (redirect page) (← links)
- First-Order Model-Checking in Random Graphs and Complex Networks (Q5874510) (← links)
- On the number of labeled graphs of bounded treewidth (Q5915790) (← links)
- A polynomial kernel for distance-hereditary vertex deletion (Q5918311) (← links)
- (Q6065472) (← links)
