IR
Anthology
Community
Seshadhri
Comandur
2025
doi
dblp
A Sublinear Algorithm for Approximate Shortest Paths in Large Networks.
Sabyasachi Basu
|
Nadia Koshima
|
Talya Eden
|
Omri Ben-Eliezer
|
C. Seshadhri
Proceedings of the Eighteenth ACM International Conference on Web Search and Data Mining, WSDM 2025, Hannover, Germany, March 10-14, 2025
2024
doi
dblp
Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets.
Sabyasachi Basu
|
Daniel Paul-Pena
|
Kun Qian
|
C. Seshadhri
|
Edward W. Huang
|
Karthik Subbian
Proceedings of the 33rd ACM International Conference on Information and Knowledge Management, CIKM 2024, Boise, ID, USA, October 21-25, 2024
2020
doi
dblp
The Power of Pivoting for Exact Clique Counting.
Shweta Jain
|
C. Seshadhri
WSDM '20: The Thirteenth ACM International Conference on Web Search and Data Mining, Houston, TX, USA, February 3-7, 2020
doi
dblp
Efficiently Counting Vertex Orbits of All 5-vertex Subgraphs, by EVOKE.
Noujan Pashanasangi
|
C. Seshadhri
WSDM '20: The Thirteenth ACM International Conference on Web Search and Data Mining, Houston, TX, USA, February 3-7, 2020
doi
dblp
Provably and Efficiently Approximating Near-cliques using the Turán Shadow: PEANUTS.
Shweta Jain
|
C. Seshadhri
WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020
2019
doi
dblp
Scalable Subgraph Counting: The Methods Behind The Madness.
Seshadhri Comandur
|
Srikanta Tirthapura
Companion of The 2019 World Wide Web Conference, WWW 2019, San Francisco, CA, USA, May 13-17, 2019.
2018
doi
dblp
Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples.
Talya Eden
|
Shweta Jain
|
Ali Pinar
|
Dana Ron
|
C. Seshadhri
Proceedings of the 2018 World Wide Web Conference on World Wide Web, WWW 2018, Lyon, France, April 23-27, 2018
2017
doi
dblp
Nucleus Decompositions for Identifying Hierarchy of Dense Subgraphs.
Ahmet Erdem Sariyüce
|
C. Seshadhri
|
Ali Pinar
|
Ümit V. Çatalyürek
ACM Transactions on the Web 2017 Volume 11 Issue 3
doi
dblp
A Fast and Provable Method for Estimating Clique Counts Using Turán's Theorem.
Shweta Jain
|
C. Seshadhri
Proceedings of the 26th International Conference on World Wide Web, WWW 2017, Perth, Australia, April 3-7, 2017
doi
dblp
ESCAPE: Efficiently Counting All 5-Vertex Subgraphs.
Ali Pinar
|
C. Seshadhri
|
Vaidyanathan Vishal
Proceedings of the 26th International Conference on World Wide Web, WWW 2017, Perth, Australia, April 3-7, 2017
doi
dblp
When Hashes Met Wedges: A Distributed Algorithm for Finding High Similarity Vectors.
Aneesh Sharma
|
C. Seshadhri
|
Ashish Goel
Proceedings of the 26th International Conference on World Wide Web, WWW 2017, Perth, Australia, April 3-7, 2017
2015
doi
dblp
Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts.
Madhav Jha
|
C. Seshadhri
|
Ali Pinar
Proceedings of the 24th International Conference on World Wide Web, WWW 2015, Florence, Italy, May 18-22, 2015
doi
dblp
Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions.
Ahmet Erdem Sariyüce
|
C. Seshadhri
|
Ali Pinar
|
Ümit V. Çatalyürek
Proceedings of the 24th International Conference on World Wide Web, WWW 2015, Florence, Italy, May 18-22, 2015
2012
doi
dblp
Degree relations of triangles in real-world networks and graph models.
Nurcan Durak
|
Ali Pinar
|
Tamara G. Kolda
|
C. Seshadhri
21st ACM International Conference on Information and Knowledge Management, CIKM'12, Maui, HI, USA, October 29 - November 02, 2012