Recommendations
Cites work
- scientific article; zbMATH DE number 3889282 (Why is no real title available?)
- scientific article; zbMATH DE number 3904619 (Why is no real title available?)
- scientific article; zbMATH DE number 125608 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1304341 (Why is no real title available?)
- scientific article; zbMATH DE number 1025912 (Why is no real title available?)
- scientific article; zbMATH DE number 1507224 (Why is no real title available?)
- scientific article; zbMATH DE number 1508265 (Why is no real title available?)
- A general method to speed up fixed-parameter-tractable algorithms
- A measure \& conquer approach for the analysis of exact algorithms
- Algorithms and Data Structures
- Algorithms for maximum independent sets
- An improved fixed-parameter algorithm for vertex cover
- Automata, Languages and Programming
- Crown reductions for the minimum weighted vertex cover problem
- Graph-Theoretic Concepts in Computer Science
- Graph-Theoretic Concepts in Computer Science
- Graph-Theoretic Concepts in Computer Science
- Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems
- Nondeterminism within $P^ * $
- On efficient fixed-parameter algorithms for weighted vertex cover
- On the existence of subexponential parameterized algorithms
- Open problems around exact algorithms
- Parameterized and Exact Computation
- Parameterized and Exact Computation
- Parameterized and Exact Computation
- Refined memorization for vertex cover
- Solving large FPT problems on coarse-grained parallel machines
- Vertex cover: Further observations and further improvements
- Vertex packings: Structural properties and algorithms
- Which problems have strongly exponential complexity?
Cited in
(only showing first 100 items - show all)- Multivariate algorithmics for finding cohesive subnetworks
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover}
- Parameterized complexity of vertex deletion into perfect graph classes
- Solving min ones 2-SAT as fast as vertex cover
- Grouped domination parameterized by vertex cover, twin cover, and beyond
- A parameterized complexity view on collapsing \(k\)-cores
- Compactors for parameterized counting problems
- scientific article; zbMATH DE number 6515825 (Why is no real title available?)
- Efficient algorithms for the max \(k\)-vertex cover problem
- Efficient parallel algorithms for parameterized problems
- Backdoors for linear temporal logic
- Decremental Optimization of Dominating Sets Under the Reconfiguration Framework
- scientific article; zbMATH DE number 7559376 (Why is no real title available?)
- Conflict free version of covering problems on graphs: classical and parameterized
- Exact algorithms for restricted subset feedback vertex set in chordal and split graphs
- An articulation point-based approximation algorithm for minimum vertex cover problem
- Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems
- A measure and conquer approach for the parameterized bounded degree-one vertex deletion
- Refined memorization for vertex cover
- Solving larger maximum clique problems using parallel quantum annealing
- Improved Upper Bounds for Partial Vertex Cover
- Winner determination algorithms for graph games with matching structures
- Above guarantee parameterization for vertex cover on graphs with maximum degree 4
- On kernels for \(d\)-path vertex cover
- Parameterized algorithms for fixed-order book drawing with few crossings per edge
- Tractability in constraint satisfaction problems: a survey
- A refined branching algorithm for the maximum satisfiability problem
- Vertex-bipartition: a unified approach for kernelization of graph linear layout problems parameterized by vertex cover
- Strong Backdoors for Default Logic
- On computing the minimum 3-path vertex cover and dissociation number of graphs
- Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes
- A randomized polynomial kernelization for vertex cover with a smaller parameter
- Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants
- What's next? Future directions in parameterized complexity
- Parameterized and Exact Computation
- A basic parameterized complexity primer
- Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion}
- Vertex cover: Further observations and further improvements
- Structural parameterization of alliance problems
- Computing connected-\(k\)-subgraph cover with connectivity requirement
- A polynomial kernel for 3-leaf power deletion
- scientific article; zbMATH DE number 1420918 (Why is no real title available?)
- A note on the parameterized complexity of unordered maximum tree orientation
- On efficient fixed-parameter algorithms for weighted vertex cover
- Winner determination algorithms for graph games with matching structures
- Proper interval vertex deletion
- Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization
- Obtaining matrices with the consecutive ones property by row deletions
- On families of categorial grammars of bounded value, their learnability and related complexity questions
- Algorithms and Computation
- Parameterized complexity of optimizing list vertex-coloring through reconfiguration
- Reducing the vertex cover number via edge contractions
- Quick separation in chordal and split graphs
- Parameterized complexity of \textsc{maximum edge colorable subgraph}
- On the complexity of wafer-to-wafer integration
- Exact and parameterized algorithms for restricted subset feedback vertex set in chordal graphs
- Dynamic parameterized problems
- An improved fixed-parameter algorithm for vertex cover
- Polynomial kernels for vertex cover parameterized by small degree modulators
- On the upward book thickness problem: combinatorial and complexity results
- Slightly superexponential parameterized problems
- A refined algorithm for maximum independent set in degree-4 graphs
- Parameterized pre-coloring extension and list coloring problems
- The monotone circuit value problem with bounded genus is in NC
- Maximum independent sets near the upper bound
- Implicit branching and parameterized partial cover problems
- A 2k-kernelization algorithm for vertex cover based on crown decomposition
- Parameterized algorithms for book embedding problems
- Search-space reduction via essential vertices
- Backdoors to satisfaction
- Parameterized complexity of vertex deletion into perfect graph classes
- Parameterized algorithms for queue layouts
- On the complexity landscape of the domination chain
- Rank vertex cover as a natural problem for algebraic compression
- On optimal approximability results for computing the strong metric dimension
- On finding separators in temporal split and permutation graphs
- Grouped domination parameterized by vertex cover, twin cover, and beyond
- Preprocessing to reduce the search space: antler structures for feedback vertex set
- Improved bounds for covering complete uniform hypergraphs
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning
- Improved Parameterized Upper Bounds for Vertex Cover
- Maximum common induced subgraph parameterized by vertex cover
- \(b\)-coloring parameterized by clique-width
- Parameterized algorithms for linear layouts of graphs with respect to the vertex cover number
- Fixed-parameter algorithms for computing RAC drawings of graphs
- Parameterized complexity of simultaneous planarity
- The parametrized complexity of the segment number
- Approximation algorithm and FPT algorithm for connected-\(k\)-subgraph cover on minor-free graphs
- Lower bounds for the graph homomorphism problem
- Parameterized and exact algorithms for class domination coloring
- Fixed-parameter tractability for book drawing with bounded number of crossings per edge
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability
- Parameterized and exact algorithms for class domination coloring
- New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
- Parameterized algorithms for book embedding problems
- What Is Known About Vertex Cover Kernelization?
- Confronting intractability via parameters
- Algorithmic meta-theorems for combinatorial reconfiguration revisited
This page was built for publication: Improved upper bounds for vertex cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708228)
