| A fast and provable method for estimating clique counts using turán's theorem S Jain, C Seshadhri Proceedings of the 26th international conference on world wide web, 441-449, 2017 | 97 | 2017 |
| The power of pivoting for exact clique counting S Jain, C Seshadhri Proceedings of the 13th International Conference on Web Search and Data …, 2020 | 46 | 2020 |
| Provable and practical approximations for the degree distribution using sublinear graph samples T Eden, S Jain, A Pinar, D Ron, C Seshadhri Proceedings of the 2018 World Wide Web Conference, 449-458, 2018 | 45 | 2018 |
| Provably and efficiently approximating near-cliques using the Turán shadow: PEANUTS S Jain, C Seshadhri Proceedings of The Web Conference 2020, 1966-1976, 2020 | 14 | 2020 |
| FPT Algorithms for Finding Near-Cliques in -Closed Graphs B Behera, E Husić, S Jain, T Roughgarden, C Seshadhri arXiv preprint arXiv:2007.09768, 2020 | 10 | 2020 |
| Using cliques with higher-order spectral embeddings improves graph visualizations H Nassar, C Kennedy, S Jain, AR Benson, D Gleich Proceedings of The Web Conference 2020, 2927-2933, 2020 | 7 | 2020 |
| Taking Linux Filesystems to the Space Age: Space Maps in Ext4 S Kadekodi, S Jain Linux Symposium, 121, 2010 | 2 | 2010 |
| YACC: A Framework Generalizing TuránShadow for Counting Large Cliques S Jain, H Tong Proceedings of the 2022 SIAM International Conference on Data Mining (SDM …, 2022 | 1 | 2022 |
| Counting Cliques in Real-World Graphs S Jain University of California, Santa Cruz, 2020 | 1 | 2020 |
| An Exponentially Smaller Kernel for Exact Weighted Clique Decomposition S Jain, Y Mizutani, BD Sullivan SIAM Conference on Applied and Computational Discrete Algorithms (ACDA23 …, 2023 | | 2023 |
| Faster Decomposition of Weighted Graphs into Cliques using Fisher's Inequality S Jain, Y Mizutani, B Sullivan arXiv preprint arXiv:2206.07286, 2022 | | 2022 |
