Pages that link to "Item:Q2933661"
From MaRDI portal
The following pages link to Finding small separators in linear time via treewidth reduction (Q2933661):
Displaying 46 items.
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Chordal editing is fixed-parameter tractable (Q300460) (← links)
- Parameterized complexity of the \(k\)-arc Chinese postman problem (Q340562) (← links)
- Increasing the minimum degree of a graph by contractions (Q385061) (← links)
- Parameterized complexity of three edge contraction problems with degree constraints (Q471188) (← 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)
- Unit interval editing is fixed-parameter tractable (Q515577) (← links)
- Parameterized complexity of critical node cuts (Q517024) (← links)
- List H-coloring a graph by removing few vertices (Q527415) (← links)
- Rank reduction of oriented graphs by vertex and edge deletions (Q722520) (← links)
- Multi-budgeted directed cuts (Q786027) (← links)
- A randomized polynomial kernel for subset feedback vertex set (Q1702849) (← links)
- Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342) (← links)
- Graph separators: A parameterized view (Q1877710) (← links)
- Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization (Q2032346) (← links)
- Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms (Q2192064) (← links)
- The parameterized complexity of the minimum shared edges problem (Q2323342) (← links)
- Linear kernels for separating a graph into components of bounded size (Q2361357) (← links)
- Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830) (← links)
- On kernelization and approximation for the vector connectivity problem (Q2408198) (← links)
- Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion} (Q2408559) (← links)
- Finding a maximum minimal separator: graph classes and fixed-parameter tractability (Q2661784) (← links)
- Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges (Q2672432) (← links)
- Minimal Disconnected Cuts in Planar Graphs (Q2947884) (← links)
- Treewidth reduction for constrained separation and bipartization problems (Q3113780) (← links)
- Euler Digraphs (Q3120436) (← links)
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
- Odd Multiway Cut in Directed Acyclic Graphs (Q3300762) (← links)
- Multicut Is FPT (Q4605273) (← links)
- Minimum Bisection Is Fixed-Parameter Tractable (Q4634024) (← links)
- Multi-Budgeted Directed Cuts (Q5009480) (← links)
- Independent Feedback Vertex Set for P_5-free Graphs (Q5136232) (← links)
- (Q5136298) (← links)
- Losing Treewidth by Separating Subsets (Q5236288) (← links)
- Hitting Selected (Odd) Cycles (Q5348214) (← links)
- Some results on connected vertex separators (Q6040587) (← links)
- Contracting to a longest path in H-free graphs (Q6065420) (← links)
- Minimization and parameterized variants of vertex partition problems on graphs (Q6087212) (← links)
- On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts (Q6157971) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- On Weighted Graph Separation Problems and Flow Augmentation (Q6187079) (← links)
- Minimum separator reconfiguration (Q6615312) (← links)
- Single-exponential FPT algorithms for enumerating secluded \(\mathcal{F}\)-free subgraphs and deleting to scattered graph classes (Q6655669) (← links)
- Exact and parameterized algorithms for the independent cutset problem (Q6655670) (← links)
