Pages that link to "Item:Q3455210"

The following pages link to Subexponential parameterized algorithms on bounded-genus graphs and <i>H</i> -minor-free graphs (Q3455210):

Displayed 22 items.

• Parameterized Complexity for Domination Problems on Degenerate Graphs (Q5302055) ‎ (← links)
• Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms (Q5302061) ‎ (← links)
• Dynamic programming for graphs on surfaces (Q5501962) ‎ (← links)
• Parameterized Algorithms for Generalized Domination (Q5505650) ‎ (← links)
• (Q5743379) ‎ (← links)
• (Q5743430) ‎ (← links)
• (Q5743499) ‎ (← links)
• (Q5743514) ‎ (← links)
• Slightly Superexponential Parameterized Problems (Q5745079) ‎ (← links)
• First-Order Model-Checking in Random Graphs and Complex Networks (Q5874510) ‎ (← links)
• Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering (Q5885586) ‎ (← links)
• A Subexponential Parameterized Algorithm for Proper Interval Completion (Q5899484) ‎ (← links)
• The complexity of tree partitioning (Q5918926) ‎ (← links)
• Parameterized complexity of geometric covering problems having conflicts (Q5919304) ‎ (← links)
• Optimality program in segment and string graphs (Q5920196) ‎ (← links)
• On the parameterized complexity of the acyclic matching problem (Q6038700) ‎ (← links)
• Combing a Linkage in an Annulus (Q6057804) ‎ (← links)
• Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable (Q6075759) ‎ (← links)
• Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm (Q6115414) ‎ (← links)
• A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs (Q6158361) ‎ (← links)
• A survey of parameterized algorithms and the complexity of edge modification (Q6158862) ‎ (← links)
• Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space (Q6170447) ‎ (← links)