46 citations · 55 across the 3 of their papers we have counts for
4 papers · 1 filter
Network Robustness via Global k-cores
Palash Dey, Suman Kalyan Maity, Sourav Medya +1
Network robustness is a measure a network's ability to survive adversarial attacks. But not all parts of a network are equal. K-cores, which are dense subgraphs, are known to captu…
Influence Minimization Under Budget and Matroid Constraints: Extended Version
Sourav Medya, Arlei Silva, Ambuj Singh
Recently, online social networks have become major battlegrounds for political campaigns, viral marketing, and the dissemination of news. As a consequence, ''bad actors'' are incre…
K-Core Minimization: A Game Theoretic Approach
Sourav Medya, Tiyani Ma, Arlei Silva +1
K-cores are maximal induced subgraphs where all vertices have degree at least k. These dense patterns have applications in community detection, network visualization and protein fu…
Spectral Algorithms for Temporal Graph Cuts
Arlei Silva, Ambuj Singh, Ananthram Swami
The sparsest cut problem consists of identifying a small set of edges that breaks the graph into balanced sets of vertices. The normalized cut problem balances the total degree, in…