H. Ramesh

18 papers A* 4B 1Journal 9Unranked 4
YearRankTypeTitle / Venue / Authors
2017 J jnl
A novel mathematical morphology based algorithm for shoreline extraction from satellite images.
Geo spatial Inf. Sci.
C. A. Rishikeshan, H. Ramesh
2017 — conf
Effectiveness of Contrast Limited Adaptive Histogram Equalization Technique on Multispectral Satellite Imagery.
ICVIP
Ganesh R. Vidhya, H. Ramesh
2003 J jnl
Covering Rectilinear Polygons with Axis-Parallel Rectangles.
SIAM J. Comput.
V. S. Anil Kumar, H. Ramesh
2002 — conf
Lower Bounds for Embedding Graphs into Graphs of Smaller Characteristic.
FSTTCS
K. V. M. Naidu, H. Ramesh
2001 J jnl
Coupling vs. conductance for the Jerrum-Sinclair chain.
Random Struct. Algorithms
V. S. Anil Kumar, H. Ramesh
2000 J jnl
An Algorithm for Enumerating All Spanning Trees of a Directed Graph.
Algorithmica
Sanjiv Kapoor, H. Ramesh
2000 A* conf
Hardness of Set Cover with Intersection 1.
ICALP
V. S. Anil Kumar, Sunil Arya, H. Ramesh
1999 A* conf
Covering Rectilinear Polygons with Axis-Parallel Rectangles.
STOC
V. S. Anil Kumar, H. Ramesh
1999 J jnl
Derandomizing Approximation Algorithms Based on Semidefinite Programming.
SIAM J. Comput.
Sanjeev Mahajan, H. Ramesh
1999 A* conf
Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain.
FOCS
V. S. Anil Kumar, H. Ramesh
1998 J jnl
A 2.5-Factor Approximation Algorithm for the
Inf. Process. Lett.
Sunil Arya, H. Ramesh
1997 — conf
Graph Editing to Bipartite Interval Graphs: Exact and Asymtotic Bounds.
FSTTCS
K. Cirino, S. Muthukrishnan, N. S. Narayanaswamy, H. Ramesh
1995 J jnl
Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs.
SIAM J. Comput.
Sanjiv Kapoor, H. Ramesh
1995 J jnl
On Traversing Layered Graphs On-Line.
J. Algorithms
H. Ramesh
1995 J jnl
String Matching Under a General Matching Relation
Inf. Comput.
S. Muthukrishnan, H. Ramesh
1993 A* conf
On Traversing Layered Graphs On-line.
SODA
H. Ramesh
1992 — conf
String Matching Under a General Matching Relation.
FSTTCS
S. Muthukrishnan, H. Ramesh
1991 B conf
Algorithms for Generating All Spanning Trees of Undirected, Directed and Weighted Graphs.
WADS
Sanjiv Kapoor, H. Ramesh