The following pages link to Algorithms and Data Structures (Q5394236):
Displaying 34 items.
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714) (← links)
- Definition and algorithms for reliable Steiner tree problem (Q498083) (← links)
- Parameterized algorithm for eternal vertex cover (Q765521) (← links)
- Enumerate and expand: Improved algorithms for connected vertex cover and tree cover (Q929296) (← links)
- Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles (Q958211) (← links)
- On the minimum feedback vertex set problem: Exact and enumeration algorithms (Q958216) (← links)
- Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- Complexity and algorithms for the connected vertex cover problem in 4-regular graphs (Q1735245) (← links)
- Parameterized complexity of multi-node hubs (Q2084737) (← links)
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
- Fixed-parameter tractability for subset feedback set problems with parity constraints (Q2344735) (← links)
- Computing optimal Steiner trees in polynomial space (Q2392926) (← links)
- The connected vertex cover problem in \(k\)-regular graphs (Q2424831) (← links)
- Circumventing connectivity for kernelization (Q2692730) (← links)
- Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics (Q2891355) (← links)
- Combining Two Worlds: Parameterised Approximation for Vertex Cover (Q3060750) (← links)
- Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (Q3448810) (← links)
- A Purely Democratic Characterization of W[1] (Q3503582) (← links)
- Complexity and Approximation Results for the Connected Vertex Cover Problem (Q3508568) (← links)
- Faster Steiner Tree Computation in Polynomial-Space (Q3541105) (← links)
- Graph Layout Problems Parameterized by Vertex Cover (Q3596727) (← links)
- Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover (Q3656855) (← links)
- Covering Vectors by Spaces: Regular Matroids (Q4555045) (← links)
- Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (Q4619482) (← links)
- Parameterized Complexity of Multi-Node Hubs (Q5009470) (← links)
- Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs (Q5041208) (← links)
- On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs (Q5084707) (← links)
- Parameterized Reductions and Algorithms for Another Vertex Cover Generalization (Q5199249) (← links)
- Improved Upper Bounds for Partial Vertex Cover (Q5302059) (← links)
- Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs (Q5361234) (← links)
- (Q5743513) (← links)
- On the partial vertex cover problem in bipartite graphs -- a parameterized perspective (Q6151150) (← links)
- Matroid-constrained vertex cover (Q6162073) (← links)
