The following pages link to Ignasi Sau (Q284715):
Displaying 20 items.
- Maximum cuts in edge-colored graphs (Q5918845) (← links)
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions (Q6038588) (← links)
- Parameterized complexity of finding a spanning tree with minimum reload cost diameter (Q6087398) (← links)
- Reducing the vertex cover number via edge contractions (Q6098145) (← links)
- Target set selection with maximum activation time (Q6110610) (← links)
- Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm (Q6115414) (← links)
- (Q6152160) (← links)
- FPT algorithms for packing \(k\)-safe spanning rooted sub(di)graphs (Q6153458) (← links)
- A relaxation of the Directed Disjoint Paths problem: a global congestion metric helps (Q6326268) (← links)
- Hitting forbidden induced subgraphs on bounded treewidth graphs (Q6338909) (← links)
- Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations (Q6532067) (← links)
- Reducing the vertex cover number via edge contractions (Q6584073) (← links)
- Redicolouring digraphs: directed treewidth and cycle-degeneracy (Q6585259) (← links)
- Faster parameterized algorithms for modification problems to minor-closed classes (Q6601299) (← links)
- A more accurate view of the flat wall theorem (Q6606321) (← links)
- Compound logics for modification problems (Q6638063) (← links)
- Faster parameterized algorithms for modification problems to minor-closed classes (Q6638097) (← links)
- New Menger-like dualities in digraphs and applications to half-integral linkages (Q6656974) (← links)
- Constant congestion linkages in polynomially strong digraphs in polynomial time (Q6743296) (← links)
- Vertex identification to a forest (Q6744358) (← links)
