| No. |
Title |
Author |
Year |
| 1 |
Some Vignettes on Subgraph Counting Using Graph Orientations (Invited Talk) |
Seshadhri, C. |
2023 |
| 2 |
FPT Algorithms for Finding Near-Cliques in c-Closed Graphs |
Behera, Balaram et al. |
2022 |
| 3 |
Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six |
Bera, Suman K. et al. |
2020 |
| 4 |
Adaptive Boolean Monotonicity Testing in Total Influence Time |
Chakrabarty, Deeparnab et al. |
2018 |
| 5 |
Finding Cliques in Social Networks: A New Distribution-Free Model |
Fox, Jacob et al. |
2018 |
| 6 |
Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps |
Baleshzar, Roksana et al. |
2017 |
| 7 |
Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection |
Eden, Talya et al. |
2017 |
| 8 |
Avoiding the Global Sort: A Faster Contour Tree Algorithm |
Raichel, Benjamin et al. |
2016 |
