Optimal storage codes on graphs with fixed locality Sabyasachi Basu, Manuj Mukherjee arXiv (in submission)
Recovering Overlapping Dense Subgraphs using Triadic Structure, Provably and Practically Sabyasachi Basu, C. Seshadhri (in submission, preprint on request)
Published/Accepted
Density-Accuracy Tradeoffs in Real-World Graph Spanners [extended abstract to appear in ACDA '25]Nadia Koshima*, Tim Rieder*, Sabyasachi Basu, Talya Eden, Omri Ben-Eliezer(click here for a 2-page extended abstract)
Covering maximal cliques in real-world graphs with dense subgraphs[extended abstract to appear in ACDA '25]Sabyasachi Basu, Shweta Jain, Haim Kaplan, Jakub Łącki, Blair Sullivan
A Sublinear Algorithm for Approximate Shortest Paths in Large Networks [WSDM '25] Sabyasachi Basu*, Nadia Koshima* (equal contribution), Talya Eden, Omri Ben-Eliezer, C. Seshadhri arXiv
Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets [CIKM 2024] Sabyasachi Basu*, Daniel Paul-Pena* (equal contribution), Kun Qian, C. Seshadhri, Eddie Huang, Karthik Subbian arXiv
Spectral Triadic Decompositions of Real-World Networks [SIAM Journal on Mathematics of Data Science, 2024]
Sabyasachi Basu, Suman Kalyan Bera, C. SeshadhriarXiv