| Endocytosis by random initiation and stabilization of clathrin-coated pits M Ehrlich, W Boll, A Van Oijen, R Hariharan, K Chandran, ML Nibert, ... Cell 118 (5), 591-605, 2004 | 1053 | 2004 |
| A general framework for graph sparsification WS Fung, R Hariharan, NJA Harvey, D Panigrahi Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 212 | 2011 |
| Dynamic LCA queries on trees R Cole, R Hariharan SIAM Journal on Computing 34 (4), 894-923, 2005 | 168 | 2005 |
| Tree pattern matching and subset matching in randomized O(nlog3m) time R Cole, R Hariharan Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997 | 167 | 1997 |
| Verifying candidate matches in sparse and wildcard matching R Cole, R Hariharan Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002 | 165 | 2002 |
| Approximate string matching: A simpler faster algorithm R Cole, R Hariharan SIAM Journal on Computing 31 (6), 1761-1782, 2002 | 163 | 2002 |
| Algorithms for enumerating all spanning trees of undirected and weighted graphs S Kapoor, H Ramesh SIAM Journal on Computing 24 (2), 247-265, 1995 | 162 | 1995 |
| An O (n log n) algorithm for the maximum agreement subtree problem for binary trees R Cole, M Farach-Colton, R Hariharan, T Przytycka, M Thorup SIAM Journal on Computing 30 (5), 1385-1404, 2000 | 147 | 2000 |
| Derandomizing semidefinite programming based approximation algorithms S Mahajan, H Ramesh Proceedings of IEEE 36th Annual Foundations of Computer Science, 162-169, 1995 | 139 | 1995 |
| Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths S Baswana, R Hariharan, S Sen Journal of Algorithms 62 (2), 74-92, 2007 | 117* | 2007 |
| Hardness of set cover with intersection 1 VSA Kumar, S Arya, H Ramesh International Colloquium on Automata, Languages, and Programming, 624-635, 2000 | 114 | 2000 |
| String matching in O (n+ m) quantum time H Ramesh, V Vinay Journal of Discrete Algorithms 1 (1), 103-110, 2003 | 110 | 2003 |
| Derandomizing approximation algorithms based on semidefinite programming S Mahajan, H Ramesh SIAM Journal on Computing 28 (5), 1641-1663, 1999 | 109 | 1999 |
| Optimal parallel suffix tree construction R Hariharan Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994 | 108 | 1994 |
| An O (mn) Gomory-Hu tree construction algorithm for unweighted graphs R Hariharan, T Kavitha, D Panigrahi, A Bhalgat Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007 | 96 | 2007 |
| Screening of over 1000 Indian patients with breast and/or ovarian cancer with a multi-gene panel: prevalence of BRCA1/2 and non-BRCA mutations J Singh, N Thota, S Singh, S Padhi, P Mohan, S Deshwal, S Sur, M Ghosh, ... Breast cancer research and treatment 170, 189-196, 2018 | 95 | 2018 |
| Faster suffix tree construction with missing suffix links R Cole, R Hariharan Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000 | 93 | 2000 |
| Next-generation sequencing of human mitochondrial reference genomes uncovers high heteroplasmy frequency MX Sosa, IKA Sivakumar, S Maragh, V Veeramachaneni, R Hariharan, ... PLoS computational biology 8 (10), e1002737, 2012 | 92 | 2012 |
| Overlap matching A Amir, R Cole, R Hariharan, M Lewenstein, E Porat Information and Computation 181 (1), 57-74, 2003 | 86 | 2003 |
| Detection of high frequency of mutations in a breast and/or ovarian cancer cohort: implications of embracing a multi-gene panel in molecular diagnosis in India AU Mannan, J Singh, R Lakshmikeshava, N Thota, S Singh, TS Sowmya, ... Journal of human genetics 61 (6), 515-522, 2016 | 84 | 2016 |
