MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 14 documents:

  1. A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
    Ramesh Hariharan, Kavitha Telikepalli, and Kurt Mehlhorn
    In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, Venice, Italy, 2006, 250-261
    [PDF: Download: Mehlhorn_2006_a_m.pdf]
  2. An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
    Richard Cole, Martin Farach-Colton, Ramesh Hariharan, Teresa Przytycka, and Mikkel Thorup
    SIAM Journal on Computing 30 (5): 1385-1404, 2000
  3. Hardness of Set Cover with Intersection 1
    V. S. Anil Kumar, Sunil Arya, and Hariharan Ramesh
    In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), Geneva, Switzerland, July 9-15, 2000, 2000, 624-635
  4. Covering Rectilinear Polygons with Axis-Parallel Rectangles
    V. S. Anil Kumar and Hariharan Ramesh
    In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99), Atlanta, USA, May 1-4, 1999, 1999, 445-454
  5. Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain
    V. S. Anil Kumar and Hariharan Ramesh
    In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS-99), New York, USA, October 17-19, 1999, 1999, 241-251
  6. A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
    Maxime Crochemore, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, and Wojciech Rytter
    SIAM Journal on Computing 27 (3): 668-681, 1998
  7. An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
    Richard Cole and Ramesh Hariharan
    In: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), Georgia, USA, January, 28-30, 1996, 323-332
  8. Approximate hypergraph coloring
    Pierre Kelsen, Sanjeev Mahajan, and Hariharan Ramesh
    In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, July 3-5, 1996, 41-52
  9. Coloring 2-colorable hypergraphs with a sublinear number of colors
    Ramesh Hariharan, Pierre Kelsen, and Sanjeev Mahajan
    In: Scandinavian Workshop on Algorithm Theory (SWAT96), Reykjavik, Iceland, July, 3-5, 1996, 41-52
  10. Optimal Parallel Construction of Minimal Suffix and Factor Automata
    Dany Breslauer and Hariharan Ramesh
    Parallel Processing Letters 6 (1): 35-44, 1996
  11. Algorithms for Enumerating all Spanning Trees of an Undirected Graph
    Ramesh Hariharan and Sanjiv Kapoor
    SIAM Journal on Computing 24 (2): 247-265, 1995
  12. Derandomizing semidefinite programming based approximation algorithms
    Ramesh Hariharan and Sanjeev Mahajan
    In: 36th IEEE Symposium on Foundations of Computer Science, 1995, 162-16
  13. String Matching over a General Matching Relation
    Ramesh Hariharan and S. Muthukrishnan
    Information and Computation 122 (1): 140-148, 1995
  14. Tighter Lower Bounds on the Exact Complexity of String Matching
    Richard Cole, Ramesh Hariharan, Mike Paterson, and Uri Zwick
    SIAM Journal on Computing 24 (1): 30-45, 1995