Vertex cover problem parameterized above and below tight bounds
From MaRDI portal
(Redirected from Publication:633768)
Recommendations
- A probabilistic approach to problems parameterized above or below tight bounds
- Raising the bar for \textsc{Vertex Cover}: fixed-parameter tractability above a higher guarantee
- Improved Parameterized Upper Bounds for Vertex Cover
- Algorithms and Data Structures
- Parameterized complexity of Vertex Cover variants
Cites work
- scientific article; zbMATH DE number 1286500 (Why is no real title available?)
- scientific article; zbMATH DE number 1979521 (Why is no real title available?)
- scientific article; zbMATH DE number 2090012 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A general method to speed up fixed-parameter-tractable algorithms
- Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)
- Boxicity of graphs with bounded degree
- Capacitated Domination and Covering: A Parameterized Perspective
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- Fixed-parameter algorithms in analysis of heuristics for extracting networks in linear programs
- Parameterized complexity of Vertex Cover variants
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
- Parameterizing above or below guaranteed values
- Scalable parallel algorithms for FPT problems
- Solving large FPT problems on coarse-grained parallel machines
- Synchronization of a bounded degree graph of cellular automata with nonuniform delays in time \(D\lfloor \log_mD\rfloor\)
- The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
- Towards fully multivariate algorithmics: some new results and directions in parameter ecology
- \(E_{11}\) and M theory
Cited in
(27)- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables
- Long directed detours: reduction to 2-disjoint paths
- Tight gaps for vertex cover in the Sherali-Adams SDP hierarchy
- A probabilistic approach to problems parameterized above or below tight bounds
- Combining Two Worlds: Parameterised Approximation for Vertex Cover
- Graph Layout Problems Parameterized by Vertex Cover
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization
- Matroid-constrained vertex cover
- Parameterizing above or below guaranteed values
- A probabilistic approach to problems parameterized above or below tight bounds
- Note on maximal bisection above tight lower bound
- Approximating long cycle above Dirac's guarantee
- A lower bound for the coverability problem in acyclic pushdown VAS
- scientific article; zbMATH DE number 7525484 (Why is no real title available?)
- Raising the bar for \textsc{Vertex Cover}: fixed-parameter tractability above a higher guarantee
- Detours in directed graphs
- Rank vertex cover as a natural problem for algebraic compression
- Domination above \(r\)-independence: does sparseness help?
- Parameterized Reductions and Algorithms for Another Vertex Cover Generalization
- The parameterized complexity of cycle packing: indifference is not an issue
- Algorithms for \((n,3)\)-MAXSAT and parameterization above the all-true assignment
- Going far from degeneracy
- Finding detours is fixed-parameter tractable
- Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems
- Turán’s Theorem Through Algorithmic Lens
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
- Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
This page was built for publication: Vertex cover problem parameterized above and below tight bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q633768)
