Pages that link to "Item:Q5757875"
From MaRDI portal
The following pages link to Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus (Q5757875):
Displaying 14 items.
- Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Faster parameterized algorithms for minor containment (Q650942) (← links)
- Contraction bidimensionality of geometric intersection graphs (Q832527) (← links)
- Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340) (← links)
- Approximation algorithms via contraction decomposition (Q1945289) (← links)
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions (Q1957653) (← links)
- The role of planarity in connectivity problems parameterized by treewidth (Q2514121) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms (Q3508575) (← links)
- (Q4972036) (← links)
- Contraction-Bidimensionality of Geometric Intersection Graphs (Q5111864) (← links)
- Dynamic programming for graphs on surfaces (Q5501962) (← links)
