The following pages link to (Q5417642):
Displaying 28 items.
- Between treewidth and clique-width (Q300479) (← links)
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
- Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking (Q395003) (← links)
- The complexity of finding uniform sparsest cuts in various graph classes (Q450559) (← links)
- Paths of bounded length and their cuts: parameterized complexity and algorithms (Q456699) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs (Q509888) (← links)
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- On structural parameterizations of load coloring (Q831701) (← links)
- Directed NLC-width (Q906393) (← links)
- Algorithmic aspects of switch cographs (Q906430) (← links)
- Fly-automata for checking \(\mathrm{MSO}_2\) graph properties (Q1752502) (← links)
- On the maximum cardinality cut problem in proper interval graphs and related graph classes (Q2055967) (← links)
- Efficient parallel algorithms for parameterized problems (Q2319897) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (Q2891349) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Between Treewidth and Clique-Width (Q2945207) (← links)
- On Structural Parameterizations of Graph Motif and Chromatic Number (Q2971640) (← links)
- Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width (Q3010427) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity (Q4632210) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- (Q5874480) (← links)
- On the minimum cycle cover problem on graphs with bounded co-degeneracy (Q6039424) (← links)
- A parameterized approximation algorithm for the multiple allocation \(k\)-hub center (Q6109001) (← links)
- On structural parameterizations of load coloring (Q6184323) (← links)