4 citations · 5 across the 4 of their papers we have counts for
6 papers
Reoptimization of Path Vertex Cover Problem
Mehul Kumar, Amit Kumar, C. Pandu Rangan
Most optimization problems are notoriously hard. Considerable efforts must be spent in obtaining an optimal solution to certain instances that we encounter in the real world scenar…
Human Navigational Performance in a Complex Network with Progressive Disruptions
Amitash Ramesh, Soumya Ramesh, Sudarshan Iyengar +1
The current paper is an investigation towards understanding the navigational performance of humans on a network when the "landmark" nodes are blocked. We observe that humans learn…
On the Fault Tolerance and Hamiltonicity of the Optical Transpose Interconnection System of Non-Hamiltonian Base Graphs
Esha Ghosh, Subhas K. Ghosh, C. Pandu Rangan
Hamiltonicity is an important property in parallel and distributed computation. Existence of Hamiltonian cycle allows efficient emulation of distributed algorithms on a network whe…
A Lookahead algorithm to compute Betweenness Centrality
B Vignesh, Siddharth S, Shridhar Ramachandran +2
The Betweenness Centrality index is a very important centrality measure in the analysis of a large number of networks. Despite its significance in a lot of interdisciplinary applic…
Cache Me If You Can: Capacitated Selfish Replication Games in Networks
Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Naga Naresh Karuturi +3
In Peer-to-Peer (P2P) network systems, content (object) delivery between nodes is often required. One way to study such a distributed system is by defining games, which involve sel…
Communication and Round Efficient Information Checking Protocol
Arpita Patra, C. Pandu Rangan
In this paper, we present a very important primitive called Information Checking Protocol (ICP) which plays an important role in constructing statistical Verifiable Secret Sharing…