Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
Semidynamic algorithms for maintaining single source shortest paths trees | Algorithmica |
| 1998 | |
Experimental analysis of dynamic algorithms for the single source shortest paths problem | ACM Journal of Experimental Algorithmics | 16 | 1998 | |
On the computational complexity of dynamic graph problems | Theoretical Computer Science |
| 90 | 1996 |
An Incremental Algorithm for a Generalization of the Shortest-Path Problem | Journal of Algorithms | 118 | 1996 | |
Genus g Graphs Have Pagenumber O(√g) | Journal of Algorithms | 35 | 1994 |
Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
Computing-Aware Routing for LEO Satellite Networks: A Transmission and Computation Integration Approach | IEEE Transactions on Vehicular Technology |
| 2023 | |
Finding the
k
Shortest Simple Paths: Time and Space Trade-offs | ACM Journal of Experimental Algorithmics | 2023 | ||
Asymptotically optimal inspection planning via efficient near-optimal search on sampled roadmaps | The International Journal of Robotics Research |
| 1 | 2023 |
Dynamizing Dijkstra: A solution to dynamic shortest path problem through retroactive priority queue | Journal of King Saud University - Computer and Information Sciences |
| 13 | 2021 |
Finding all Pareto optimal paths by simulating ripple relay race in multi-objective networks | Swarm and Evolutionary Computation |
| 10 | 2021 |