Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM (JACM)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Implementation of dynamic trees with in-subtree operations
Journal of Experimental Algorithmics (JEA)
Kinetic connectivity of rectangles
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Fully dynamic algorithms for chordal graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Fully Dynamic Maintenance of k-Connectivity in Parallel
IEEE Transactions on Parallel and Distributed Systems
Maintaining Dynamic Minimum Spanning Trees: An Experimental Study
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Implementations and experimental studies of dynamic graph algorithms
Experimental algorithmics
Finding All Maximal Cliques in Dynamic Graphs
Computational Optimization and Applications
Fully dynamic all pairs shortest paths with real edge weights
Journal of Computer and System Sciences - Special issue on FOCS 2001
Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
An experimental analysis of self-adjusting computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Reoptimization of minimum and maximum traveling salesman's tours
Journal of Discrete Algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Fast reoptimization for the minimum spanning tree problem
Journal of Discrete Algorithms
Self-adjusting computation with Delta ML
AFP'08 Proceedings of the 6th international conference on Advanced functional programming
Minimum spanning tree on spatio-temporal networks
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
Optimizing incremental maintenance of minimal bisimulation of cyclic graphs
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
A constraint satisfaction approach to the robust spanning tree problem with interval data
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Reoptimization of minimum and maximum traveling salesman's tours
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Research paper: The saga of minimum spanning trees
Computer Science Review
Reoptimization of maximum weight induced hereditary subgraph problems
Theoretical Computer Science
| Hi-index | 0.00 |