H. Ramesh

725 total citations
14 papers, 294 citations indexed

About

H. Ramesh is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Graphics and Computer-Aided Design. According to data from OpenAlex, H. Ramesh has authored 14 papers receiving a total of 294 indexed citations (citations by other indexed papers that have themselves been cited), including 8 papers in Computational Theory and Mathematics, 5 papers in Artificial Intelligence and 4 papers in Computer Graphics and Computer-Aided Design. Recurrent topics in H. Ramesh's work include Advanced Graph Theory Research (5 papers), Computational Geometry and Mesh Generation (4 papers) and Complexity and Algorithms in Graphs (4 papers). H. Ramesh is often cited by papers focused on Advanced Graph Theory Research (5 papers), Computational Geometry and Mesh Generation (4 papers) and Complexity and Algorithms in Graphs (4 papers). H. Ramesh collaborates with scholars based in India, United States and Germany. H. Ramesh's co-authors include Sanjiv Kapoor, Vishwa Vinay, Sunil Arya, Vijay Kumar, S. Muthukrishnan and Gopal Pandurangan and has published in prestigious journals such as SIAM Journal on Computing, Journal of Computer and System Sciences and Algorithmica.

In The Last Decade

H. Ramesh

14 papers receiving 265 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
H. Ramesh India	9	137	122	61	45	37	14	294
Glenn K. Manacher United States	9	165 1.2×	122 1.0×	83 1.4×	37 0.8×	57 1.5×	22	324
Yuichi Asahiro Japan	8	137 1.0×	82 0.7×	97 1.6×	27 0.6×	25 0.7×	34	316
Patrick Dymond Canada	11	233 1.7×	155 1.3×	118 1.9×	25 0.6×	39 1.1×	41	396
Cláudio N. Meneses Brazil	9	90 0.7×	131 1.1×	41 0.7×	56 1.2×	13 0.4×	21	271
Peter Emde Boas Netherlands	2	117 0.9×	179 1.5×	125 2.0×	31 0.7×	51 1.4×	2	325
John W. Williams United States	2	89 0.6×	152 1.2×	78 1.3×	24 0.5×	22 0.6×	3	269
Arun Jagota United States	9	89 0.6×	156 1.3×	74 1.2×	16 0.4×	6 0.2×	35	276
Jean‐Luc Lutton France	6	50 0.4×	109 0.9×	66 1.1×	15 0.3×	11 0.3×	9	268
Deepak Ajwani Ireland	9	47 0.3×	101 0.8×	95 1.6×	31 0.7×	20 0.5×	31	244
P. M. Camerini Italy	11	190 1.4×	70 0.6×	114 1.9×	10 0.2×	39 1.1×	19	389

Countries citing papers authored by H. Ramesh

Since Specialization

Citations

This map shows the geographic impact of H. Ramesh's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by H. Ramesh with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites H. Ramesh more than expected).

Fields of papers citing papers by H. Ramesh

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by H. Ramesh. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by H. Ramesh. The network helps show where H. Ramesh may publish in the future.

Co-authorship network of co-authors of H. Ramesh

This figure shows the co-authorship network connecting the top 25 collaborators of H. Ramesh. A scholar is included among the top collaborators of H. Ramesh based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with H. Ramesh. H. Ramesh is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

14 of 14 papers shown

1.

Ramesh, H., et al.. (2024). Efficient Designs for the 8-Bit Approximate Fixed Point Multiplication. 336–344. 1 indexed citations

2.

Kumar, Vijay & H. Ramesh. (2003). Covering Rectilinear Polygons with Axis-Parallel Rectangles. NOT FOUND REPOSITORY (Indian Institute of Science Bangalore). 20 indexed citations

3.

Ramesh, H. & Vishwa Vinay. (2003). String matching in O(n+m) quantum time. Journal of Discrete Algorithms. 1(1). 103–110. 45 indexed citations

4.

Pandurangan, Gopal & H. Ramesh. (2002). The restriction mapping problem revisited. Journal of Computer and System Sciences. 65(3). 526–544. 12 indexed citations

5.

Ramesh, H., et al.. (2002). Derandomizing semidefinite programming based approximation algorithms. 162–169. 24 indexed citations

6.

Kapoor, Sanjiv & H. Ramesh. (2000). An Algorithm for Enumerating All Spanning Trees of a Directed Graph. Algorithmica. 27(2). 120–130. 20 indexed citations

7.

Kumar, Vijay & H. Ramesh. (2000). Coupling vs. conductance for the Jerrum-Sinclair chain. Random Structures and Algorithms. 18(1). 1–17. 5 indexed citations

8.

Kumar, Vijay & H. Ramesh. (1999). Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain. NOT FOUND REPOSITORY (Indian Institute of Science Bangalore). 2 indexed citations

9.

Ramesh, H., et al.. (1999). Derandomizing Approximation Algorithms Based on Semidefinite Programming. SIAM Journal on Computing. 28(5). 1641–1663. 51 indexed citations

10.

Ramesh, H. & Vishwa Vinay. (1998). Who will win the toss?. Resonance. 3(4). 72–87. 2 indexed citations

11.

Arya, Sunil & H. Ramesh. (1998). A 2.5-factor approximation algorithm for the k-MST problem. Information Processing Letters. 65(3). 117–118. 27 indexed citations

12.

Muthukrishnan, S. & H. Ramesh. (1995). String Matching under a General Matching Relation. Information and Computation. 122(1). 140–148. 15 indexed citations

13.

Kapoor, Sanjiv & H. Ramesh. (1995). Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs. SIAM Journal on Computing. 24(2). 247–265. 62 indexed citations

14.

Ramesh, H.. (1993). On traversing layered graphs on-line. Symposium on Discrete Algorithms. 18(3). 412–421. 8 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact