| Linear time subgraph counting, graph degeneracy, and the chasm at size six SK Bera, N Pashanasangi, C Seshadhri arXiv preprint arXiv:1911.05896, 2019 | 33 | 2019 |
| Efficiently counting vertex orbits of all 5-vertex subgraphs, by evoke N Pashanasangi, C Seshadhri Proceedings of the 13th International Conference on Web Search and Data …, 2020 | 20 | 2020 |
| Near-linear time homomorphism counting in bounded degeneracy graphs: The barrier of long induced cycles SK Bera, N Pashanasangi, C Seshadhri Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 16 | 2021 |
| Faster and generalized temporal triangle counting, via degeneracy ordering N Pashanasangi, C Seshadhri Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data …, 2021 | 8 | 2021 |
| The Role of Degeneracy in Real-World Subgraph Counting N Pashanasangi University of California, Santa Cruz, 2021 | | 2021 |
C. SeshadhriUniversity of California, Santa Cruzucsc.edu의 이메일 확인됨
