Pages that link to "Item:Q3440261"

The following pages link to The Bidimensional Theory of Bounded-Genus Graphs (Q3440261):

Displaying 18 items.

• Subexponential parameterized algorithms (Q458457) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• Contraction bidimensionality of geometric intersection graphs (Q832527) (← 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)
• Approximation algorithms via contraction decomposition (Q1945289) (← links)
• Contraction obstructions for treewidth (Q2275894) (← links)
• Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
• What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
• (Q4972036) (← links)
• A Retrospective on (Meta) Kernelization (Q5042460) (← links)
• Stronger ILPs for the Graph Genus Problem. (Q5075767) (← links)
• Contraction-Bidimensionality of Geometric Intersection Graphs (Q5111864) (← links)
• Dynamic programming for graphs on surfaces (Q5501962) (← links)
• To Approximate Treewidth, Use Treelength! (Q5741086) (← links)
• The Parameterized Complexity of Graph Cyclability (Q5891809) (← links)
• Parameterized complexity of perfectly matched sets (Q6038698) (← links)