| Finding communities by clustering a graph into overlapping subgraphs. J Baumes, MK Goldberg, MS Krishnamoorthy, M Magdon-Ismail, ... IADIS AC 5, 97-104, 2005 | 298 | 2005 |
| A random walk method for alleviating the sparsity problem in collaborative filtering H Yildirim, MS Krishnamoorthy Proceedings of the 2008 ACM conference on Recommender systems, 131-138, 2008 | 278 | 2008 |
| Syntactic segmentation and labeling of digitized pages from technical journals M Krishnamoorthy, G Nagy, S Seth, M Viswanathan IEEE Transactions on Pattern Analysis and Machine Intelligence 15 (7), 737-747, 1993 | 265 | 1993 |
| Fault diameter of interconnection networks MS Krishnamoorthy, B Krishnamurthy Computers & Mathematics with Applications 13 (5-6), 577-582, 1987 | 259 | 1987 |
| Modeling and multiway analysis of chatroom tensors E Acar, SA Camtepe, MS Krishnamoorthy, B Yener Intelligence and Security Informatics: IEEE International Conference on …, 2005 | 195 | 2005 |
| Algorithms for generating fundamental cycles in a graph N Deo, G Prabhu, MS Krishnamoorthy ACM Transactions on Mathematical Software (TOMS) 8 (1), 26-42, 1982 | 174 | 1982 |
| Graph theoretic and spectral analysis of Enron email data A Chapanond, MS Krishnamoorthy, B Yener Computational & Mathematical Organization Theory 11, 265-281, 2005 | 164 | 2005 |
| A mechanizable induction principle for equational specifications H Zhang, D Kapur, MS Krishnamoorthy International Conference on Automated Deduction, 162-181, 1988 | 160 | 1988 |
| An NP-hard problem in bipartite graphs MS Krishnamoorthy ACM SIGACT News 7 (1), 26-26, 1975 | 132 | 1975 |
| On the harmonious coloring of graphs JE Hopcroft, MS Krishnamoorthy SIAM Journal on Algebraic Discrete Methods 4 (3), 306-311, 1983 | 120 | 1983 |
| Node-deletion NP-complete problems MS Krishnamoorthy, N Deo SIAM Journal on Computing 8 (4), 619-625, 1979 | 109 | 1979 |
| Parallel algorithms for matrix normal forms E Kaltofen, MS Krishnamoorthy, BD Saunders Linear Algebra and its Applications 136, 189-208, 1990 | 103 | 1990 |
| Exact and approximate solutions for the gate matrix layout problem N Deo, MS Krishnamoorthy, MA Langston IEEE transactions on computer-aided design of integrated circuits and …, 1987 | 103 | 1987 |
| Fast parallel computation of Hermite and Smith forms of polynomial matrices E Kaltofen, MS Krishnamoorthy, BD Saunders SIAM Journal on Algebraic Discrete Methods 8 (4), 683-690, 1987 | 102 | 1987 |
| LOGML: Log markup language for web usage mining JR Punin, MS Krishnamoorthy, MJ Zaki WEBKDD 2001—Mining Web Log Data Across All Customers Touch Points: Third …, 2002 | 97 | 2002 |
| Model-based analysis of printed tables EA Green, MS Krishnamoorthy Graphics Recognition Methods and Applications: First International Workshop …, 1996 | 85 | 1996 |
| Web usage mining—Languages and algorithms JR Punin, MS Krishnamoorthy, MJ Zaki Exploratory Data Analysis in Empirical Research: Proceedings of the 25 th …, 2003 | 82 | 2003 |
| Computer-implemented interactive, virtual bookshelf system and method TV Raman, MS Krishnamoorthy US Patent 7,778,994, 2010 | 74 | 2010 |
| Two complementary techniques for digitized document analysis G Nagy, J Kanai, M Krishnamoorthy, M Thomas, M Viswanathan Proceedings of the ACM conference on Document processing systems, 169-176, 2000 | 65 | 2000 |
| Complexity of the minimum‐dummy‐activities problem in a PERT network MS Krishnamoorthy, N Deo Networks 9 (3), 189-194, 1979 | 65 | 1979 |
