MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Multiple-source shortest paths in planar graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
An O (n log n) algorithm for maximum st-flow in a directed planar graph
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling
ACM Transactions on Algorithms (TALG)
An O(n log n) algorithm for maximum st-flow in a directed planar graph
Journal of the ACM (JACM)
Combinatorics, Probability and Computing
Distributive lattices, polyhedra, and generalized flows
European Journal of Combinatorics
Maximum flows and parametric shortest paths in planar graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Lattices and maximum flow algorithms in planar graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Decomposition theorem on matchable distributive lattices
Discrete Applied Mathematics
| Hi-index | 0.00 |