Decision algorithms for unsplittable flow and the half-disjoint paths problem

Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing

Improved bounds for the unsplittable flow problem

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms

Strongly Polynomial Algorithms for the Unsplittable Flow Problem

Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization

Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

Journal of Computer and System Sciences

Multicommodity flow, well-linked terminals, and routing problems

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

Hardness of the undirected edge-disjoint paths problem

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science

Logarithmic hardness of the undirected edge-disjoint paths problem

Journal of the ACM (JACM)

Half integral packing, Erdős-Posá-property and graph minors

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms

A nearly linear time algorithm for the half integral disjoint paths packing

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms

A nearly linear time algorithm for the half integral parity disjoint paths packing problem

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms

An improved algorithm for finding cycles through elements

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization

How bad is single-path routing

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications

Recognizing a totally odd K4-subdivision, parity 2-disjoint rooted paths and a parity cycle through specified elements

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms

An (almost) linear time algorithm for odd cycles transversal

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms

Improved algorithm for the half-disjoint paths problem

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques

Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs

SIAM Journal on Discrete Mathematics

The disjoint paths problem: algorithm and structure

WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation

Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two

Proceedings of the forty-third annual ACM symposium on Theory of computing

The disjoint paths problem in quadratic time

Journal of Combinatorial Theory Series B

Cost of not splitting in routing: characterization and estimation

IEEE/ACM Transactions on Networking (TON)