Pages that link to "Item:Q440008"

The following pages link to Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008):

Displaying 11 items.

• New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
• Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
• Complete binary trees embeddings in Möbius cubes (Q896018) (← links)
• Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane (Q1651693) (← links)
• A \(2^{O(k)}n\) algorithm for \(k\)-cycle in minor-closed graph families (Q2006778) (← links)
• Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
• The role of planarity in connectivity problems parameterized by treewidth (Q2514121) (← links)
• Planar k-Path in Subexponential Time and Polynomial Space (Q3104782) (← links)
• Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
• Packing Cycles Faster Than Erdos--Posa (Q5232148) (← links)
• Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering (Q5885586) (← links)