The following pages link to (Q3972953):
Displaying 30 items.
- Edge-disjoint odd cycles in 4-edge-connected graphs (Q273163) (← links)
- The disjoint paths problem in quadratic time (Q412168) (← links)
- On shortest disjoint paths in planar graphs (Q429668) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (Q520046) (← links)
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
- A note on multiflows and treewidth (Q834591) (← links)
- Finding disjoint paths with related path costs (Q857785) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- The extremal function for 3-linked graphs (Q947723) (← links)
- Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms (Q976036) (← links)
- Searching for \(f\)-Hamiltonian circuits (Q1196437) (← links)
- General vertex disjoint paths in series-parallel graphs (Q1208474) (← links)
- Algorithms and obstructions for linear-width and related search parameters (Q1582084) (← links)
- \(K_{a,k}\) minors in graphs of bounded tree-width (Q1850628) (← links)
- On the computational complexity of closest genome problems (Q2295622) (← links)
- On the kernelization of split graph problems (Q2636501) (← links)
- Elimination of local bridges (Q2702747) (← links)
- Routing in undirected graphs with constant congestion (Q2817791) (← links)
- Single-Sink Multicommodity Flow with Side Constraints (Q2971620) (← links)
- (Q3326860) (← links)
- New Hardness Results for Routing on Disjoint Paths (Q3387753) (← links)
- Two disjoint negative cycles in a signed graph (Q3439485) (← links)
- Kernelization of Two Path Searching Problems on Split Graphs (Q4632190) (← links)
- (Q5002709) (← links)
- The Directed Disjoint Shortest Paths Problem (Q5111698) (← links)
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems (Q5917535) (← links)
- Combing a Linkage in an Annulus (Q6057804) (← links)
- On the complexity of the bilevel minimum spanning tree problem (Q6064168) (← links)
- Mengerian graphs: characterization and recognition (Q6078288) (← links)
