Pages that link to "Item:Q345131"
From MaRDI portal
The following pages link to Irrelevant vertices for the planar disjoint paths problem (Q345131):
Displaying 9 items.
- Explicit linear kernels for packing problems (Q1739112) (← links)
- Parameterized complexity of set-restricted disjoint paths on chordal graphs (Q2097221) (← links)
- A lower bound on the tree-width of graphs with irrelevant vertices (Q2312606) (← links)
- A tight lower bound for edge-disjoint paths on planar DAGs (Q2692724) (← links)
- Planar Digraphs (Q3120437) (← links)
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (Q5042453) (← links)
- Combing a Linkage in an Annulus (Q6057804) (← 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)