scientific article; zbMATH DE number 1304341
From MaRDI portal
Publication:4251072
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
Cited in
(34)- On two techniques of combining branching and treewidth
- On parameterized exponential time complexity
- A general method to speed up fixed-parameter-tractable algorithms
- Solving large FPT problems on coarse-grained parallel machines
- On the existence of subexponential parameterized algorithms
- Graph separators: A parameterized view
- Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
- The complexity of irredundant sets parameterized by size
- A multivariate framework for weighted FPT algorithms
- A refined search tree technique for dominating set on planar graphs
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
- Parameterized computation and complexity: a new approach dealing with NP-hardness
- Vertex cover: Further observations and further improvements
- The Impact of Parameterized Complexity to Interdisciplinary Problem Solving
- An improved fixed-parameter algorithm for vertex cover
- Maximum minimal vertex cover parameterized by vertex cover
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover}
- Maximum minimal vertex cover parameterized by vertex cover
- Confronting intractability via parameters
- Rank vertex cover as a natural problem for algebraic compression
- Improved Parameterized Upper Bounds for Vertex Cover
- Solving larger maximum clique problems using parallel quantum annealing
- Generating Faster Algorithms for d-Path Vertex Cover
- Improved upper bounds for vertex cover
- Parameterized quantum query algorithms for graph problems
- Component order connectivity admits no polynomial kernel parameterized by the distance to subdivided comb graphs
- Solving partial dominating set and related problems using twin-width
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
- Refined memorization for vertex cover
- Strong computational lower bounds via parameterized complexity
- An efficient fixed-parameter algorithm for 3-hitting set
- On the parameterized vertex cover problem for graphs with perfect matching
- Enumerate and expand: Improved algorithms for connected vertex cover and tree cover
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4251072)
