Improved algorithms for linear inequalities with two variables per inequality
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Improving Time Bounds on Maximum Generalised Flow Computations by Contracting the Network
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Improving time bounds on maximum generalised flow computations by contracting the network
Theoretical Computer Science - Special issue on automata, languages and programming
| Hi-index | 0.00 |