PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Hariharan, Ramesh"

Author of the publication

copydeleteadd this publication to your clipboard
MultiMCS: A Fast Algorithm for the Maximum Common Substructure Problem on Multiple Molecules.

, , , , , , and . Journal of Chemical Information and Modeling, 51 (4): 788-806 (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Hariharan, Ramesh
add a person with the name Hariharan, Ramesh
 

Other publications of authors with the same name

Maximum Agreement Subtree (of 2 Binary Trees).. Encyclopedia of Algorithms, (2016)An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees., , , , and . SIAM J. Comput., 30 (5): 1385-1404 (2000)Tighter Upper Bounds on the Exact Complexity of String Matching., and . SIAM J. Comput., 26 (3): 803-856 (1997)Data-Driven Biology and Computation.. IC3, volume 306 of Communications in Computer and Information Science, page 7. Springer, (2012)MultiMCS: A Fast Algorithm for the Maximum Common Substructure Problem on Multiple Molecules., , , , , , and . Journal of Chemical Information and Modeling, 51 (4): 788-806 (2011)A fast algorithm for computing steiner edge connectivity., and . STOC, page 167-176. ACM, (2003)Verifying candidate matches in sparse and wildcard matching., and . STOC, page 592-601. ACM, (2002)Short-Cuts on Star, Source and Planar Unfoldings., , and . FSTTCS, volume 3328 of Lecture Notes in Computer Science, page 174-185. Springer, (2004)HiCOMB 2015 Keynote and Invited Talks., , , , , and . IPDPS Workshops, page 331. IEEE Computer Society, (2015)Approximate Hypergraph Coloring., , , and . Nord. J. Comput., 3 (4): 425-439 (1996)