Pages that link to "Item:Q2908539"
From MaRDI portal
The following pages link to Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539):
Displaying 14 items.
- Treewidth and pathwidth parameterized by the vertex cover number (Q344839) (← links)
- The complexity of minimum-length path decompositions (Q494076) (← links)
- The P3 infection time is W[1]-hard parameterized by the treewidth (Q1705656) (← links)
- On the treewidth of Hanoi graphs (Q2077387) (← links)
- Width, depth, and space: tradeoffs between branching and dynamic programming (Q2287480) (← links)
- Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques (Q2827832) (← links)
- Treewidth and Pathwidth Parameterized by the Vertex Cover Number (Q2842160) (← links)
- Fixed Parameter Tractability of Crossing Minimization of Almost-Trees (Q2867670) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach (Q3088068) (← links)
- Fixed-Parameter Tractability for Non-Crossing Spanning Trees (Q3603545) (← links)
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree (Q4327821) (← links)
- (Q5091271) (← links)
- LATIN 2004: Theoretical Informatics (Q5901631) (← links)