Meng L, Shao Y, Yuan L, Lai L, Cheng P, Li X, Yu W, Zhang W, Lin X and Zhou J. (2024). A Survey of Distributed Graph Algorithms on Massive Graphs. ACM Computing Surveys. 57:2. (1-39). Online publication date: 28-Feb-2025.

Lee W, Shahzaad B, Alkouz B and Bouguettaya A. (2024). Reactive Composition of UAV Delivery Services in Urban Environments. IEEE Transactions on Intelligent Transportation Systems. 25:10. (13453-13466). Online publication date: 1-Oct-2024.

https://doi.org/10.1109/TITS.2024.3392914

Feng Y, Wang H, Zhu Y, Liu X, Lu H and Liu Q. DAWN: Matrix Operation-Optimized Algorithm for Shortest Paths Problem on Unweighted Graphs. Proceedings of the 38th ACM International Conference on Supercomputing. (1-13).

https://doi.org/10.1145/3650200.3656600

Cheng Y, Huang C, Jiang H, Xu X and Wang F. (2024). An efficient SSSP algorithm on time-evolving graphs with prediction of computation results. Journal of Parallel and Distributed Computing. 186:C. Online publication date: 1-Apr-2024.

https://doi.org/10.1016/j.jpdc.2023.104830

Hijma P, Heldens S, Sclocco A, van Werkhoven B and Bal H. (2023). Optimization Techniques for GPU Programming. ACM Computing Surveys. 55:11. (1-81). Online publication date: 30-Nov-2023.

https://doi.org/10.1145/3570638

Khanda A, Shovan S and Das S. A Parallel Algorithm for Updating a Multi-objective Shortest Path in Large Dynamic Networks. Proceedings of the SC '23 Workshops of the International Conference on High Performance Computing, Network, Storage, and Analysis. (739-746).

https://doi.org/10.1145/3624062.3625134

Liu Y, Azami N, Vanausdal A and Burtscher M. Choosing the Best Parallelization and Implementation Styles for Graph Analytics Codes: Lessons Learned from 1106 Programs. Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. (1-14).

https://doi.org/10.1145/3581784.3607038

Aktılav B and Öz I. (2022). Performance and accuracy predictions of approximation methods for shortest-path algorithms on GPUs. Parallel Computing. 112:C. Online publication date: 1-Sep-2022.

https://doi.org/10.1016/j.parco.2022.102942

Huang W, Xu Z and Zhu L. (2022). The minimum regret path problem on stochastic fuzzy time-varying networks. Neural Networks. 153:C. (450-460). Online publication date: 1-Sep-2022.

https://doi.org/10.1016/j.neunet.2022.06.029

Khanda A, Corò F and Das S. Drone-Truck Cooperated Delivery Under Time Varying Dynamics. Proceedings of the 2022 Workshop on Advanced tools, programming languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems. (24-29).

https://doi.org/10.1145/3524053.3542743

Safari M, Oortwijn W and Huisman M. Automated Verification of the Parallel Bellman–Ford Algorithm. Static Analysis. (346-358).

https://doi.org/10.1007/978-3-030-88806-0_17

Omar H and Khan O. (2021). PRISM. ACM Transactions on Architecture and Code Optimization. 18:3. (1-25). Online publication date: 30-Sep-2021.

https://doi.org/10.1145/3450523

Wang K, Fussell D and Lin C. A fast work-efficient SSSP algorithm for GPUs. Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. (133-146).

https://doi.org/10.1145/3437801.3441605

Cui H, Liu R, Xu S, Zhou C and Mateos C. (2021). DMGA. Scientific Programming. 2021. Online publication date: 1-Jan-2021.

https://doi.org/10.1155/2021/6639008

Busato F and Bombieri N. Efficient Load Balancing Techniques for Graph Traversal Applications on GPUs. Euro-Par 2018: Parallel Processing. (628-641).

https://doi.org/10.1007/978-3-319-96983-1_45

Tran H and Cambria E. (2018). A survey of graph processing on graphics processing units. The Journal of Supercomputing. 74:5. (2086-2115). Online publication date: 1-May-2018.

https://doi.org/10.1007/s11227-017-2225-1

Hierons R and Türker U. (2017). Parallel Algorithms for Generating Distinguishing Sequences for Observable Non-deterministic FSMs. ACM Transactions on Software Engineering and Methodology. 26:1. (1-34). Online publication date: 31-Jan-2017.

https://doi.org/10.1145/3051121