default search action
H. Ramesh
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. The links to all actual bibliographies of persons of the same or a similar name can be found below. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Other persons with the same name
- Ramesh Hariharasubramanian (aka: H. Ramesh 0001) — Indian Institute of Technology Guwahati, Department of Mathematics, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j9]C. A. Rishikeshan, H. Ramesh:
A novel mathematical morphology based algorithm for shoreline extraction from satellite images. Geo spatial Inf. Sci. 20(4): 345-352 (2017) - [c9]Ganesh R. Vidhya, H. Ramesh:
Effectiveness of Contrast Limited Adaptive Histogram Equalization Technique on Multispectral Satellite Imagery. ICVIP 2017: 234-239
2000 – 2009
- 2003
- [j8]V. S. Anil Kumar, H. Ramesh:
Covering Rectilinear Polygons with Axis-Parallel Rectangles. SIAM J. Comput. 32(6): 1509-1541 (2003) - 2002
- [c8]K. V. M. Naidu, H. Ramesh:
Lower Bounds for Embedding Graphs into Graphs of Smaller Characteristic. FSTTCS 2002: 301-310 - 2001
- [j7]V. S. Anil Kumar, H. Ramesh:
Coupling vs. conductance for the Jerrum-Sinclair chain. Random Struct. Algorithms 18(1): 1-17 (2001) - 2000
- [j6]Sanjiv Kapoor, H. Ramesh:
An Algorithm for Enumerating All Spanning Trees of a Directed Graph. Algorithmica 27(2): 120-130 (2000) - [c7]V. S. Anil Kumar, Sunil Arya, H. Ramesh:
Hardness of Set Cover with Intersection 1. ICALP 2000: 624-635
1990 – 1999
- 1999
- [j5]Sanjeev Mahajan, H. Ramesh:
Derandomizing Approximation Algorithms Based on Semidefinite Programming. SIAM J. Comput. 28(5): 1641-1663 (1999) - [c6]V. S. Anil Kumar, H. Ramesh:
Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain. FOCS 1999: 241-252 - [c5]V. S. Anil Kumar, H. Ramesh:
Covering Rectilinear Polygons with Axis-Parallel Rectangles. STOC 1999: 445-454 - 1998
- [j4]Sunil Arya, H. Ramesh:
A 2.5-Factor Approximation Algorithm for the k-MST Problem. Inf. Process. Lett. 65(3): 117-118 (1998) - 1997
- [c4]K. Cirino, S. Muthukrishnan, N. S. Narayanaswamy, H. Ramesh:
Graph Editing to Bipartite Interval Graphs: Exact and Asymtotic Bounds. FSTTCS 1997: 37-53 - 1995
- [j3]S. Muthukrishnan, H. Ramesh:
String Matching Under a General Matching Relation. Inf. Comput. 122(1): 140-148 (1995) - [j2]H. Ramesh:
On Traversing Layered Graphs On-Line. J. Algorithms 18(3): 480-512 (1995) - [j1]Sanjiv Kapoor, H. Ramesh:
Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs. SIAM J. Comput. 24(2): 247-265 (1995) - 1993
- [c3]H. Ramesh:
On Traversing Layered Graphs On-line. SODA 1993: 412-421 - 1992
- [c2]S. Muthukrishnan, H. Ramesh:
String Matching Under a General Matching Relation. FSTTCS 1992: 356-367 - 1991
- [c1]Sanjiv Kapoor, H. Ramesh:
Algorithms for Generating All Spanning Trees of Undirected, Directed and Weighted Graphs. WADS 1991: 461-472
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint