Algorithms and complexity analysis for some flow problems
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for parallel linear programming and other problems
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Is there an algebraic proof for P ≠ NC? (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Stochastic shortest paths via Quasi-convex maximization
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Succinct approximate convex pareto curves
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
An efficient algorithm for the parametric resource allocation problem
Discrete Applied Mathematics
Maximum flows and parametric shortest paths in planar graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
High-Performance heuristics for optimization in stochastic traffic engineering problems
LSSC'09 Proceedings of the 7th international conference on Large-Scale Scientific Computing
| Hi-index | 0.00 |