Homology flows, cohomology cuts
Proceedings of the forty-first annual ACM symposium on Theory of computing
Maximum flows and parametric shortest paths in planar graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Theoretical Computer Science
Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.00 |