Concepedia

Ramesh Hariharan

RH

Statistics

Publications

34

Citations

1.4K

H-Index

24

Active since

1994

Affiliations

Indian Institute of Science Bangalore(Current)

Courant Institute of Mathematical Sciences

New York University

Strand Life Sciences (India)

Max Planck Society

Ramesh Hariharan is an author at Indian Institute of Science Bangalore specializing in computer science, engineering, and combinatorial optimization.

Top concepts

EngineeringComputer ScienceCombinatorial OptimizationComputational ComplexityData ScienceDiscrete MathematicsData MiningGraph TheoryKnowledge DiscoveryNetwork Analysis

Publications per year

1994–2019

34

Publications

34

Verifying candidate matches in sparse and wildcard matching

Richard Cole, Ramesh Hariharan · 2002 · 133 citations

Combinatorics On Word, Engineering, Information Retrieval +13

A general framework for graph sparsification

Wai Shing Fung, Ramesh Hariharan, Nicholas J. A. Harvey et al. · 2011 · 102 citations

Graph Sparsity, Engineering, Network Analysis +18

An <i>O</i>(<i>n</i>log <i>n</i>) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees

Richard Cole, Martı́n Farach-Colton, Ramesh Hariharan et al. · SIAM Journal on Computing · 2000 · 87 citations

Binary Trees, Tree Language, Engineering +12

Approximate String Matching: A Simpler Faster Algorithm

Richard Cole, Ramesh Hariharan · SIAM Journal on Computing · 2002 · 85 citations

Engineering, Pattern Discovery, Approximate Matches +17

Dynamic LCA Queries on Trees

Richard Cole, Ramesh Hariharan · SIAM Journal on Computing · 2005 · 84 citations

Cluster Computing, Independent Interest, Tree Language +14

1–5 of 34