Hariharan, Ramesh - Department of Computer Science and Automation, Indian Institute of Science, Bangalore

• Optimal Parallel Su x Tree Construction Ramesh Hariharany
• Stratagene-Strand White Papers Grammatica: The PathwayArchitect NLP Engine
• Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
• A Faster Implementation of the Goemans-Williamson Clustering Richard Cole
• On Traversing Layered Graphs On-line Courant Institute, New York University
• Verifying Candidate Matches in Sparse and Wildcard [Extended Abstract]
• Polynomial Factoring Ramesh Hariharan
• Who Will Win the Toss? H. Ramesh & V. Vinay
• Fast Edge Splitting and Edmonds' Arborescence Construction for Unweighted Graphs
• Overlap Matching Amihood Amir Richard Coley Ramesh Hariharanz
• An Algorithm for Enumerating All Spanning Trees of a Directed Graph
• AN O(N log N) ALGORITHM FOR THE MAXIMUM AGREEMENT SUBTREE
• DERANDOMIZING APPROXIMATION ALGORITHMS BASED ON SEMIDEFINITE PROGRAMMING
• Ashley Publications Ltd www.ashley-pub.com
• Endocytosis by random initiation and stabilization of clathrin-coated pits
• Short-cuts on Star, Source and Planar Vijay Chandru, Ramesh Hariharan & Narasimha M. Krishnakumar
• Efficient Algorithms for Computing All Low s-t Edge Connectivities and Related Problems
• Efficient Algorithms for Steiner Edge Connectivity Computation and Gomory-Hu Tree Construction for Unweighted Graphs
• Fast Edge Orientation for Unweighted Graphs Anand Bhalgat Ramesh Hariharan
• A General Framework for Graph Sparsification Wai Shing Fung
• Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. COMPUT. c 2008 Society for Industrial and Applied Mathematics
• Is it Prime or not? Ramesh Hariharan
• Topics in Algorithms 2005 The Turnpike Problem
• The Mahler Measure of a Polynomial Ramesh Hariharan
• Topics in Algorithms 2005 Disjoint Paths, Cuts, Arborescences
• Fast Algorithms for Connectivity Problems in Steiner Cuts, Gomory-Hu Trees, and Edge Splitting
• Topics in Algorithms 2005 Ramesh Hariharan
• Topics in Algorithms 2007 Ramesh Hariharan
• Topics in Algorithms 2007 Ramesh Hariharan
• Topics in Algorithms 2007 Ramesh Hariharan
• Topics in Algorithms 2007 Ramesh Hariharan
• BRICSRS-95-16Breslauer&Hariharan:ParallelConstructionofSuffixandFactorAutomata BRICSBasic Research in Computer Science
• Topics in Algorithms 2005 Linear Programming and Duality
• A 2.5 Factor Approximation Algorithm for the k-MST Sunil Arya H. Rameshy
• Hardness of Set Cover with Intersection 1 V.S.Anil Kumar1
• String Matching in ~O( pm) Quantum Time
• Graph Partitioning through Geometric A Review of the ARV Algorithm
• Coloring 2-colorable Hypergraphs with a Sublinear Number of Colors
• Graph Sparsification while Maintaining Cuts Ramesh Hariharan
• Tighter Upper Bounds on The Exact Complexity of String Richard Coley Ramesh Hariharanz
• Topics in Algorithms 2005 Edge Splitting, Packing Arborescences
• Maintaining All-Pairs Approximate Shortest Paths under Deletion of Edges Surender Baswana
• Coupling vs. Conductance for the Jerrum-Sinclair Chain
• A Fast Algorithm for Computing Steiner Edge Connectivity Richard Cole
• The LLL Algorithm for Basis Reduction Ramesh Hariharan
• Topics in Algorithms 2005 Constructing Well-Connected Networks