The following pages link to (Q2843923):
Displaying 38 items.
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- On the complexity of computing the \(k\)-restricted edge-connectivity of a graph (Q501666) (← links)
- Efficient algorithms for network localization using cores of underlying graphs (Q742409) (← links)
- On miniaturized problems in parameterized complexity theory (Q820145) (← links)
- Parameterized graph separation problems (Q820151) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- Forming \(k\) coalitions and facilitating relationships in social networks (Q1647520) (← links)
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342) (← links)
- Computing minimum multiway cuts in hypergraphs (Q1799394) (← links)
- Parameterized random complexity (Q1946497) (← links)
- Univariate ideal membership parameterized by rank, degree, and number of generators (Q2075388) (← links)
- Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs (Q2082190) (← 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)
- Parameterized algorithms for graph partitioning problems (Q2408556) (← links)
- On the sum-max graph partitioning problem (Q2453173) (← links)
- A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)
- On the computational hardness based on linear fpt-reductions (Q2498987) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- On the Complexity of Computing the k-restricted Edge-connectivity of a Graph (Q2827813) (← links)
- Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (Q2891349) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- LP Relaxation and Tree Packing for Minimum $k$-Cut (Q3300759) (← links)
- Collaborating with Hans: Some Remaining Wonderments (Q5042446) (← links)
- (Q5090939) (← links)
- Minimum Violation Vertex Maps and Their Applications to Cut Problems (Q5138968) (← links)
- Hypergraph <i>k</i>-Cut for Fixed <i>k</i> in Deterministic Polynomial Time (Q5870380) (← links)
- Fast and Deterministic Approximations for k-Cut. (Q5875475) (← links)
- Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5918330) (← links)
- Fixed parameter approximation scheme for min-max \(k\)-cut (Q5918433) (← links)
- Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5919045) (← links)
- Fixed parameter approximation scheme for min-max \(k\)-cut (Q5925652) (← links)
- Partitioning subclasses of chordal graphs with few deletions (Q6144015) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- FPT approximation and subexponential algorithms for covering few or many edges (Q6195348) (← links)
- A parameterized approximation scheme for min \(k\)-cut (Q6654555) (← links)
