Pages that link to "Item:Q5133971"
From MaRDI portal
The following pages link to Representative Sets and Irrelevant Vertices (Q5133971):
Displaying 31 items.
- On group feedback vertex set parameterized by the size of the cutset (Q262251) (← links)
- On polynomial kernels for sparse integer linear programs (Q269481) (← links)
- Solving min ones 2-SAT as fast as vertex cover (Q393120) (← links)
- A randomized polynomial kernel for subset feedback vertex set (Q1702849) (← links)
- Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775) (← links)
- On the approximate compressibility of connected vertex cover (Q2006945) (← links)
- Polynomial kernels for vertex cover parameterized by small degree modulators (Q2322700) (← links)
- An exponential lower bound for cut sparsifiers in planar graphs (Q2324242) (← links)
- On kernelization and approximation for the vector connectivity problem (Q2408198) (← links)
- Preprocessing to reduce the search space: antler structures for feedback vertex set (Q2672419) (← links)
- Half-integrality, LP-branching, and FPT Algorithms (Q2816829) (← links)
- Deterministic Truncation of Linear Matroids (Q3448849) (← links)
- Multicut Is FPT (Q4605273) (← links)
- Multi-Budgeted Directed Cuts (Q5009480) (← links)
- Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. (Q5009611) (← links)
- Elimination Distances, Blocking Sets, and Kernels for Vertex Cover (Q5099101) (← links)
- Path-Contractions, Edge Deletions and Connectivity Preservation (Q5111736) (← links)
- Smaller Parameters for Vertex Cover Kernelization (Q5111879) (← links)
- (Q5111883) (← links)
- A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs (Q5163509) (← links)
- Tree Deletion Set Has a Polynomial Kernel but No $\text{OPT}^\mathcal{O}(1)$ Approximation) (Q5741082) (← links)
- An improved FPT algorithm for independent feedback vertex set (Q5918287) (← links)
- Computing subset transversals in \(H\)-free graphs (Q5918462) (← links)
- Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm (Q6115414) (← links)
- On Weighted Graph Separation Problems and Flow Augmentation (Q6187079) (← links)
- Preprocessing to reduce the search space: antler structures for feedback vertex set (Q6564613) (← links)
- Search-space reduction via essential vertices (Q6606914) (← links)
- Representing matroids over the reals is \(\exists \mathbb{R}\)-complete (Q6606993) (← links)
- Single-exponential FPT algorithms for enumerating secluded \(\mathcal{F}\)-free subgraphs and deleting to scattered graph classes (Q6655669) (← links)
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion (Q6670351) (← links)
- AntiFactor is FPT parameterized by treewidth and list size (but counting is hard) (Q6670813) (← links)
