Pages that link to "Item:Q708228"
From MaRDI portal
The following pages link to Improved upper bounds for vertex cover (Q708228):
Displayed 29 items.
- 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 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)
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
- Proper interval vertex deletion (Q1949742) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization (Q2343085) (← links)
- Obtaining matrices with the consecutive ones property by row deletions (Q2343088) (← links)
- New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set (Q2345984) (← links)
- Maximum common induced subgraph parameterized by vertex cover (Q2445395) (← links)
- Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics (Q2891355) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Parameterized Complexity of Vertex Deletion into Perfect Graph Classes (Q3088287) (← links)
- 3-Hitting set on bounded degree hypergraphs: Upper and lower bounds on the kernel size (Q5261045) (← links)