H. Ramesh - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 28 from 28

2020

Collaborative Evacuation of Mobile RobotsDebasish Pattanayak, H. Ramesh, Partha Sarathi Mandal 0001. icdcn 2020: [doi]

2019

Chauffeuring a Crashed Robot from a DiskDebasish Pattanayak, H. Ramesh, Partha Sarathi Mandal 0001. algosensors 2019: 177-191 [doi]

Gathering of mobile robots with weak multiplicity detection in presence of crash-faultsDebasish Pattanayak, Kaushik Mondal 0001, H. Ramesh, Partha Sarathi Mandal 0001. jpdc, 123:145-155, 2019. [doi]

2018

Evacuating Two Robots from Two Unknown Exits on the Perimeter of a Disk with Wireless CommunicationDebasish Pattanayak, H. Ramesh, Partha Sarathi Mandal 0001, Stefan Schmid. icdcn 2018: [doi]

2017

Fault-Tolerant Gathering of Mobile Robots with Weak Multiplicity DetectionDebasish Pattanayak, Kaushik Mondal, H. Ramesh, Partha Sarathi Mandal 0001. icdcn 2017: 7 [doi]

A novel mathematical morphology based algorithm for shoreline extraction from satellite imagesC. A. Rishikeshan, H. Ramesh. gsis, 20(4):345-352, 2017. [doi]

Effectiveness of Contrast Limited Adaptive Histogram Equalization Technique on Multispectral Satellite ImageryGanesh R. Vidhya, H. Ramesh. icvip 2017: 234-239 [doi]

2011

On Restricted Bio-Turing MachinesRaghavan Rama, H. Ramesh, Marian Gheorghe, Shankara Narayanan Krishna. FUIN, 110(1-4):309-320, 2011. [doi]

2008

Rewriting P Systems with Conditional Communication: Improved HierarchiesH. Ramesh, Raghavan Rama. cai, 27(3+):453-465, 2008. [doi]

2006

On the Power of Bio-Turing MachinesH. Ramesh, Shankara Narayanan Krishna, Raghavan Rama. uc 2006: 243-253 [doi]

2005

Further Results on Contextual and Rewriting P SystemsShankara Narayanan Krishna, Raghavan Rama, H. Ramesh. FUIN, 64(1-4):241-253, 2005. [doi]

On Generating Trees by P Systems with Active MembranesRaghavan Rama, H. Ramesh. synasc 2005: 462-466 [doi]

2003

Covering Rectilinear Polygons with Axis-Parallel RectanglesV. S. Anil Kumar, H. Ramesh. SICOMP, 32(6):1509-1541, 2003. [doi]

2002

Lower Bounds for Embedding Graphs into Graphs of Smaller CharacteristicK. V. M. Naidu, H. Ramesh. fsttcs 2002: 301-310 [doi]

2001

Coupling vs. conductance for the Jerrum-Sinclair chainV. S. Anil Kumar, H. Ramesh. rsa, 18(1):1-17, 2001.

2000

An Algorithm for Enumerating All Spanning Trees of a Directed GraphSanjiv Kapoor, H. Ramesh. algorithmica, 27(2):120-130, 2000. [doi]

Hardness of Set Cover with Intersection 1V. S. Anil Kumar, Sunil Arya, H. Ramesh. icalp 2000: 624-635 [doi]

1999

Covering Rectilinear Polygons with Axis-Parallel RectanglesV. S. Anil Kumar, H. Ramesh. stoc 1999: 445-454 [doi]

Markovian Coupling vs. Conductance for the Jerrum-Sinclair ChainV. S. Anil Kumar, H. Ramesh. focs 1999: 241-252 [doi]

Derandomizing Approximation Algorithms Based on Semidefinite ProgrammingSanjeev Mahajan, H. Ramesh. SICOMP, 28(5):1641-1663, 1999.

1998

A 2.5-Factor Approximation Algorithm for the ::::k::::-MST ProblemSunil Arya, H. Ramesh. ipl, 65(3):117-118, 1998. [doi]

1997

Graph Editing to Bipartite Interval Graphs: Exact and Asymtotic BoundsK. Cirino, S. Muthukrishnan, N. S. Narayanaswamy, H. Ramesh. fsttcs 1997: 37-53 [doi]

1995

Algorithms for Enumerating All Spanning Trees of Undirected and Weighted GraphsSanjiv Kapoor, H. Ramesh. SICOMP, 24(2):247-265, 1995.

String Matching Under a General Matching RelationS. Muthukrishnan, H. Ramesh. iandc, 122(1):140-148, October 1995.

On Traversing Layered Graphs On-LineH. Ramesh. jal, 18(3):480-512, 1995.

1993

On Traversing Layered Graphs On-lineH. Ramesh. soda 1993: 412-421

1992

String Matching Under a General Matching RelationS. Muthukrishnan, H. Ramesh. fsttcs 1992: 356-367

1991

Algorithms for Generating All Spanning Trees of Undirected, Directed and Weighted GraphsSanjiv Kapoor, H. Ramesh. wads 1991: 461-472

Sign in or sign up to see more results.

runs on WebDSL