Pages that link to "Item:Q820151"
From MaRDI portal
The following pages link to Parameterized graph separation problems (Q820151):
Displaying 50 items.
- Parameterized complexity of the anchored \(k\)-core problem for directed graphs (Q259037) (← links)
- On group feedback vertex set parameterized by the size of the cutset (Q262251) (← links)
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Multicut in trees viewed through the eyes of vertex cover (Q440014) (← links)
- Restricted vertex multicut on permutation graphs (Q444445) (← links)
- FPT algorithms for path-transversal and cycle-transversal problems (Q456698) (← links)
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- On the parameterized complexity of finding separators with non-hereditary properties (Q494799) (← links)
- \textsc{Max-Cut} parameterized above the Edwards-Erdős bound (Q494801) (← links)
- On the complexity of computing the \(k\)-restricted edge-connectivity of a graph (Q501666) (← links)
- Parameterized complexity of critical node cuts (Q517024) (← links)
- List H-coloring a graph by removing few vertices (Q527415) (← links)
- Multi-budgeted directed cuts (Q786027) (← links)
- Improved parameterized and exact algorithms for cut problems on trees (Q896125) (← links)
- Simple and improved parameterized algorithms for multiterminal cuts (Q987378) (← links)
- Constant ratio fixed-parameter approximation of the edge multicut problem (Q990949) (← links)
- Almost 2-SAT is fixed-parameter tractable (Q1034100) (← links)
- On the complexity of barrier resilience for fat regions and bounded ply (Q1615674) (← links)
- The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut (Q1728091) (← links)
- The critical node detection problem in networks: a survey (Q1750314) (← links)
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342) (← links)
- Solution methods for the vertex variant of the network system vulnerability analysis problem (Q2017536) (← links)
- The maximum happy induced subgraph problem: bounds and algorithms (Q2026981) (← links)
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs (Q2032354) (← links)
- Finding all leftmost separators of size \(\le k\) (Q2149878) (← links)
- Critical node detection problem for complex network in undirected weighted networks (Q2164641) (← links)
- \(\ell_p\)-norm multiway cut (Q2165036) (← links)
- Finding connected secluded subgraphs (Q2186823) (← links)
- On integer and bilevel formulations for the \(k\)-vertex cut problem (Q2195678) (← links)
- Faster graph bipartization (Q2301359) (← links)
- Subset feedback vertex set on graphs of bounded independent set size (Q2304562) (← links)
- On the parameterized complexity of separating certain sources from the target (Q2330108) (← links)
- Faster exact algorithms for some terminal set problems (Q2361353) (← links)
- Linear kernels for separating a graph into components of bounded size (Q2361357) (← links)
- A logical approach to multicut problems (Q2379958) (← links)
- An improved parameterized algorithm for the minimum node multiway cut problem (Q2391180) (← links)
- Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830) (← links)
- The vertex \(k\)-cut problem (Q2419357) (← links)
- A faster FPT algorithm for bipartite contraction (Q2445333) (← links)
- An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem (Q2445900) (← links)
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs (Q2462149) (← links)
- Odd cycle transversal in mixed graphs (Q2672431) (← links)
- Solving target set selection with bounded thresholds faster than \(2^n\) (Q2684482) (← links)
- A $c^k n$ 5-Approximation Algorithm for Treewidth (Q2799353) (← links)
- On the Complexity of Computing the k-restricted Edge-connectivity of a Graph (Q2827813) (← links)
- On Multiway Cut Parameterized above Lower Bounds (Q2891333) (← links)
- On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal (Q2891343) (← links)
- FPT Suspects and Tough Customers: Open Problems of Downey and Fellows (Q2908547) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
