Highly connected Steiner subgraph: parameterized algorithms and applications to hitting set problems
From MaRDI portal
Cites work
- \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms
- A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting
- A quartic kernel for pathwidth-one vertex deletion
- Cutwidth I: A linear time fixed parameter algorithm
- Deletion to scattered graph classes. I: Case of finite number of graph classes
- Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes
- Derivation of algorithms for cutwidth and related graph layout parameters
- Deterministic algorithms for matching and packing problems based on representative sets
- Deterministic truncation of linear matroids
- Efficient computation of representative families with applications in parameterized and exact algorithms
- Fast exact algorithms for survivable network design with uniform requirements
- Faster FPT algorithm for 5-path vertex cover
- Finding a highly connected Steiner subgraph and its applications
- Forbidden graphs for tree-depth
- Fundamentals of parameterized complexity
- Generating Faster Algorithms for d-Path Vertex Cover
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Multi-Terminal Network Flows
- Multivariate algorithmics for finding cohesive subnetworks
- On subexponential parameterized algorithms for Steiner tree and directed subset TSP on planar graphs
- On the parameterized complexity of finding separators with non-hereditary properties
- Parameterized algorithms
- Parameterized algorithms for finding highly connected solution
- Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage
- Randomized divide-and-conquer: improved path, matching, and packing algorithms
- The complexity landscape of fixed-parameter directed Steiner network problems
- The parameterized complexity of the survivable network design problem
- The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel
- Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions)
- Uniform kernelization complexity of hitting forbidden minors
This page was built for publication: Highly connected Steiner subgraph: parameterized algorithms and applications to hitting set problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7230926)
