A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Finding minimum-cost circulations by canceling negative cycles
Journal of the ACM (JACM)
Fast approximation algorithms for multicommodity flow problems
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Faster scaling algorithms for general graph matching problems
Journal of the ACM (JACM)
Minimizing capacity violations in a transshipment network
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
An implementation of the &egr;-relaxation algorithm on the CM-5
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
A universal-scheme approach to statistical databases containing homogeneous summary tables
ACM Transactions on Database Systems (TODS)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '95 Proceedings of the twenty-seventh 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
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
Implementation of dynamic trees with in-subtree operations
Journal of Experimental Algorithmics (JEA)
Scaling algorithms for the shortest paths problem
SODA '93 Proceedings of the fourth 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
A polynomial time primal network simplex algorithm for minimum cost flows
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A faster algorithm for minimum cost submodular flows
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Parallel Algorithms for Solving the Convex Minimum Cost Flow Problem
Computational Optimization and Applications
Journal of Optimization Theory and Applications
A Technique for Drawing Directed Graphs
IEEE Transactions on Software Engineering
Improving time bounds on maximum generalised flow computations by contracting the network
Theoretical Computer Science - Special issue on automata, languages and programming
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
An O(T log T) Algorithm for the Dynamic Lot Size Problem with Limited Storage and Linear Costs
Computational Optimization and Applications
Implementing approximation algorithms for the single-source unsplittable flow problem
Journal of Experimental Algorithmics (JEA)
A combinatorial approximation algorithm for concurrent flow problem and its application
Computers and Operations Research
A Computational Study of Cost Reoptimization for Min-Cost Flow Problems
INFORMS Journal on Computing
Trade-offs between mobility and density for coverage in wireless sensor networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
A double scaling algorithm for the constrained maximum flow problem
Computers and Operations Research
A Network Flow Algorithm for Reconstructing Binary Images from Continuous X-rays
Journal of Mathematical Imaging and Vision
Optimal Real-Time Traffic Control in Metro Stations
Operations Research
Quincy: fair scheduling for distributed computing clusters
Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles
Using combinatorial optimization in model-based trimmed clustering with cardinality constraints
Computational Statistics & Data Analysis
Approximation algorithms for k-hurdle problems
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
LEMON - an Open Source C++ Graph Template Library
Electronic Notes in Theoretical Computer Science (ENTCS)
Solving maximum flow problems on real-world bipartite graphs
Journal of Experimental Algorithmics (JEA)
Petri-nets as an intermediate representation for heterogeneous architectures
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part II
SIRALINA: efficient two-steps heuristic for storage optimisation in single period task scheduling
Journal of Combinatorial Optimization
Dinitz' algorithm: the original version and even's version
Theoretical Computer Science
A faster polynomial algorithm for the constrained maximum flow problem
Computers and Operations Research
A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
Operations Research Letters
A new scaling algorithm for the minimum cost network flow problem
Operations Research Letters
An O(m(m+nlogn)log(nC)) -time algorithm to solve the minimum cost tension problem
Theoretical Computer Science
Contraction network for solving maximum flow problem
Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics
Adaptive scheduling strategies for cloud-based resource infrastructures
Security and Communication Networks
Capacity-Constrained network-voronoi diagram: a summary of results
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
| Hi-index | 0.01 |