| Data association and graph analytical processing of hard and soft intelligence data K Date, GA Gross, S Khopkar, R Nagi, K Sambhoos Proceedings of the 16th International Conference on Information Fusion, 404-411, 2013 | 30 | 2013 |
| Efficient algorithms for incremental all pairs shortest paths, closeness and betweenness in social network analysis SS Khopkar, R Nagi, AG Nikolaev, V Bhembre Social Network Analysis and Mining 4, 1-20, 2014 | 18 | 2014 |
| Predicting long-term product ratings based on few early ratings and user base analysis SS Khopkar, AG Nikolaev Electronic Commerce Research and Applications 21, 38-49, 2017 | 13 | 2017 |
| An Efficient Map-Reduce Algorithm for the Incremental Computation of All-Pairs Shortest Paths in Social Networks SS Khopkar, R Nagi, AG Nikolaev 2012 IEEE/ACM International Conference on Advances in Social Networks …, 2012 | 4 | 2012 |
| A penalty box approach for approximation betweenness and closeness centrality algorithms SS Khopkar, R Nagi, G Tauer Social Network Analysis and Mining 6, 1-13, 2016 | 3 | 2016 |
| Incremental algorithms for centrality metric calculations in social network analysis SS Khopkar State University of New York at Buffalo, 2010 | 2 | 2010 |
| Computational advances in data analytics with social networks S Khopkar State University of New York at Buffalo, 2017 | | 2017 |
| Engagement Capacity: a Metric to Find the Most Engaging User in a Social Network A Nikolaev, S Gore, S Khopkar, V Govindaraju | | 2015 |
Rakesh NagiHead of ESD, SUTD; Willett Professor of ISE, UIUCVerified email at illinois.edu
