| Enumerating maximal bicliques from a large graph using mapreduce AP Mukherjee, S Tirthapura IEEE Transactions on Services Computing 10 (5), 771-784, 2016 | 58 | 2016 |
| Mining maximal cliques from an uncertain graph AP Mukherjee, P Xu, S Tirthapura 2015 IEEE 31st international conference on data engineering, 243-254, 2015 | 54 | 2015 |
| Mining maximal cliques from a large graph using mapreduce: Tackling highly uneven subproblem sizes M Svendsen, AP Mukherjee, S Tirthapura Journal of Parallel and distributed computing 79, 104-114, 2015 | 46 | 2015 |
| Enumeration of maximal cliques from an uncertain graph AP Mukherjee, P Xu, S Tirthapura IEEE Transactions on Knowledge and Data Engineering 29 (3), 543-555, 2016 | 40 | 2016 |
| Identifying correlated heavy-hitters in a two-dimensional data stream B Lahiri, AP Mukherjee, S Tirthapura Data mining and knowledge discovery 30, 797-818, 2016 | 14 | 2016 |
| Self-supervised system generating embeddings representing sequenced activity M Shrivastava, S Goyal, S Bhatnagar, C Pin-Jung, P Shukla, ... US Patent App. 16/930,279, 2021 | 5 | 2021 |
| Federated Graph Representation Learning using Self-Supervision S Suresh, D Godbout, A Mukherjee, M Shrivastava, J Neville, P Li The 1st International Workshop on Federated Learning with Graph Data, 2022 | 2 | 2022 |
| Expressive and Efficient Representation Learning for Ranking Links in Temporal Graphs S Suresh, M Shrivastava, A Mukherjee, J Neville, P Li Proceedings of the ACM Web Conference 2023, 567-577, 2023 | 1 | 2023 |
| Mining dense substructures from large deterministic and probabilistic graphs AP Mukherjee Iowa State University, 2015 | | 2015 |
Srikanta TirthapuraProfessor of Computer Engineering, Iowa State UniversityEmail verificata su iastate.edu
