Pages that link to "Item:Q708228"
From MaRDI portal
The following pages link to Improved upper bounds for vertex cover (Q708228):
Displayed 50 items.
- On the ordered list subgraph embedding problems (Q270006) (← links)
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Treewidth and pathwidth parameterized by the vertex cover number (Q344839) (← links)
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
- Parameterized complexity of vertex deletion into perfect graph classes (Q392038) (← links)
- Solving min ones 2-SAT as fast as vertex cover (Q393120) (← links)
- A note on the parameterized complexity of unordered maximum tree orientation (Q427909) (← links)
- Local search: is brute-force avoidable? (Q439931) (← links)
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281) (← links)
- Complexity of conflict-free colorings of graphs (Q484316) (← links)
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714) (← links)
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem (Q511682) (← links)
- On optimal approximability results for computing the strong metric dimension (Q512531) (← links)
- On computing the minimum 3-path vertex cover and dissociation number of graphs (Q650941) (← links)
- Implicit branching and parameterized partial cover problems (Q657922) (← links)
- On families of categorial grammars of bounded value, their learnability and related complexity questions (Q714784) (← links)
- Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover (Q714786) (← links)
- Dynamic parameterized problems (Q722546) (← links)
- A parameterized complexity view on collapsing \(k\)-cores (Q825978) (← links)
- Compactors for parameterized counting problems (Q826317) (← links)
- An exact algorithm for maximum independent set in degree-5 graphs (Q896662) (← links)
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover (Q897878) (← links)
- A \(2k\)-kernelization algorithm for vertex cover based on crown decomposition (Q1643162) (← links)
- Approximation for vertex cover in \(\beta\)-conflict graphs (Q1679502) (← links)
- A refined algorithm for maximum independent set in degree-4 graphs (Q1680494) (← links)
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
- Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
- The many facets of upper domination (Q1704853) (← links)
- Backdoors for linear temporal logic (Q1725638) (← links)
- Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
- Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087) (← links)
- On the complexity of wafer-to-wafer integration (Q1751193) (← links)
- Extended formulations for vertex cover (Q1790198) (← links)
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
- Proper interval vertex deletion (Q1949742) (← links)
- Parameterized complexity of \textsc{maximum edge colorable subgraph} (Q2019513) (← links)
- Maximum independent sets near the upper bound (Q2026337) (← links)
- An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses (Q2051907) (← links)
- Parameterized complexity of maximum edge colorable subgraph (Q2088595) (← links)
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- Above guarantee parameterization for vertex cover on graphs with maximum degree 4 (Q2111076) (← links)
- A refined branching algorithm for the maximum satisfiability problem (Q2118385) (← links)
- An improved deterministic parameterized algorithm for cactus vertex deletion (Q2135634) (← links)
- Parameterized algorithms for linear layouts of graphs with respect to the vertex cover number (Q2150579) (← links)
- Fixed-parameter tractability for book drawing with bounded number of crossings per edge (Q2151389) (← links)