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
9462004
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
1641997
A general framework for graph sparsification
WS Fung, R Hariharan, NJA Harvey, D Panigrahi
SIAM Journal on Computing 48 (4), 1196-1223, 2019
1602019
Approximate string matching: A simpler faster algorithm
R Cole, R Hariharan
SIAM Journal on Computing 31 (6), 1761-1782, 2002
1532002
Algorithms for enumerating all spanning trees of undirected and weighted graphs
S Kapoor, H Ramesh
SIAM Journal on Computing 24 (2), 247-265, 1995
1511995
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
1432002
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
1352000
Derandomizing semidefinite programming based approximation algorithms
S Mahajan, H Ramesh
Proceedings of IEEE 36th Annual Foundations of Computer Science, 162-169, 1995
1351995
Optimal parallel suffix tree construction
R Hariharan
Journal of Computer and System Sciences 55 (1), 44-69, 1997
1051997
Hardness of set cover with intersection 1
VS Kumar, S Arya, H Ramesh
International Colloquium on Automata, Languages, and Programming, 624-635, 2000
1042000
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
101*2007
Derandomizing approximation algorithms based on semidefinite programming
S Mahajan, H Ramesh
SIAM Journal on Computing 28 (5), 1641-1663, 1999
971999
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
862007
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
832012
Faster suffix tree construction with missing suffix links
R Cole, R Hariharan
SIAM Journal on Computing 33 (1), 26-42, 2003
832003
Overlap matching
A Amir, R Cole, R Hariharan, M Lewenstein, E Porat
Information and Computation 181 (1), 57-74, 2003
792003
Dynamic LCA Queries on Trees.
R Cole, R Hariharan
SODA 99, 235-244, 1999
791999
Dynamic LCA queries on trees
R Cole, R Hariharan
SIAM Journal on Computing 34 (4), 894-923, 2005
782005
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
73*1999
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
652016
The system can't perform the operation now. Try again later.
Articles 1–20