Ramesh Hariharan

Available identifiers

zbMath Open hariharan.rameshMaRDI QIDQ1370857

List of research outcomes

Publication	Date of Publication	Type
Faster enumeration of all spanning trees of a directed graph	2022-12-16	Paper
A general framework for graph sparsification	2019-09-02	Paper
Fast edge orientation for unweighted graphs	2019-05-06	Paper
Optimal parallel suffix tree construction	2016-09-01	Paper
Efficient algorithms for computing all low \(s\)-\(t\) edge connectivities and related problems	2014-12-18	Paper
Faster suffix tree construction with missing suffix links	2014-09-26	Paper
A general framework for graph sparsification	2014-06-05	Paper
A fast algorithm for computing steiner edge connectivity	2010-08-16	Paper
https://portal.mardi4nfdi.de/entity/Q3579486	2010-08-06	Paper
Verifying candidate matches in sparse and wildcard matching	2010-08-05	Paper
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths	2010-08-05	Paper
Faster Algorithms for Minimum Cycle Basis in Directed Graphs	2009-08-20	Paper
A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs	2009-03-12	Paper
An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs	2009-01-05	Paper
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths	2007-06-08	Paper
Dynamic LCA Queries on Trees	2005-09-16	Paper
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science	2005-08-12	Paper
https://portal.mardi4nfdi.de/entity/Q4471322	2004-07-28	Paper
Faster Suffix Tree Construction with Missing Suffix Links	2004-01-08	Paper
Tree Pattern Matching to Subset Matching in Linear Time	2003-09-28	Paper
Overlap matching.	2003-08-19	Paper
A faster implementation of the Goemans-Williamson clustering algorithm	2003-01-20	Paper
Approximate String Matching: A Simpler Faster Algorithm	2002-09-29	Paper
Overlap matching	2002-06-18	Paper
https://portal.mardi4nfdi.de/entity/Q4228434	2002-01-21	Paper
An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees	2001-03-19	Paper
https://portal.mardi4nfdi.de/entity/Q4526971	2001-02-28	Paper
https://portal.mardi4nfdi.de/entity/Q4252294	2000-06-21	Paper
https://portal.mardi4nfdi.de/entity/Q4252293	1999-06-17	Paper
https://portal.mardi4nfdi.de/entity/Q4250214	1999-06-17	Paper
Optimal parallel suffix tree construction	1998-01-07	Paper
Tighter Upper Bounds on the Exact Complexity of String Matching	1997-06-12	Paper
https://portal.mardi4nfdi.de/entity/Q4875202	1996-10-31	Paper
Tighter Lower Bounds on the Exact Complexity of String Matching	1995-03-27	Paper

Research outcomes over time

This page was built for person: Ramesh Hariharan