H. Ramesh

Publication Activity (10 Years)

Years Active: 1991-2020
Publications (10 Years): 10

Top Topics

Adaptive Histogram Equalization

Satellite Imagery

Top Venues

Publications

Debasish Pattanayak, H. Ramesh, Partha Sarathi Mandal
Collaborative Evacuation of Mobile Robots. ICDCN (2020)
Debasish Pattanayak, H. Ramesh, Partha Sarathi Mandal
Chauffeuring a Crashed Robot from a Disk. ALGOSENSORS (2019)
Debasish Pattanayak, H. Ramesh, Partha Sarathi Mandal
Chauffeuring a Crashed Robot from a Disk. CoRR (2019)
Debasish Pattanayak, Kaushik Mondal, H. Ramesh, Partha Sarathi Mandal
Gathering of mobile robots with weak multiplicity detection in presence of crash-faults. J. Parallel Distributed Comput. 123 (2019)
Debasish Pattanayak, H. Ramesh, Partha Sarathi Mandal, Stefan Schmid
Evacuating Two Robots from Two Unknown Exits on the Perimeter of a Disk with Wireless Communication. ICDCN (2018)
Ganesh R. Vidhya, H. Ramesh
Effectiveness of Contrast Limited Adaptive Histogram Equalization Technique on Multispectral Satellite Imagery. ICVIP (2017)
Debasish Pattanayak, Kaushik Mondal, H. Ramesh, Partha Sarathi Mandal
Fault-Tolerant Gathering of Mobile Robots with Weak Multiplicity Detection. ICDCN (2017)
Debasish Pattanayak, H. Ramesh, Partha Sarathi Mandal, Stefan Schmid
Evacuating Two Robots from Two Unknown Exits on the Perimeter of a Disk. CoRR (2017)
C. A. Rishikeshan, H. Ramesh
A novel mathematical morphology based algorithm for shoreline extraction from satellite images. Geo spatial Inf. Sci. 20 (4) (2017)
Debasish Pattanayak, Kaushik Mondal, H. Ramesh, Partha Sarathi Mandal
Fault-Tolerant Gathering of Mobile Robots with Weak Multiplicity Detection. CoRR (2016)
Rama Raghavan, H. Ramesh, Marian Gheorghe, Shankara Narayanan Krishna
On Restricted Bio-Turing Machines. Fundam. Informaticae 110 (1-4) (2011)
Raghavan Rama, H. Ramesh, Marian Gheorghe, Shankara Narayanan Krishna
Further Results on Languages of Membrane Structures CoRR (2011)
H. Ramesh, Raghavan Rama
Rewriting P Systems with Conditional Communication: Improved Hierarchies. Comput. Informatics 27 (3+) (2008)
H. Ramesh, Shankara Narayanan Krishna, Raghavan Rama
On the Power of Bio-Turing Machines. UC (2006)
Shankara Narayanan Krishna, Raghavan Rama, H. Ramesh
Further Results on Contextual and Rewriting P Systems. Fundam. Informaticae 64 (1-4) (2005)
Raghavan Rama, H. Ramesh
On Generating Trees by P Systems with Active Membranes. SYNASC (2005)
V. S. Anil Kumar, H. Ramesh
Covering Rectilinear Polygons with Axis-Parallel Rectangles. SIAM J. Comput. 32 (6) (2003)
K. V. M. Naidu, H. Ramesh
Lower Bounds for Embedding Graphs into Graphs of Smaller Characteristic. FSTTCS (2002)
V. S. Anil Kumar, H. Ramesh
Coupling vs. conductance for the Jerrum-Sinclair chain. Random Struct. Algorithms 18 (1) (2001)
Sanjiv Kapoor, H. Ramesh
An Algorithm for Enumerating All Spanning Trees of a Directed Graph. Algorithmica 27 (2) (2000)
V. S. Anil Kumar, Sunil Arya, H. Ramesh
Hardness of Set Cover with Intersection 1. ICALP (2000)
V. S. Anil Kumar, H. Ramesh
Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain. FOCS (1999)
V. S. Anil Kumar, H. Ramesh
Covering Rectilinear Polygons with Axis-Parallel Rectangles. STOC (1999)
Sanjeev Mahajan, H. Ramesh
Derandomizing Approximation Algorithms Based on Semidefinite Programming. SIAM J. Comput. 28 (5) (1999)
Sunil Arya, H. Ramesh
-MST Problem. Inf. Process. Lett. 65 (3) (1998)
K. Cirino, S. Muthukrishnan, N. S. Narayanaswamy, H. Ramesh
Graph Editing to Bipartite Interval Graphs: Exact and Asymtotic Bounds. FSTTCS (1997)
H. Ramesh
On Traversing Layered Graphs On-Line. J. Algorithms 18 (3) (1995)
S. Muthukrishnan, H. Ramesh
String Matching Under a General Matching Relation Inf. Comput. 122 (1) (1995)
Sanjiv Kapoor, H. Ramesh
Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs. SIAM J. Comput. 24 (2) (1995)
H. Ramesh
On Traversing Layered Graphs On-line. SODA (1993)
S. Muthukrishnan, H. Ramesh
String Matching Under a General Matching Relation. FSTTCS (1992)
Sanjiv Kapoor, H. Ramesh
Algorithms for Generating All Spanning Trees of Undirected, Directed and Weighted Graphs. WADS (1991)