Pages that link to "Item:Q2849930"
From MaRDI portal
The following pages link to On the Parameterized Complexity of Cutting a Few Vertices from a Graph (Q2849930):
Displaying 18 items.
- Parameterized complexity of critical node cuts (Q517024) (← links)
- Parameterized graph separation problems (Q820151) (← links)
- A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem (Q896163) (← links)
- On size-constrained minimum \(s\mathrm{-}t\) cut problems and size-constrained dense subgraph problems (Q897915) (← links)
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342) (← links)
- Parameterized complexity of immunization in the threshold model (Q2154106) (← links)
- On critical node problems with vulnerable vertices (Q2169985) (← links)
- On the parameterized complexity of separating certain sources from the target (Q2330108) (← links)
- Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization (Q2343085) (← links)
- Unbalanced graph cuts with minimum capacity (Q2515430) (← links)
- Cutting up is hard to do: the parameterised complexity of \(k\)-cut and related problems (Q2843923) (← links)
- Multilevel Approaches for the Critical Node Problem (Q4994170) (← links)
- Parameterized and Exact Computation (Q5311527) (← links)
- Finding \(k\)-secluded trees faster (Q6039423) (← links)
- Immunization in the threshold model: a parameterized complexity study (Q6069928) (← links)
- Finding \(k\)-secluded trees faster (Q6133646) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- On critical node problems with vulnerable vertices (Q6616219) (← links)
