Slim tree-cut width - MaRDI portal

Cites Work

Unnamed Item
Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
Fundamentals of parameterized complexity
Sparsity. Graphs, structures, and algorithms
The structure of graphs not admitting a fixed immersion
Boolean-width of graphs
Constraint satisfaction with bounded treewidth revisited
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
An FPT 2-approximation for tree-cut decomposition
Parameterized algorithms for stable matching with ties and incomplete lists
The complexity landscape of decompositional parameters for ILP
New algorithms for maximum disjoint paths based on tree-likeness
Tree-width, path-width, and cutwidth
Linear time solvable optimization problems on graphs of bounded clique-width
A Menger-like property of tree-cut width
On structural parameterizations of the edge disjoint paths problem
Hamiltonian cycle parameterized by treedepth in single exponential time and polynomial space
On structural parameterizations of the bounded-degree vertex deletion problem
The firefighter problem for graphs of maximum degree three
Parameterized complexity of the MinCCA problem on graphs of bounded decomposability
The power of cut-based parameters for computing edge-disjoint paths
Towards a polynomial kernel for directed feedback vertex set
The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth
Algorithmic Applications of Tree-Cut Width
Graph Layout Problems Parameterized by Vertex Cover
Graph minors. II. Algorithmic aspects of tree-width
Parameterized Complexity Results for Exact Bayesian Network Structure Learning
Immersions in Highly Edge Connected Graphs
Lean Tree-Cut Decompositions: Obstructions and Algorithms
Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization
Parameterized Algorithms
Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters
Graph-Theoretic Concepts in Computer Science
Constructing minimum changeover cost arborescenses in bounded treewidth graphs