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