Pages that link to "Item:Q1799212"
From MaRDI portal
The following pages link to Parameterized complexity of length-bounded cuts and multicuts (Q1799212):
Displayed 10 items.
- Fine-grained parameterized complexity analysis of graph coloring problems (Q2112649) (← links)
- Length-bounded cuts: proper interval graphs and structural parameters (Q2119399) (← links)
- As Time Goes By: Reflections on Treewidth for Temporal Graphs (Q5042450) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- Minimum Violation Vertex Maps and Their Applications to Cut Problems (Q5138968) (← links)
- (Q5874480) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5918674) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5925679) (← links)
- (Q6087208) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)