|
 | Up a level |
Naidu, KVM and Ramesh, H (2002) Lower bounds for embedding graphs into graphs of smaller characteristic. In: FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science. 22nd Conference. Proceedings, 12-14 Dec. 2002, Kanpur, India, pp. 301-310.
Arya, Sunil and Cheng, Siu-Wing and Mount, David M and Ramesh, H (2000) Efficient Expected-Case Algorithms for Planar Point Location. In: 7th Scandinavian Workshop on Algorithm Theory- SWAT 2000, July 2000, Bergen, Norway, pp. 353-366.
Kumar, Anil VS and Ramesh, H (1999) Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain. In: 40th Annual Symposium on Foundations of Computer Science,1999, 17-19 October, New York, 241 -251.
Kumar, Anil VS and Ramesh, H (2003) Covering Rectilinear Polygons with Axis-Parallel Rectangles. In: SIAM Journal on Computing, 32 (6). pp. 1509-1541.
Pandurangan, Gopal and Ramesh, H (2002) The restriction mapping problem revisited. In: Journal of Computer and System Sciences, 65 (3). 526-544 .
Kumar, Anil VS and Ramesh, H (2001) Coupling vs. conductance for the Jerrum-Sinclair chain. In: Random Structures and Algorithms, 18 (1). pp. 1-17.
Kapoor, S and Ramesh, H (2000) An Algorithm for enumerating All Spanning Trees of a Directed Graph. In: Algorithmica, 27 (2). pp. 120-130.
Kumar, Anil VS and Arya, Sunil and Ramesh, H (2000) Hardness of set cover with intersection 1. In: Automata Languages and Programming, 1853 . pp. 624-635.
Arya, Sunil and Ramesh, H (1998) A 2.5-factor approximation algorithm for the k-MST problem. In: Information Processing Letters, 65 (3). pp. 117-118.
Mahajan, Sanjeev and Ramesh, H (1996) Derandomizing approximation algorithms based on semidefinite programming. In: SIAM Journal on Computing, 28 (5). pp. 1641-1663.
