A new approach to the minimum cut problem
Journal of the ACM (JACM)
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
Perfect arborescence packing in preflow mincut graphs
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Experimental study of minimum cut algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
The maximum flow problem: a real-time approach
Parallel Computing
Optimizing for space and time usage with speculative partial redundancy elimination
Proceedings of the 2004 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
A generalization of the scaling max-flow algorithm
Computers and Operations Research
Partitioning of Web graphs by community topology
WWW '05 Proceedings of the 14th international conference on World Wide Web
Hierarchical partitioning of VLSI floorplans by staircases
ACM Transactions on Design Automation of Electronic Systems (TODAES)
CEA'07 Proceedings of the 2007 annual Conference on International Conference on Computer Engineering and Applications
Efficient Algorithms for the k Smallest Cuts Enumeration
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
The Partial Augment---Relabel Algorithm for the Maximum Flow Problem
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
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
Experimental evaluation of parametric max-flow algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
Journal of Combinatorial Optimization
Maximum flows by incremental breadth-first search
ESA'11 Proceedings of the 19th European conference on Algorithms
Generalized maximum flows over time
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
An improved algorithm for decomposing arc flows into multipath flows
Operations Research Letters
Max flows in O(nm) time, or better
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |