The following pages link to (Q4633929):
Displaying 21 items.
- Irrelevant vertices for the planar disjoint paths problem (Q345131) (← links)
- The disjoint paths problem in quadratic time (Q412168) (← links)
- Algorithms for the edge-width of an embedded graph (Q419374) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Finding disjoint paths in split graphs (Q493652) (← links)
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802) (← links)
- Parameterized algorithms for list \(K\)-cycle (Q666679) (← links)
- Induced packing of odd cycles in planar graphs (Q764360) (← links)
- Subexponential algorithms for partial cover problems (Q1944141) (← links)
- Induced disjoint paths in AT-free graphs (Q2051862) (← links)
- Few induced disjoint paths for \(H\)-free graphs (Q2098179) (← links)
- A faster algorithm to recognize even-hole-free graphs (Q2347846) (← links)
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (Q5042453) (← links)
- Exact Solution Algorithms for the Chordless Cycle Problem (Q5106395) (← links)
- Induced Disjoint Paths in Claw-Free Graphs (Q5251566) (← links)
- (Q5743379) (← links)
- (Q5743476) (← links)
- (Q5743515) (← links)
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs (Q6053467) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Combing a Linkage in an Annulus (Q6057804) (← links)
