Sabyasachi Basu

13 papers A* 2A 2Journal 9
YearRankTypeTitle / Venue / Authors
2025 A conf
A Sublinear Algorithm for Approximate Shortest Paths in Large Networks.
WSDM
Sabyasachi Basu, Nadia Koshima, Talya Eden, Omri Ben-Eliezer, C. Seshadhri
2025 J jnl
Aggregating maximal cliques in real-world graphs.
CoRR
Noga Alon, Sabyasachi Basu, Shweta Jain, Haim Kaplan, Jakub Lacki, Blair D. Sullivan
2024 J jnl
A Sublinear Algorithm for Approximate Shortest Paths in Large Networks.
CoRR
Sabyasachi Basu, Nadia Koshima, Talya Eden, Omri Ben-Eliezer, C. Seshadhri
2024 A conf
Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets.
CIKM
Sabyasachi Basu, Daniel Paul-Pena, Kun Qian, C. Seshadhri, Edward W. Huang, Karthik Subbian
2024 J jnl
Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets.
CoRR
Sabyasachi Basu, Daniel Paul-Pena, Kun Qian, C. Seshadhri, Edward W. Huang, Karthik Subbian
2024 J jnl
Spectral Triadic Decompositions of Real-World Networks.
SIAM J. Math. Data Sci.
Sabyasachi Basu, Suman Kalyan Bera, C. Seshadhri
2023 J jnl
Optimal storage codes on graphs with fixed locality.
CoRR
Sabyasachi Basu, Manuj Mukherjee
2022 J jnl
Spectral Triadic Decompositions of Real-World Networks.
CoRR
Sabyasachi Basu, Suman Kalyan Bera, C. Seshadhri
2022 A* conf
The complexity of testing all properties of planar graphs, and the role of isomorphism.
SODA
Sabyasachi Basu, Akash Kumar, C. Seshadhri
2021 J jnl
The complexity of testing all properties of planar graphs, and the role of isomorphism.
CoRR
Sabyasachi Basu, Akash Kumar, C. Seshadhri
2021 J jnl
The complexity of testing all properties of planar graphs, and the role of isomorphism.
Electron. Colloquium Comput. Complex.
Sabyasachi Basu, Akash Kumar, C. Seshadhri
2007 J jnl
Automatic outlier detection for time series: an application to sensor data.
Knowl. Inf. Syst.
Sabyasachi Basu, Martin Meckesheimer
1996 A* conf
Time Series Models for Internet Traffic.
INFOCOM
Sabyasachi Basu, Amarnath Mukherjee, Steve Klivansky