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