A polynomial time primal network simplex algorithm for minimum cost flows
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Clustering for faster network simplex pivots
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Maintenance of a minimum spanning forest in a dynamic planar graph
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
MINFLOTRANSIT: min-cost flow based transistor sizing tool
Proceedings of the 37th Annual Design Automation Conference
Maintaining Center and Median in Dynamic Trees
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Maintaining information in fully dynamic trees with top trees
ACM Transactions on Algorithms (TALG)
An exterior simplex type algorithm for the Minimum Cost Network Flow Problem
Computers and Operations Research
Journal of Experimental Algorithmics (JEA)
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Data structures for mergeable trees
ACM Transactions on Algorithms (TALG)
On strongly polynomial variants of the network simplex algorithm for the maximum flow problem
Operations Research Letters
Equivalence of the primal and dual simplex algorithms for the maximum flow problem
Operations Research Letters
Reachability in graph timelines
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |