On the difficulty of some shortest path problems
ACM Transactions on Algorithms (TALG)
Finding the k shortest simple paths: A new algorithm and its implementation
ACM Transactions on Algorithms (TALG)
On the $k$ Shortest Simple Paths Problem in Weighted Directed Graphs
SIAM Journal on Computing
Replacement paths and k simple shortest paths in unweighted directed graphs
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Proceedings of the 13th ACM Conference on Electronic Commerce
Improved algorithms for replacement paths problems in restricted graphs
Operations Research Letters
Replacement paths and k simple shortest paths in unweighted directed graphs
ACM Transactions on Algorithms (TALG)
Capturing an evader in polygonal environments with obstacles: The full visibility case
International Journal of Robotics Research
Journal of Discrete Algorithms
| Hi-index | 0.00 |