Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM (JACM)
On certificates and lookahead in dynamic graph problems
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Maintaining a Minimum Spanning Tree Under Transient Node Failures
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Finding the shortest bottleneck edge in a parametric minimum spanning tree
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal MST maintenance for transient deletion of every node in planar graphs
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
A deterministic o(m log m) time algorithm for the reeb graph
Proceedings of the twenty-eighth annual symposium on Computational geometry
Reachability in graph timelines
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |