Pages that link to "Item:Q1322009"

The following pages link to Graph minors. XI: Circuits on a surface (Q1322009):

Displaying 21 items.

• A linear time algorithm for the induced disjoint paths problem in planar graphs (Q414938) (← links)
• Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
• Subexponential parameterized algorithms (Q458457) (← links)
• Algorithms for finding an induced cycle in planar graphs (Q653839) (← links)
• Rank-width and tree-width of \(H\)-minor-free graphs (Q709231) (← links)
• Some recent progress and applications in graph minor theory (Q878052) (← links)
• Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
• Grids and their minors (Q1097897) (← links)
• A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
• Call routing and the ratcatcher (Q1330799) (← links)
• Graph minors. XIX: Well-quasi-ordering on a surface. (Q1426103) (← links)
• Excluding subdivisions of bounded degree graphs (Q1633742) (← links)
• Improved bounds on the planar branchwidth with respect to the largest grid minor size (Q1934314) (← links)
• Approximation algorithms via contraction decomposition (Q1945289) (← links)
• The theory of guaranteed search on graphs (Q2439841) (← links)
• The branchwidth of graphs and their cycle matroids (Q2642007) (← links)
• Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
• The Induced Disjoint Paths Problem (Q3503839) (← links)
• (Q5009489) (← links)
• Packing topological minors half‐integrally (Q6134535) (← links)
• A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)