MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
A deterministic near-linear time algorithm for finding minimum cuts in planar graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Max-flow problem in undirected planar networks with node capacities being in NC
Journal of Computer Science and Technology
Multiple-source shortest paths in planar graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Globally Minimal Surfaces by Continuous Maximal Flows
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
Maximum s-t-flow with k crossings in O(k3n log n) time
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
An O(n log n) algorithm for maximum st-flow in a directed planar graph
Journal of the ACM (JACM)
Homology flows, cohomology cuts
Proceedings of the forty-first annual ACM symposium on Theory of computing
Minimum cuts and shortest homologous cycles
Proceedings of the twenty-fifth annual symposium on Computational geometry
Solving the replacement paths problem for planar directed graphs in O(n log n) time
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
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
On greedy and submodular matrices
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Shortest non-trivial cycles in directed surface graphs
Proceedings of the twenty-seventh annual symposium on Computational geometry
Efficient algorithms for simplifying flow networks
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Minimum cuts and shortest non-separating cycles via homology covers
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
GD'11 Proceedings of the 19th international conference on Graph Drawing
A fast algorithm for minimum weight odd circuits and cuts in planar graphs
Operations Research Letters
Counting and sampling minimum cuts in genus g graphs
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |