Finding the Most Vital Node of a Shortest Path
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Finding the most vital node of a shortest path
Theoretical Computer Science - Computing and combinatorics
A truthful mechanism for the non-utilitarian minimum radius spanning tree problem
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
A near-linear time algorithm for computing replacement paths in planar directed graphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Dual-failure distance and connectivity oracles
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Finding the anti-block vital edge of a shortest path between two nodes
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
A near-linear-time algorithm for computing replacement paths in planar directed graphs
ACM Transactions on Algorithms (TALG)
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
Efficient algorithms for finding the k most vital edges for the minimum spanning tree problem
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Replacement paths and k simple shortest paths in unweighted directed graphs
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A truthful (2 - 2/k)-approximation mechanism for the steiner tree problem with k terminals*
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Real time critical edge of the shortest path in transportation networks
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Computing replacement paths in surface embedded graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Efficient truthful mechanisms for the single-source shortest paths tree problem
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Efficient determination of the k most vital edges for the minimum spanning tree problem
Computers and Operations Research
Replacement paths and k simple shortest paths in unweighted directed graphs
ACM Transactions on Algorithms (TALG)
Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication
ACM Transactions on Algorithms (TALG)
Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
Journal of Combinatorial Optimization
Journal of Discrete Algorithms
Faster algorithm to find anti-risk path between two nodes of an undirected graph
Journal of Combinatorial Optimization
| Hi-index | 0.89 |