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)- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
- Finding small satisfying assignments faster than brute force: a fine-grained perspective into boolean constraint satisfaction
- Algorithmic aspects of \textsc{Upper Domination}: a parameterised perspective
- An exact algorithm for maximum independent set in degree-5 graphs
- Extended formulations for vertex cover
- Maximum minimal vertex cover parameterized by vertex cover
- On the complexity of the storyplan problem
- An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses
- 3-hitting set on bounded degree hypergraphs: upper and lower bounds on the kernel size
- Your rugby mates don't need to know your colleagues: triadic closure with edge colors
- Treewidth and pathwidth parameterized by the vertex cover number
- Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover
- Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover
- Parameterized complexity of weighted target set selection
- The parameterized complexity of maximum betweenness centrality
- Fixed-parameter algorithms for computing bend-restricted RAC drawings of graphs
- On the parameterized complexity of vertex cover and edge cover with connectivity constraints
- Parameterized analysis and crossing minimization problems
- Preprocessing to reduce the search space: antler structures for feedback vertex set
- Approximation for vertex cover in -conflict graphs
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem
- An algorithmic framework for locally constrained homomorphisms
- Complexity of conflict-free colorings of graphs
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem}
- On the parameterized complexity of computing balanced partitions in graphs
- Backdoors to tractable answer set programming
- Parameterized approximation via fidelity preserving transformations
- Parameterizing path partitions
- Exploring the gap between treedepth and vertex cover through vertex integrity
- scientific article; zbMATH DE number 7278081 (Why is no real title available?)
- Generating Faster Algorithms for d-Path Vertex Cover
- Parameterized Complexity of Broadcasting in Graphs
- The many facets of upper domination
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
- Intuitive Algorithms and t-Vertex Cover
- On the \(d\)-claw vertex deletion problem
- A multivariate approach for weighted FPT algorithms
- An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem
- Faster exact algorithms for some terminal set problems
- On the \(d\)-claw vertex deletion problem
- Faster FPT algorithm for 5-path vertex cover
- Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
- Local search: is brute-force avoidable?
- On the upward book thickness problem: combinatorial and complexity results
- Why is maximum clique often easy in practice?
- On the parameterized parallel complexity and the vertex cover problem
- Solving vertex cover in polynomial time on hyperbolic random graphs
- Maximum minimal vertex cover parameterized by vertex cover
- Parameterized complexity of maximum edge colorable subgraph
- Worst-case analysis of clique MIPs
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
- scientific article; zbMATH DE number 1979504 (Why is no real title available?)
- The graph motif problem parameterized by the structure of the input graph
- A multivariate framework for weighted FPT algorithms
- Resolving conflicts for lower-bounded clustering
- Parameterized approximation algorithms for weighted vertex cover
- Parameterized algorithms for minimum sum vertex cover
- On the parameterized complexity of non-hereditary relaxations of clique
- A parameterized algorithm for bounded-degree vertex deletion
- Parameterized Algorithms for Queue Layouts
- An improved deterministic parameterized algorithm for cactus vertex deletion
- 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
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)
