Arindam Khanda
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Arindam Khanda has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Sajal Kumar Das
Computer Science, Missouri University of Science and Technology, Rolla, MO, USA
10 shared publications - Anurag Satpathy
Department of Computer Science, Missouri University of Science and Technology, Rolla, MO, USA
4 shared publications - S. M. Shovan
Department of Computer Science, Missouri University of Science and Technology, Rolla, MO, USA
4 shared publications - Anusha Vangala
Center for Security, Theory and Algorithmic Research, International Institute of Information Technology, Hyderabad, India
1 shared publication - Boyana Norris
University of Oregon, Eugene, OR, USA
1 shared publication - Chittaranjan Swain
Computer Science, Indian Institute of Information Technology and Management Gwalior, Gwalior, India
1 shared publication
Latest Publications
- Open Access
- 5 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 740-751
DynLP: Parallel Dynamic Batch Update for Label Propagation in Graph-based Semi-Supervised Learning
- 5 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 740-751
Open AccessDynLP: Parallel Dynamic Batch Update for Label Propagation in Graph-based Semi-Supervised Learning
- Open Access
- 11 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-12
ReACT-TTC: Capacity-Aware Top Trading Cycles for Post-Choice Reassignment in Shared CPS
- 11 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Open AccessReACT-TTC: Capacity-Aware Top Trading Cycles for Post-Choice Reassignment in Shared CPS
- 19 February 2026
- Published by Elsevier in Pervasive and Mobile Computing
- Vol. 118
SMART-CHARGE: Stable matching algorithm for electric vehicle charging in subscription-based models
- 19 February 2026
- Published by Elsevier in Pervasive and Mobile Computing
- Vol. 118
SMART-CHARGE: Stable matching algorithm for electric vehicle charging in subscription-based models
- Open Access
- 5 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 168-172
RESCUE: Routing under Evolving Stochastic Congestion and Uncertain Spread in Wildfire Emergencies
- 5 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 168-172
Open AccessRESCUE: Routing under Evolving Stochastic Congestion and Uncertain Spread in Wildfire Emergencies
- Open Access
A Parallel Algorithm for Finding Robust Spanners in Large Social Networks
Social networks, characterized by community structures, often rely on nodes called structural hole spanners to facilitate inter-community information dissemination. However, the dynamic nature of these networks, where spanner nodes may be removed, necessitates resilient methods to maintain inter-community communication. To this end, we introduce robust spanners (RS) as nodes uniquely equipped to bridge communities despite disruptions, such as node or edge removals. We propose a novel scoring technique to identify RS nodes and present a parallel algorithm with a CUDA implementation for efficient RS detection in large networks. Empirical analysis of real-world social networks reveals that high-scoring nodes exhibit a spanning capacity comparable to those identified by benchmark spanner detection algorithms while offering superior robustness. Our implementation on Nvidia GPUs achieves an average speedup of 244X over traditional spanner detection techniques, demonstrating its efficacy to identify RS in large social networks.
Open AccessA Parallel Algorithm for Finding Robust Spanners in Large Social Networks
Social networks, characterized by community structures, often rely on nodes called structural hole spanners to facilitate inter-community information dissemination. However, the dynamic nature of these networks, where spanner nodes may be removed, necessitates resilient methods to maintain inter-community communication. To this end, we introduce robust spanners (RS) as nodes uniquely equipped to bridge communities despite disruptions, such as node or edge removals. We propose a novel scoring technique to identify RS nodes and present a parallel algorithm with a CUDA implementation for efficient RS detection in large networks. Empirical analysis of real-world social networks reveals that high-scoring nodes exhibit a spanning capacity comparable to those identified by benchmark spanner detection algorithms while offering superior robustness. Our implementation on Nvidia GPUs achieves an average speedup of 244X over traditional spanner detection techniques, demonstrating its efficacy to identify RS in large social networks.
- 30 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 36 (5) , 932-944
Parallel Multi Objective Shortest Path Update Algorithm in Large Dynamic Networks
The multi objective shortest path (MOSP) problem, crucial in various practical domains, seeks paths that optimize multiple objectives. Due to its high computational complexity, numerous parallel heuristics have been developed for static networks. However, real-world networks are often dynamic where the network topology changes with time. Efficiently updating the shortest path in such networks is challenging, and existing algorithms for static graphs are inadequate for these dynamic conditions, necessitating novel approaches. Here, we first develop a parallel algorithm to efficiently update a single objective shortest path (SOSP) in fully dynamic networks, capable of accommodating both edge insertions and deletions. Building on this, we propose DynaMOSP, a parallel heuristic for Dynamic Multi Objective Shortest Path searches in large, fully dynamic networks. We provide a theoretical analysis of the conditions to achieve Pareto optimality. Furthermore, we devise a dedicated shared memory CPU implementation along with a version for heterogeneous computing environments. Empirical analysis on eight real-world graphs demonstrates that our method scales effectively. The shared memory CPU implementation achieves an average speedup of 12.74× and a maximum of 57.22×, while on an Nvidia GPU, it attains an average speedup of 69.19×, reaching up to 105.39× when compared to state-of-the-art techniques.
- 30 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 36 (5) , 932-944
Parallel Multi Objective Shortest Path Update Algorithm in Large Dynamic Networks
The multi objective shortest path (MOSP) problem, crucial in various practical domains, seeks paths that optimize multiple objectives. Due to its high computational complexity, numerous parallel heuristics have been developed for static networks. However, real-world networks are often dynamic where the network topology changes with time. Efficiently updating the shortest path in such networks is challenging, and existing algorithms for static graphs are inadequate for these dynamic conditions, necessitating novel approaches. Here, we first develop a parallel algorithm to efficiently update a single objective shortest path (SOSP) in fully dynamic networks, capable of accommodating both edge insertions and deletions. Building on this, we propose DynaMOSP, a parallel heuristic for Dynamic Multi Objective Shortest Path searches in large, fully dynamic networks. We provide a theoretical analysis of the conditions to achieve Pareto optimality. Furthermore, we devise a dedicated shared memory CPU implementation along with a version for heterogeneous computing environments. Empirical analysis on eight real-world graphs demonstrates that our method scales effectively. The shared memory CPU implementation achieves an average speedup of 12.74× and a maximum of 57.22×, while on an Nvidia GPU, it attains an average speedup of 69.19×, reaching up to 105.39× when compared to state-of-the-art techniques.
- Open Access
- 4 January 2025
- Published by Association for Computing Machinery (ACM)
- p. 46-55
SMEVCA: Stable Matching-based EV Charging Assignment in Subscription-Based Models
- 4 January 2025
- Published by Association for Computing Machinery (ACM)
- p. 46-55
Open AccessSMEVCA: Stable Matching-based EV Charging Assignment in Subscription-Based Models
- Open Access
- 12 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 739-746
A Parallel Algorithm for Updating a Multi-objective Shortest Path in Large Dynamic Networks
In dynamic networks, where continuous topological changes are prevalent, it becomes paramount to find and update different graph properties without the computational burden of recalculating from the ground up. However finding or updating a multi-objective shortest path (MOSP) in such a network is challenging, as it involves simultaneously optimizing multiple (conflicting) objectives. In light of this, our paper focuses on shortest path search and proposes parallel algorithms tailored specifically for large incremental graphs. We first present an efficient algorithm that updates the single-objective shortest path (SOSP) whenever a new set of edges are introduced. Leveraging this SOSP update algorithm, we also devise a novel heuristic approach to adaptively update a MOSP in large networks. Empirical evaluations on both real and synthetic incremental networks with shared memory implementations attest to the scalability and efficacy of the proposed algorithms.
- 12 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 739-746
Open AccessA Parallel Algorithm for Updating a Multi-objective Shortest Path in Large Dynamic Networks
In dynamic networks, where continuous topological changes are prevalent, it becomes paramount to find and update different graph properties without the computational burden of recalculating from the ground up. However finding or updating a multi-objective shortest path (MOSP) in such a network is challenging, as it involves simultaneously optimizing multiple (conflicting) objectives. In light of this, our paper focuses on shortest path search and proposes parallel algorithms tailored specifically for large incremental graphs. We first present an efficient algorithm that updates the single-objective shortest path (SOSP) whenever a new set of edges are introduced. Leveraging this SOSP update algorithm, we also devise a novel heuristic approach to adaptively update a MOSP in large networks. Empirical evaluations on both real and synthetic incremental networks with shared memory implementations attest to the scalability and efficacy of the proposed algorithms.
- Open Access
- 4 January 2023
- Published by Association for Computing Machinery (ACM)
- p. 298-299
A Parallel Framework for Efficiently Updating Graph Properties in Large Dynamic Networks
Graph queries on large networks leverage the stored graph properties to provide faster results. Since real-world graphs are mostly dynamic, i.e., the graph topology changes over time, the corresponding graph attributes also change over time. In certain situations, recompiling or updating earlier properties is necessary to maintain the accuracy of a response to a graph query. Here, we first propose a generic framework for developing parallel algorithms to update graph properties on large dynamic networks. We use our framework to develop algorithms for updating Single Source Shortest Path (SSSP) and Vertex Color. Then we propose applications of the developed algorithms in Unmanned Aerial Vehicle (UAV) based delivery systems under time-varying dynamics. Finally, we implement our SSSP and vertex color update algorithms for Nvidia GPU architecture and show empirically that the developed algorithms can update properties in large dynamic networks faster than the state-of-the-art techniques.
- 4 January 2023
- Published by Association for Computing Machinery (ACM)
- p. 298-299
Open AccessA Parallel Framework for Efficiently Updating Graph Properties in Large Dynamic Networks
Graph queries on large networks leverage the stored graph properties to provide faster results. Since real-world graphs are mostly dynamic, i.e., the graph topology changes over time, the corresponding graph attributes also change over time. In certain situations, recompiling or updating earlier properties is necessary to maintain the accuracy of a response to a graph query. Here, we first propose a generic framework for developing parallel algorithms to update graph properties on large dynamic networks. We use our framework to develop algorithms for updating Single Source Shortest Path (SSSP) and Vertex Color. Then we propose applications of the developed algorithms in Unmanned Aerial Vehicle (UAV) based delivery systems under time-varying dynamics. Finally, we implement our SSSP and vertex color update algorithms for Nvidia GPU architecture and show empirically that the developed algorithms can update properties in large dynamic networks faster than the state-of-the-art techniques.
- 26 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 33 (4) , 929-940
A Parallel Algorithm Template for Updating Single-Source Shortest Paths in Large-Scale Dynamic Networks
The Single Source Shortest Path (SSSP) problem is a classic graph theory problem that arises frequently in various practical scenarios; hence, many parallel algorithms have been developed to solve it. However, these algorithms operate on static graphs, whereas many real-world problems are best modeled as dynamic networks, where the structure of the network changes with time. This gap between the dynamic graph modeling and the assumed static graph model in the conventional SSSP algorithms motivates this work. We present a novel parallel algorithmic framework for updating the SSSP in large-scale dynamic networks and implement it on the shared-memory and GPU platforms. The basic idea is to identify the portion of the network affected by the changes and update the information in a rooted tree data structure that stores the edges of the network that are most relevant to the analysis. Extensive experimental evaluations on real-world and synthetic networks demonstrate that our proposed parallel updating algorithm is scalable and, in most cases, requires significantly less execution time than the state-of-the-art recomputing-from-scratch algorithms.
- 26 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 33 (4) , 929-940
A Parallel Algorithm Template for Updating Single-Source Shortest Paths in Large-Scale Dynamic Networks
The Single Source Shortest Path (SSSP) problem is a classic graph theory problem that arises frequently in various practical scenarios; hence, many parallel algorithms have been developed to solve it. However, these algorithms operate on static graphs, whereas many real-world problems are best modeled as dynamic networks, where the structure of the network changes with time. This gap between the dynamic graph modeling and the assumed static graph model in the conventional SSSP algorithms motivates this work. We present a novel parallel algorithmic framework for updating the SSSP in large-scale dynamic networks and implement it on the shared-memory and GPU platforms. The basic idea is to identify the portion of the network affected by the changes and update the information in a rooted tree data structure that stores the edges of the network that are most relevant to the analysis. Extensive experimental evaluations on real-world and synthetic networks demonstrate that our proposed parallel updating algorithm is scalable and, in most cases, requires significantly less execution time than the state-of-the-art recomputing-from-scratch algorithms.