| 2019 | HiPC | Genome Sequencing for Disease Diagnosis: The Confluence of Biology and Computing. | Ramesh Hariharan |
| 2011 | STOC | A general framework for graph sparsification. | Wai Shing Fung, Ramesh Hariharan, Nicholas J. A. Harvey, Debmalya Panigrahi |
| 2009 | SODA | Fast edge orientation for unweighted graphs. | Anand Bhalgat, Ramesh Hariharan |
| 2008 | SODA | Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. | Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi |
| 2007 | SODA | Efficient algorithms for computing all low | Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi |
| 2007 | STOC | An (mn) Gomory-Hu tree construction algorithm for unweighted graphs. | Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat |
| 2006 | ICALP | A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. | Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn |
| 2003 | SODA | Maintaining all-pairs approximate shortest paths under deletion of edges. | Surender Baswana, Ramesh Hariharan, Sandeep Sen |
| 2003 | STOC | A fast algorithm for computing steiner edge connectivity. | Richard Cole, Ramesh Hariharan |
| 2002 | STOC | Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. | Surender Baswana, Ramesh Hariharan, Sandeep Sen |
| 2002 | STOC | Verifying candidate matches in sparse and wildcard matching. | Richard Cole, Ramesh Hariharan |
| 2001 | SODA | Overlap matching. | Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat |
| 2001 | SODA | A faster implementation of the Goemans-Williamson clustering algorithm. | Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat |
| 2000 | STOC | Faster suffix tree construction with missing suffix links. | Richard Cole, Ramesh Hariharan |
| 1999 | SODA | Dynamic LCA Queries on Trees. | Richard Cole, Ramesh Hariharan |
| 1999 | SODA | Tree Pattern Matching and Subset Matching in Deterministic | Richard Cole, Ramesh Hariharan, Piotr Indyk |
| 1998 | SODA | Approximate String Matching: A Simpler Faster Algorithm. | Richard Cole, Ramesh Hariharan |
| 1997 | STOC | Tree Pattern Matching and Subset Matching in Randomized O(n log | Richard Cole, Ramesh Hariharan |
| 1996 | SODA | An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. | Richard Cole, Ramesh Hariharan |
| 1995 | FOCS | Derandomizing Semidefinite Programming Based Approximation Algorithms. | Sanjeev Mahajan, Ramesh Hariharan |
| 1995 | WADS | Faster Enumeration of All Spanning Trees of a Directed Graph. | Ramesh Hariharan, Sanjiv Kapoor, Vijay Kumar |
| 1994 | ICALP | Optimal Parallel Algorithms for Prefix Matching. | Ramesh Hariharan, S. Muthukrishnan |
| 1994 | STOC | Optimal parallel suffix tree construction. | Ramesh Hariharan |
| 1993 | FOCS | Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions | Richard Cole, Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park, Wojciech Rytter |
| 1992 | FOCS | Tighter Bounds on the Exact Complexity of String Matching (Extended Abstract) | Richard Cole, Ramesh Hariharan |