Follow
H. Ramesh
H. Ramesh
Professor of Computer Science, Indian Institute of Science, CTO, Strand Life Sciences
Verified email at strandls.com
Title
Cited by
Cited by
Year
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
10192004
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
1952011
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
1651997
Dynamic LCA queries on trees
R Cole, R Hariharan
SIAM Journal on Computing 34 (4), 894-923, 2005
1642005
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
1612002
Approximate string matching: A simpler faster algorithm
R Cole, R Hariharan
SIAM Journal on Computing 31 (6), 1761-1782, 2002
1602002
Algorithms for enumerating all spanning trees of undirected and weighted graphs
S Kapoor, H Ramesh
SIAM Journal on Computing 24 (2), 247-265, 1995
1601995
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
1392000
Derandomizing semidefinite programming based approximation algorithms
S Mahajan, H Ramesh
Proceedings of IEEE 36th Annual Foundations of Computer Science, 162-169, 1995
1361995
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
116*2007
Hardness of set cover with intersection 1
VSA Kumar, S Arya, H Ramesh
International Colloquium on Automata, Languages, and Programming, 624-635, 2000
1142000
Optimal parallel suffix tree construction
R Hariharan
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994
1091994
Derandomizing approximation algorithms based on semidefinite programming
S Mahajan, H Ramesh
SIAM Journal on Computing 28 (5), 1641-1663, 1999
1031999
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
942007
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
902000
String matching in O (n+ m) quantum time
H Ramesh, V Vinay
Journal of Discrete Algorithms 1 (1), 103-110, 2003
892003
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
882012
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
852018
Overlap matching
A Amir, R Cole, R Hariharan, M Lewenstein, E Porat
Information and Computation 181 (1), 57-74, 2003
852003
Covering rectilinear polygons with axis-parallel rectangles
VS Anil Kumar, H Ramesh
Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999
80*1999
The system can't perform the operation now. Try again later.
Articles 1–20