| Efficient multicore algorithms for identifying biconnected components M Chaitanya, K Kothapalli International Journal of Networking and Computing 6 (1), 87-106, 2016 | 26 | 2016 |
| Efficient parallel ear decomposition of graphs with application to betweenness-centrality C Pachorkar, M Chaitanya, K Kothapalli, D Bera 2016 IEEE 23rd International Conference on High Performance Computing (HiPC …, 2016 | 23 | 2016 |
| Work efficient parallel algorithms for large graph exploration on emerging heterogeneous architectures DS Banerjee, A Kumar, M Chaitanya, S Sharma, K Kothapalli Journal of Parallel and Distributed Computing 76, 81-93, 2015 | 17 | 2015 |
| Applications of ear decomposition to efficient heterogeneous algorithms for shortest path/cycle problems D Dutta, M Chaitanya, K Kothapalli, D Bera 2017 IEEE International Parallel and Distributed Processing Symposium …, 2017 | 6 | 2017 |
| Applications of ear decomposition to efficient heterogeneous algorithms for shortest path/cycle problems D Dutta, M Chaitanya, K Kothapalli, D Bera International Journal of Networking and Computing 8 (1), 73-92, 2018 | 4 | 2018 |
| A simple parallel algorithm for biconnected components in sparse graphs M Chaitanya, K Kothapalli 2015 IEEE International Parallel and Distributed Processing Symposium …, 2015 | 4 | 2015 |
| Tight Sampling in Unbounded Networks K Jaglan, M Chaitanya, T Sharma, A Singam, N Goyal, P Kumaraguru, ... arXiv preprint arXiv:2310.02859, 2023 | | 2023 |
| Hardness Results for Seeding Complex Contagion with Neighborhoods M Chaitanya, U Brandes International Conference on Complex Networks and Their Applications, 207-216, 2021 | | 2021 |
