Pages that link to "Item:Q650942"

The following pages link to Faster parameterized algorithms for minor containment (Q650942):

Displaying 10 items.

• Differential geometric treewidth estimation in adiabatic quantum computation (Q332093) (← links)
• Systematic and deterministic graph minor embedding for Cartesian products of graphs (Q1679291) (← links)
• Explicit linear kernels for packing problems (Q1739112) (← links)
• Hitting forbidden induced subgraphs on bounded treewidth graphs (Q2051840) (← links)
• Hard combinatorial problems and minor embeddings on lattice graphs (Q2105986) (← links)
• Adiabatic quantum programming: minor embedding with hard faults (Q2454228) (← links)
• Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (Q5042453) (← links)
• Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs (Q5089257) (← links)
• Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds (Q5130572) (← links)
• Minor embedding in broken chimera and derived graphs is NP-complete (Q6201320) (← links)