Pages that link to "Item:Q4554366"
From MaRDI portal
The following pages link to Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs (Q4554366):
Displaying 6 items.
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs (Q2032354) (← links)
- Turing kernelization for finding long paths in graph classes excluding a topological minor (Q2272596) (← links)
- On width measures and topological problems on semi-complete digraphs (Q2312615) (← links)
- Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph (Q2849341) (← links)
- (Q5092387) (← links)
- Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor (Q5111882) (← links)