| 2026 | SODA | Faster Estimation of the Average Degree of a Graph Using Random Edges and Structural Queries. | Lorenzo Beretta, Deeparnab Chakrabarty, C. Seshadhri |
| 2026 | SODA | Near-linear time subhypergraph counting in bounded degeneracy hypergraphs. | Daniel Paul-Pena, C. Seshadhri |
| 2025 | ICALP | Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs. | Daniel Paul-Pena, C. Seshadhri |
| 2025 | SODA | A Dichotomy Hierarchy for Linear Time Subgraph Counting in Bounded Degeneracy Graphs. | Daniel Paul-Pena, C. Seshadhri |
| 2025 | STOC | Monotonicity Testing of High-Dimensional Distributions with Subcube Conditioning. | Deeparnab Chakrabarty, Xi Chen, Simeon Ristic, C. Seshadhri, Erik Waingarten |
| 2025 | WSDM | A Sublinear Algorithm for Approximate Shortest Paths in Large Networks. | Sabyasachi Basu, Nadia Koshima, Talya Eden, Omri Ben-Eliezer, C. Seshadhri |
| 2024 | CIKM | 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 |
| 2024 | ICDM | Accurate and Fast Estimation of Temporal Motifs Using Path Sampling. | Yunjie Pan, Omkar Bhalerao, C. Seshadhri, Nishil Talati |
| 2024 | ISAAC | A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs. | Daniel Paul-Pena, C. Seshadhri |
| 2024 | PODC | Brief Announcement: Improved Massively Parallel Triangle Counting in O(1) Rounds. | Quanquan C. Liu, C. Seshadhri |
| 2023 | FOCS | A d | Hadley Black, Deeparnab Chakrabarty, C. Seshadhri |
| 2023 | ICDT | Some Vignettes on Subgraph Counting Using Graph Orientations (Invited Talk). | C. Seshadhri |
| 2023 | ICML | Theoretical Bounds on the Network Community Profile from Low-rank Semi-definite Programming. | Yufan Huang, C. Seshadhri, David F. Gleich |
| 2023 | STOC | Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an (n√d) Monotonicity Tester. | Hadley Black, Deeparnab Chakrabarty, C. Seshadhri |
| 2022 | SODA | The complexity of testing all properties of planar graphs, and the role of isomorphism. | Sabyasachi Basu, Akash Kumar, C. Seshadhri |
| 2022 | SDM | Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling. | Andrew Stolman, Caleb C. Levy, C. Seshadhri, Aneesh Sharma |
| 2021 | FOCS | Random walks and forbidden minors III: $\text{poly}\left(d\varepsilon ^{-1}\right)$-time partition oracles for minor-free graph classes. | Akash Kumar, C. Seshadhri, Andrew Stolman |
| 2021 | KDD | Faster and Generalized Temporal Triangle Counting, via Degeneracy Ordering. | Noujan Pashanasangi, C. Seshadhri |
| 2021 | SODA | Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles. | Suman K. Bera, Noujan Pashanasangi, C. Seshadhri |
| 2020 | KDD | How to Count Triangles, without Seeing the Whole Graph. | Suman K. Bera, C. Seshadhri |
| 2020 | PODS | How the Degeneracy Helps for Triangle Counting in Graph Streams. | Suman K. Bera, C. Seshadhri |
| 2020 | WWW | Provably and Efficiently Approximating Near-cliques using the Turn Shadow: PEANUTS. | Shweta Jain, C. Seshadhri |
| 2020 | SODA | Domain Reduction for Monotonicity Testing: A | Hadley Black, Deeparnab Chakrabarty, C. Seshadhri |
| 2020 | SODA | Faster sublinear approximation of the number of | Talya Eden, Dana Ron, C. Seshadhri |
| 2020 | WSDM | The Power of Pivoting for Exact Clique Counting. | Shweta Jain, C. Seshadhri |
| 2020 | WSDM | Efficiently Counting Vertex Orbits of All 5-vertex Subgraphs, by EVOKE. | Noujan Pashanasangi, C. Seshadhri |
| 2019 | STOC | Random walks and forbidden minors II: a poly( | Akash Kumar, C. Seshadhri, Andrew Stolman |
| 2018 | FOCS | Finding Forbidden Minors in Sublinear Time: A n^1/2+o(1)-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs. | Akash Kumar, C. Seshadhri, Andrew Stolman |
| 2018 | ICALP | Finding Cliques in Social Networks: A New Distribution-Free Model. | Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein |
| 2018 | WWW | Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples. | Talya Eden, Shweta Jain, Ali Pinar, Dana Ron, C. Seshadhri |
| 2018 | SODA | A | Hadley Black, Deeparnab Chakrabarty, C. Seshadhri |
| 2018 | STOC | On approximating the number of k-cliques in sublinear time. | Talya Eden, Dana Ron, C. Seshadhri |
| 2017 | ICALP | Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps. | Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri |
| 2017 | ICALP | Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection. | Talya Eden, Dana Ron, C. Seshadhri |
| 2017 | WWW | A Fast and Provable Method for Estimating Clique Counts Using Turn's Theorem. | Shweta Jain, C. Seshadhri |
| 2017 | WWW | ESCAPE: Efficiently Counting All 5-Vertex Subgraphs. | Ali Pinar, C. Seshadhri, Vaidyanathan Vishal |
| 2017 | WWW | When Hashes Met Wedges: A Distributed Algorithm for Finding High Similarity Vectors. | Aneesh Sharma, C. Seshadhri, Ashish Goel |
| 2017 | SODA | Accurate and Nearly Optimal Sublinear Approximations to Ulam Distance. | Timothy Naumovitz, Michael E. Saks, C. Seshadhri |
| 2015 | ACSSC | Counting triangles in real-world graph streams: Dealing with repeated edges and time windows. | Madhav Jha, Ali Pinar, C. Seshadhri |
| 2015 | FOCS | Approximately Counting Triangles in Sublinear Time. | Talya Eden, Amit Levi, Dana Ron, C. Seshadhri |
| 2015 | ICDM | Diamond Sampling for Approximate Maximum All-Pairs Dot-Product (MAD) Search. | Grey Ballard, Tamara G. Kolda, Ali Pinar, C. Seshadhri |
| 2015 | ICDM | Catching the Head, Tail, and Everything in Between: A Streaming Algorithm for the Degree Distribution. | Olivia Simpson, C. Seshadhri, Andrew McGregor |
| 2015 | WWW | Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts. | Madhav Jha, C. Seshadhri, Ali Pinar |
| 2015 | WWW | Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions. | Ahmet Erdem Sariyce, C. Seshadhri, Ali Pinar, mit V. atalyrek |
| 2015 | SODA | Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties. | Deeparnab Chakrabarty, Kashyap Dixit, Madhav Jha, C. Seshadhri |
| 2013 | KDD | A space efficient streaming algorithm for triangle counting using the birthday paradox. | Madhav Jha, C. Seshadhri, Ali Pinar |
| 2013 | SODA | Space efficient streaming algorithms for the distance to monotonicity and asymmetric edit distance. | Michael E. Saks, C. Seshadhri |
| 2013 | STOC | A o(n) monotonicity tester for boolean functions over the hypercube. | Deeparnab Chakrabarty, C. Seshadhri |
| 2013 | STOC | Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids. | Deeparnab Chakrabarty, C. Seshadhri |
| 2013 | SDM | Triadic Measures on Graphs: The Power of Wedge Sampling. | Tamara G. Kolda, Ali Pinar, C. Seshadhri |
| 2012 | CIKM | Degree relations of triangles in real-world networks and graph models. | Nurcan Durak, Ali Pinar, Tamara G. Kolda, C. Seshadhri |
| 2012 | KDD | Vertex neighborhoods, low conductance cuts, and good seeds for local community methods. | David F. Gleich, C. Seshadhri |
| 2012 | SDM | The Similarity Between Stochastic Kronecker and Chung-Lu Graph Models. | C. Seshadhri, Ali Pinar, Tamara G. Kolda |
| 2012 | WAW | Are We There Yet? When to Stop a Markov Chain while Generating Random Graphs. | Jaideep Ray, Ali Pinar, C. Seshadhri |
| 2011 | ICDM | An In-depth Study of Stochastic Kronecker Graphs. | C. Seshadhri, Ali Pinar, Tamara G. Kolda |
| 2011 | STOC | Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter. | Nitin Saxena, C. Seshadhri |
| 2010 | FOCS | Estimating the Longest Increasing Sequence in Polylogarithmic Time. | Michael E. Saks, C. Seshadhri |
| 2010 | FOCS | From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Depth-3 Circuits. | Nitin Saxena, C. Seshadhri |
| 2010 | SODA | Self-improving Algorithms for Convex Hulls. | Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri |
| 2009 | ICML | Efficient learning algorithms for changing environments. | Elad Hazan, C. Seshadhri |
| 2008 | FOCS | Noise Tolerance of Expanders and Sublinear Expander Reconstruction. | Satyen Kale, Yuval Peres, C. Seshadhri |
| 2008 | ICALP | An Expansion Tester for Bounded Degree Graphs. | Satyen Kale, C. Seshadhri |
| 2008 | SODA | Parallel monotonicity reconstruction. | Michael E. Saks, C. Seshadhri |