The SCEAS System
| |||||||

## Search the dblp DataBase
H. Ramesh:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- V. S. Anil Kumar, H. Ramesh
**Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain.**[Citation Graph (0, 0)][DBLP] FOCS, 1999, pp:241-252 [Conf] - K. Cirino, S. Muthukrishnan, N. S. Narayanaswamy, H. Ramesh
**Graph Editing to Bipartite Interval Graphs: Exact and Asymtotic Bounds.**[Citation Graph (0, 0)][DBLP] FSTTCS, 1997, pp:37-53 [Conf] - K. V. M. Naidu, H. Ramesh
**Lower Bounds for Embedding Graphs into Graphs of Smaller Characteristic.**[Citation Graph (0, 0)][DBLP] FSTTCS, 2002, pp:301-310 [Conf] - S. Muthukrishnan, H. Ramesh
**String Matching Under a General Matching Relation.**[Citation Graph (0, 0)][DBLP] FSTTCS, 1992, pp:356-367 [Conf] - V. S. Anil Kumar, Sunil Arya, H. Ramesh
**Hardness of Set Cover with Intersection 1.**[Citation Graph (0, 0)][DBLP] ICALP, 2000, pp:624-635 [Conf] - H. Ramesh
**On Traversing Layered Graphs On-line.**[Citation Graph (0, 0)][DBLP] SODA, 1993, pp:412-421 [Conf] - V. S. Anil Kumar, H. Ramesh
**Covering Rectilinear Polygons with Axis-Parallel Rectangles.**[Citation Graph (0, 0)][DBLP] STOC, 1999, pp:445-454 [Conf] - H. Ramesh, Shankara Narayanan Krishna, Raghavan Rama
**On the Power of Bio-Turing Machines.**[Citation Graph (0, 0)][DBLP] UC, 2006, pp:243-253 [Conf] - Sanjiv Kapoor, H. Ramesh
**Algorithms for Generating All Spanning Trees of Undirected, Directed and Weighted Graphs.**[Citation Graph (0, 0)][DBLP] WADS, 1991, pp:461-472 [Conf] - Raghavan Rama, H. Ramesh
**On Generating Trees by P Systems with Active Membranes.**[Citation Graph (0, 0)][DBLP] SYNASC, 2005, pp:462-466 [Conf] - Sanjiv Kapoor, H. Ramesh
**An Algorithm for Enumerating All Spanning Trees of a Directed Graph.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2000, v:27, n:2, pp:120-130 [Journal] - Shankara Narayanan Krishna, Raghavan Rama, H. Ramesh
**Further Results on Contextual and Rewriting P Systems.**[Citation Graph (0, 0)][DBLP] Fundam. Inform., 2005, v:64, n:1-4, pp:241-253 [Journal] - S. Muthukrishnan, H. Ramesh
**String Matching Under a General Matching Relation**[Citation Graph (0, 0)][DBLP] Inf. Comput., 1995, v:122, n:1, pp:140-148 [Journal] - Sunil Arya, H. Ramesh
**A 2.5-Factor Approximation Algorithm for the**[Citation Graph (0, 0)][DBLP]*k*-MST Problem. Inf. Process. Lett., 1998, v:65, n:3, pp:117-118 [Journal] - H. Ramesh
**On Traversing Layered Graphs On-Line.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1995, v:18, n:3, pp:480-512 [Journal] - V. S. Anil Kumar, H. Ramesh
**Coupling vs. conductance for the Jerrum-Sinclair chain.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2001, v:18, n:1, pp:1-17 [Journal] - Sanjiv Kapoor, H. Ramesh
**Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1995, v:24, n:2, pp:247-265 [Journal] - V. S. Anil Kumar, H. Ramesh
**Covering Rectilinear Polygons with Axis-Parallel Rectangles.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2003, v:32, n:6, pp:1509-1541 [Journal] - Sanjeev Mahajan, H. Ramesh
**Derandomizing Approximation Algorithms Based on Semidefinite Programming.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1999, v:28, n:5, pp:1641-1663 [Journal]
Search in 0.006secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |