Pages that link to "Item:Q2514121"
From MaRDI portal
The following pages link to The role of planarity in connectivity problems parameterized by treewidth (Q2514121):
Displaying 12 items.
- Hitting minors on bounded treewidth graphs. III. Lower bounds (Q2301360) (← links)
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
- A tight lower bound for vertex planarization on graphs of bounded treewidth (Q2403808) (← links)
- The role of planarity in connectivity problems parameterized by treewidth (Q2514121) (← links)
- (Q2946008) (redirect page) (← links)
- (Q4972036) (← links)
- Finding Hamiltonian Cycle in Graphs of Bounded Treewidth (Q4984872) (← links)
- Lower bounds for dynamic programming on planar graphs of bounded cutwidth (Q5009465) (← links)
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (Q5042453) (← links)
- Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth (Q5131225) (← links)
- Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth (Q5326561) (← links)
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time (Q5494962) (← links)