A framework for dynamic graph drawing
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Separator based sparsification for dynamic planar graph algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Biased finger trees and three-dimensional layers of maxima: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Improved data structures for fully dynamic biconnectivity
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM (JACM)
Fully dynamic planarity testing with applications
Journal of the ACM (JACM)
Kinetic connectivity of rectangles
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
A data structure for dynamically maintaining rooted trees
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Experimental analysis of dynamic minimum spanning tree algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Average case analysis of dynamic geometric optimization
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
Journal of the ACM (JACM)
Dynamic generators of topologically embedded graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Maintaining Dynamic Minimum Spanning Trees: An Experimental Study
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Lower bounds for dynamic connectivity
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A distributed algorithm for constructing a minimum diameter spanning tree
Journal of Parallel and Distributed Computing
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
Theoretical Computer Science
Efficient algorithms for computing Reeb graphs
Computational Geometry: Theory and Applications
Pointed binary encompassing trees: Simple and optimal
Computational Geometry: Theory and Applications
Maintaining dynamic minimum spanning trees: An experimental study
Discrete Applied Mathematics
Fractal Merkle tree representation and traversal
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Efficient extraction of multiple kuratowski subdivisions
GD'07 Proceedings of the 15th international conference on Graph drawing
Algorithms and theory of computation handbook
Connectivity oracles for planar graphs
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Structured recursive separator decompositions for planar graphs in linear time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |