Fast algorithms for convex quadratic programming and multicommodity flows
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A faster strongly polynomial minimum cost flow algorithm
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Faster scaling algorithms for network problems
SIAM Journal on Computing
The maximum concurrent flow problem
Journal of the ACM (JACM)
Finding minimum-cost circulations by successive approximation
Mathematics of Operations Research
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Approximating the minimum net expansion: near optimal solutions to circuit partitioning problems
WG '90 Proceedings of the 16th international workshop on Graph-theoretic concepts in computer science
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Faster algorithms for finding small edge cuts in planar graphs
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Approximating the minimum degree spanning tree to within one from the optimal degree
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Embedding leveled hypercube algorithms into hypercubes (extended abstract)
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
On-line load balancing with applications to machine scheduling and virtual circuit routing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Improved bounds on the max-flow min-cut ratio for multicommodity flows
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Efficient approximation algorithms for semidefinite programs arising from MAX CUT and COLORING
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Strategic directions in research in theory of computing
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Randomized rounding without solving the linear program
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Finding near-optimal cuts: an empirical evaluation
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Fast deterministic approximation for the multicommodity flow problem
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Fast approximation algorithm for minimum cost multicommodity flow
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Fast approximate graph partitioning algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Reformulating Combinatorial Optimization as Constraint Satisfaction
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
The Oracular Constraints Method
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
A 2-Approximation Algorithm for Path Coloring on Trees of Rings
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
A 2-approximation algorithm for path coloring on a restricted class of trees of rings
Journal of Algorithms
Solving fractional packing problems in Oast(1/ε) iterations
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The medium time metric: high throughput route selection in multi-rate ad hoc wireless networks
Mobile Networks and Applications
On shortest path representation
IEEE/ACM Transactions on Networking (TON)
A Parallel Algorithm for NMNF Problems with a Large Number of Capacity Constraints
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A parallelized DPPQN based Expert System method and implementation
Expert Systems with Applications: An International Journal
Asynchronous throughput-optimal routing in malicious networks
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Inter-datacenter bulk transfers with netstitcher
Proceedings of the ACM SIGCOMM 2011 conference
On the complexity of solving Markov decision problems
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Heuristic approaches to service level agreements in packet networks
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Improving a local search technique for network optimization using inexact forecasts
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
| Hi-index | 0.01 |