Solving minimum-cost flow problems by successive approximation
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation
Communications of the ACM
A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Almost-optimum speed-ups of algorithms for bipartite matching and related problems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Randomized distributed shortest paths algorithms
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Faster scaling algorithms for general graph matching problems
Journal of the ACM (JACM)
On the all-pairs-shortest-path problem
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Algorithms for a switch module routing problem
EURO-DAC '94 Proceedings of the conference on European design automation
Algorithmic aspects in speech recognition: an introduction
Journal of Experimental Algorithmics (JEA)
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
Polynomial methods for separable convex optimization in unimodular spaces
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Scaling algorithms for the shortest paths problem
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A polynomial algorithm for abstract maximum flow
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Data structures for weighted matching and nearest common ancestors with linking
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
On dual minimum cost flow algorithms (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Computing shortest paths with comparisons and additions
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithmic Aspects of Speech Recognition: A Synopsis
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
A Simple Shortest Path Algorithm with Linear Average Time
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Non-standard approaches to integer programming
Discrete Applied Mathematics
The maximum flow problem: a real-time approach
Parallel Computing
A generalization of the scaling max-flow algorithm
Computers and Operations Research
Approximate parameterized matching
ACM Transactions on Algorithms (TALG)
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Two-Level Push-Relabel Algorithm for the Maximum Flow Problem
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Maximum weight bipartite matching in matrix multiplication time
Theoretical Computer Science
Single source shortest paths in H-minor free graphs
Theoretical Computer Science
A distributed preflow-push for the maximum flow problem
IICS'05 Proceedings of the 5th international conference on Innovative Internet Community Systems
Shortest paths in matrix multiplication time
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Minimum-cost optimization in multicommodity logistic chain network
IWMM'04/GIAE'04 Proceedings of the 6th international conference on Computer Algebra and Geometric Algebra with Applications
Weighted bipartite matching in matrix multiplication time
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem
INFORMS Journal on Computing
Parallel algorithms for the assignment and minimum-cost flow problems
Operations Research Letters
Lexicographic bottleneck combinatorial problems
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
A simple reduction from maximum weight matching to maximum cardinality matching
Information Processing Letters
Linear-Time Approximation for Maximum Weight Matching
Journal of the ACM (JACM)
| Hi-index | 0.03 |