| Publication | Date of Publication | Type |
|---|
Faster enumeration of all spanning trees of a directed graph
Lecture Notes in Computer Science | 2022-12-16 | Paper |
A general framework for graph sparsification
SIAM Journal on Computing | 2019-09-02 | Paper |
| Fast edge orientation for unweighted graphs | 2019-05-06 | Paper |
Optimal parallel suffix tree construction
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 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
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
A general framework for graph sparsification
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
A fast algorithm for computing steiner edge connectivity
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
| scientific article; zbMATH DE number 5764893 (Why is no real title available?) | 2010-08-06 | Paper |
Verifying candidate matches in sparse and wildcard matching
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Faster Algorithms for Minimum Cycle Basis in Directed Graphs
SIAM Journal on Computing | 2009-08-20 | Paper |
A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
Automata, Languages and Programming | 2009-03-12 | Paper |
An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing | 2009-01-05 | Paper |
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
Journal of Algorithms | 2007-06-08 | Paper |
Dynamic LCA Queries on Trees
SIAM Journal on Computing | 2005-09-16 | Paper |
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2005-08-12 | Paper |
| scientific article; zbMATH DE number 2079363 (Why is no real title available?) | 2004-07-28 | Paper |
Faster Suffix Tree Construction with Missing Suffix Links
SIAM Journal on Computing | 2004-01-08 | Paper |
Tree Pattern Matching to Subset Matching in Linear Time
SIAM Journal on Computing | 2003-09-28 | Paper |
Overlap matching.
Information and Computation | 2003-08-19 | Paper |
| A faster implementation of the Goemans-Williamson clustering algorithm | 2003-01-20 | Paper |
Approximate String Matching: A Simpler Faster Algorithm
SIAM Journal on Computing | 2002-09-29 | Paper |
| Overlap matching | 2002-06-18 | Paper |
| scientific article; zbMATH DE number 1256698 (Why is no real title available?) | 2002-01-21 | Paper |
An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees
SIAM Journal on Computing | 2001-03-19 | Paper |
| scientific article; zbMATH DE number 1559523 (Why is no real title available?) | 2001-02-28 | Paper |
| scientific article; zbMATH DE number 1305413 (Why is no real title available?) | 2000-06-21 | Paper |
| scientific article; zbMATH DE number 1305412 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1303588 (Why is no real title available?) | 1999-06-17 | Paper |
Optimal parallel suffix tree construction
Journal of Computer and System Sciences | 1998-01-07 | Paper |
Tighter Upper Bounds on the Exact Complexity of String Matching
SIAM Journal on Computing | 1997-06-12 | Paper |
| scientific article; zbMATH DE number 871929 (Why is no real title available?) | 1996-10-31 | Paper |
Tighter Lower Bounds on the Exact Complexity of String Matching
SIAM Journal on Computing | 1995-03-27 | Paper |
