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)
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
Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Decomposable multi-parameter matroid optimization problems
Theoretical Computer Science - Latin American theoretical informatics
An Experimental Study of Dynamic Algorithms for Transitive Closure
Journal of Experimental Algorithmics (JEA)
Linear-time algorithms for geometric graphs with sublinearly many crossings
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Maintaining dynamic minimum spanning trees: An experimental study
Discrete Applied Mathematics
Algorithms and theory of computation handbook
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
SIAM Journal on Computing
| Hi-index | 0.00 |