Pages that link to "Item:Q412168"
From MaRDI portal
The following pages link to The disjoint paths problem in quadratic time (Q412168):
Displaying 50 items.
- Edge-disjoint odd cycles in 4-edge-connected graphs (Q273163) (← links)
- Coloring immersion-free graphs (Q326817) (← links)
- Rooted \(K_4\)-minors (Q396793) (← links)
- A linear time algorithm for the induced disjoint paths problem in planar graphs (Q414938) (← links)
- Linkless and flat embeddings in 3-space (Q420569) (← links)
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem (Q444386) (← links)
- Finding disjoint paths in split graphs (Q493652) (← links)
- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (Q520046) (← links)
- Faster parameterized algorithms for minor containment (Q650942) (← links)
- Linear time algorithms for two disjoint paths problems on directed acyclic graphs (Q1929240) (← links)
- Partitioning a graph into balanced connected classes: formulations, separation and experiments (Q2030323) (← links)
- The linkedness of cubical polytopes: the cube (Q2049620) (← links)
- Induced disjoint paths in AT-free graphs (Q2051862) (← links)
- The complexity of mixed-connectivity (Q2070706) (← links)
- Refined parameterizations for computing colored cuts in edge-colored graphs (Q2082563) (← links)
- Structural parameterizations of Tracking Paths problem (Q2089072) (← links)
- Polynomial time algorithms for tracking path problems (Q2144269) (← links)
- From the \(W\)-hierarchy to XNLP. Classes of fixed parameter intractability (Q2154075) (← links)
- Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor (Q2284742) (← links)
- The directed 2-linkage problem with length constraints (Q2304550) (← links)
- Using decomposition-parameters for QBF: mind the prefix! (Q2304627) (← links)
- Structural aspects of semigroups based on digraphs (Q2328130) (← links)
- On the maximum weight minimal separator (Q2333804) (← links)
- Fixed-parameter tractability for subset feedback set problems with parity constraints (Q2344735) (← links)
- Simple undirected two-commodity integral flow with a unitary demand (Q2413185) (← links)
- On the maximum degree of path-pairable planar graphs (Q2415080) (← links)
- Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs (Q2419108) (← links)
- FPT and kernelization algorithms for the induced tree problem (Q2692722) (← links)
- A tight lower bound for edge-disjoint paths on planar DAGs (Q2692724) (← links)
- Can local optimality be used for efficient data reduction? (Q2692734) (← links)
- Claw-Free $t$-Perfect Graphs Can Be Recognized in Polynomial Time (Q2804992) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Finding cycles and trees in sublinear time (Q2925521) (← links)
- Solving Matching Problems Efficiently in Bipartite Graphs (Q2946048) (← links)
- Finding k Partially Disjoint Paths in a Directed Planar Graph (Q3295274) (← links)
- Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs (Q3387757) (← links)
- Linear Time Parameterized Algorithms for Subset Feedback Vertex Set (Q3448850) (← links)
- Towards the Graph Minor Theorems for Directed Graphs (Q3449461) (← links)
- All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs (Q4577772) (← links)
- Polynomial Time Algorithms for Tracking Path Problems (Q5041188) (← links)
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (Q5042453) (← links)
- The Directed Disjoint Shortest Paths Problem (Q5111698) (← links)
- A Linear-Time Parameterized Algorithm for Node Unique Label Cover (Q5111746) (← links)
- (Q5743513) (← links)
- Random Walks and Forbidden Minors II: A $\mathrm{poly}(d\varepsilon^{-1})$-Query Tester for Minor-Closed Properties of Bounded-Degree Graphs (Q5890147) (← links)
- Clique-width and well-quasi-ordering of triangle-free graph classes (Q5918202) (← links)
- Disjoint paths and connected subgraphs for \(H\)-free graphs (Q5918405) (← links)
- Constant factor approximation for tracking paths and fault tolerant feedback vertex set (Q5918533) (← links)
- Disjoint paths and connected subgraphs for \(H\)-free graphs (Q5918624) (← links)
- Block elimination distance (Q5918777) (← links)
