Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Existence and construction of edge disjoint paths on expander graphs
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Efficient routing in all-optical networks
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Improved bounds for all optical routing
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Efficient routing and scheduling algorithms for optical networks
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Optimal construction of edge-disjoint paths in random graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
An efficient algorithm for the vertex-disjoint paths problem in random graphs
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Improved access to optical bandwidth in trees
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
The growth rate of vertex-transitive planar graphs
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Optimal construction of edge-disjoint paths in random regular graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Wavelength conversion in optical networks
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Strongly Polynomial Algorithms for the Unsplittable Flow Problem
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Approximating Call-Scheduling Makespan in All-Optical Networks
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
On Nonblocking Properties on the Benes Network
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Journal of Computer and System Sciences
Journal of Scheduling - Special issue: On-line algorithm part I
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
Short length Menger's theorem and reliable optical routing
Theoretical Computer Science
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
The edge disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Edge Disjoint Paths in Moderately Connected Graphs
SIAM Journal on Computing
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
Edge disjoint paths in moderately connected graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Approximation algorithms for edge-disjoint paths and unsplittable flow
Efficient Approximation and Online Algorithms
Routing in undirected graphs with constant congestion
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |