Pages that link to "Item:Q3012796"
From MaRDI portal
The following pages link to Tight Bounds for Linkages in Planar Graphs (Q3012796):
Displaying 14 items.
- Planar disjoint-paths completion (Q329285) (← links)
- Irrelevant vertices for the planar disjoint paths problem (Q345131) (← links)
- Kernel bounds for path and cycle problems (Q392032) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Explicit bounds for graph minors (Q723881) (← links)
- New algorithms for maximum disjoint paths based on tree-likeness (Q1785205) (← links)
- A lower bound on the tree-width of graphs with irrelevant vertices (Q2312606) (← links)
- Planar Disjoint-Paths Completion (Q2891339) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (Q5042453) (← links)
- Modification to Planarity is Fixed Parameter Tractable (Q5090477) (← links)
- (Q5743379) (← links)
- (Q5874521) (← links)
- The Parameterized Complexity of Graph Cyclability (Q5891809) (← links)
