Pages that link to "Item:Q412168"

The following pages link to The disjoint paths problem in quadratic time (Q412168):

Displaying 49 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)
• The Directed Disjoint Shortest Paths Problem (Q5111698) (← links)
• A Linear-Time Parameterized Algorithm for Node Unique Label Cover (Q5111746) (← links)
• \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions (Q6038588) (← links)
• Combing a Linkage in an Annulus (Q6057804) (← links)
• Steiner connectivity problems in hypergraphs (Q6072212) (← links)
• On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems (Q6087136) (← links)
• Detours in directed graphs (Q6113279) (← 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 (Q6139828) (← links)
• Approximating maximum integral multiflows on bounded genus graphs (Q6142346) (← links)
• A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs (Q6158361) (← links)
• Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths (Q6171262) (← links)
• Almost disjoint paths and separating by forbidden pairs (Q6199396) (← links)
• Social disruption games in signed networks (Q6199710) (← links)