Researcher Portfolio
Prof. Dr. Hariharan, Ramesh
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Researcher Profile
Position: Algorithms and Complexity, MPI for Informatics, Max Planck Society
Researcher ID: https://pure.mpg.de/cone/persons/resource/persons44586
External references
WorldCat
Search for Hariharan, Ramesh
Google Scholar
Search for Hariharan, Ramesh
Publications
: Hariharan, R., Kavitha, T., & Mehlhorn, K. (2008). Faster Algorithms for Minimum Cycle Basis in Directed Graphs. SIAM Journal on Computing, 38(4), 1430-1447. doi:10.1137/060670730. [PubMan] : Hariharan, R., Telikepalli, K., & Mehlhorn, K. (2006). A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. In Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I (pp. 250-261). Berlin, Germany: Springer. [PubMan] : Cole, R., Farach-Colton, M., Hariharan, R., Przytycka, T., & Thorup, M. (2000). An O(n log n) algorithm for the maximum agreement subtree problem for binary trees. SIAM Journal on Computing, 30(5), 1385-1404. Retrieved from http://epubs.siam.org/sam-bin/getfile/SICOMP/articles/31347.pdf. [PubMan] : Kumar, V. S. A., Arya, S., & Hariharan, R. (2000). Hardness of Set Cover with Intersection 1. In U. Montanari, J. D. P. Rolim, & E. Welzl (Eds. ), Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00) (pp. 624-635). Berlin, Germany: Springer. [PubMan] : Kumar, V. S. A., & Hariharan, R. (1999). Covering Rectilinear Polygons with Axis-Parallel Rectangles. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99) (pp. 445-454). New York, USA: ACM. [PubMan] : Kumar, V. S. A., & Hariharan, R. (1999). Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS-99) (pp. 241-251). Los Alamitos, USA: IEEE. [PubMan] : Crochemore, M., Gasieniec, L., Hariharan, R., Muthukrishnan, S., & Rytter, W. (1998). A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching. SIAM Journal on Computing, 27(3), 668-681. [PubMan] : Cole, R., & Hariharan, R. (1996). An O(n log n) algorithm for the maximum agreement subtree problem for binary trees. In 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96) (pp. 323-332). New York: acm. [PubMan] : Hariharan, R., Kelsen, P., & Mahajan, S. (1996). Coloring 2-colorable hypergraphs with a sublinear number of colors. In R. Karlsson, & A. Lingas (Eds. ), Scandinavian Workshop on Algorithm Theory (SWAT96) (pp. 41-52). Berlin, Germany: Springer. [PubMan] : Kelsen, P., Mahajan, S., & Hariharan, R. (1996). Approximate Hypergraph Coloring. In R. Karlsson, & A. Lingas (Eds. ), Algorithm Theory - SWAT '96 (pp. 41-52). Berlin, Germany: Springer. [PubMan] : Breslauer, D., & Hariharan, R. (1996). Optimal Parallel Construction of Minimal Suffix and Factor Automata. Parallel Processing Letters, 6(1), 35-44. [PubMan] : Mahajan, S., & Hariharan, R.(1996). Derandomizing semidefinite programming based approximation algorithms (MPI-I-1996-1-013). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Cole, R., Hariharan, R., Paterson, M., & Zwick, U. (1995). Tighter Lower Bounds on the Exact Complexity of String Matching. SIAM Journal on Computing, 24(1), 30-45. doi:10.1137/S0097539793245829. [PubMan] : Hariharan, R., & Mahajan, S. (1995). Derandomizing Semidefinite Programming Based Approximation Algorithms. In Proceedings of the 36th IEEE Annual Symposium on Foundations of Computer Science (pp. 162-169). Piscataway, NJ: IEEE explore. [PubMan] : Hariharan, R., & Kapoor, S. (1995). Algorithms for Enumerating all Spanning Trees of Undirected and Weighted Graphs. SIAM Journal on Computing, 24(2), 247-265. doi:10.1137/S009753979225030X. [PubMan] : Hariharan, R., & Muthukrishnan, S. (1995). String Matching under a General Matching Relation. Information and Computation, 122(1), 140-148. doi:10.1006/inco.1995.1144. [PubMan]