Pages that link to "Item:Q5317565"
From MaRDI portal
The following pages link to Bidimensional Parameters and Local Treewidth (Q5317565):
Displaying 21 items.
- The complexity of two graph orientation problems (Q412352) (← links)
- Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- Contraction bidimensionality of geometric intersection graphs (Q832527) (← links)
- Quickly deciding minor-closed parameters in general graphs (Q854832) (← links)
- Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
- Output-polynomial enumeration on graphs of bounded (local) linear MIM-width (Q1709594) (← links)
- Parameterized complexity of the spanning tree congestion problem (Q1759686) (← links)
- Approximation algorithms via contraction decomposition (Q1945289) (← links)
- Contraction obstructions for treewidth (Q2275894) (← links)
- Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor (Q2284742) (← links)
- Layered separators in minor-closed graph classes with applications (Q2407382) (← links)
- Minimizing the Oriented Diameter of a Planar Graph (Q2851475) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Chasing a Fast Robber on Planar Graphs and Random Graphs (Q2940989) (← links)
- Bidimensionality and Kernels (Q3387764) (← links)
- (Q5874521) (← links)
- FPT approximation and subexponential algorithms for covering few or many edges (Q6195348) (← links)
