Scaling algorithms for network problems
Journal of Computer and System Sciences
A strongly polynomial minimum cost circulation algorithm
Combinatorica
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
A faster strongly polynomial minimum cost flow algorithm
Operations Research
Two strongly polynomial cut cancelling algorithms for minimum cost network flow
Discrete Applied Mathematics
Polynomial dual network simplex algorithms
Mathematical Programming: Series A and B
A new strongly polynomial dual network simplex algorithm
Mathematical Programming: Series A and B
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Bisimulation Metrics for Continuous Markov Decision Processes
SIAM Journal on Computing
| Hi-index | 0.00 |