Renu Laskar

1.7k total citations
52 papers, 932 citations indexed

About

Renu Laskar is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Electrical and Electronic Engineering. According to data from OpenAlex, Renu Laskar has authored 52 papers receiving a total of 932 indexed citations (citations by other indexed papers that have themselves been cited), including 44 papers in Computational Theory and Mathematics, 19 papers in Geometry and Topology and 16 papers in Electrical and Electronic Engineering. Recurrent topics in Renu Laskar's work include Advanced Graph Theory Research (35 papers), Graph Labeling and Dimension Problems (23 papers) and Graph theory and applications (17 papers). Renu Laskar is often cited by papers focused on Advanced Graph Theory Research (35 papers), Graph Labeling and Dimension Problems (23 papers) and Graph theory and applications (17 papers). Renu Laskar collaborates with scholars based in United States, Netherlands and South Africa. Renu Laskar's co-authors include Stephen T. Hedetniemi, Martin Charles Golumbic, Gayla S. Domke, Sandra M. Hedetniemi, Johannes H. Hattingh, Douglas R. Shier, R. C. Bose, Jean E. Dunbar, Wayne Goddard and D. G. Hoffman and has published in prestigious journals such as SHILAP Revista de lepidopterología, Annals of the New York Academy of Sciences and American Mathematical Monthly.

In The Last Decade

Renu Laskar

49 papers receiving 808 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Renu Laskar United States	15	773	234	201	191	161	52	932
Martin Farber Canada	15	1.0k 1.3×	239 1.0×	237 1.2×	222 1.2×	180 1.1×	17	1.1k
Bruce A. Reed Canada	15	719 0.9×	199 0.9×	200 1.0×	141 0.7×	202 1.3×	30	854
Stéphan Thomassé France	16	877 1.1×	177 0.8×	341 1.7×	144 0.8×	161 1.0×	94	990
Frédéric Maffray France	16	1.0k 1.3×	162 0.7×	480 2.4×	186 1.0×	148 0.9×	111	1.1k
Bohdan Zelinka Czechia	15	638 0.8×	108 0.5×	146 0.7×	241 1.3×	70 0.4×	199	829
Douglas F. Rall United States	22	1.2k 1.5×	213 0.9×	416 2.1×	312 1.6×	152 0.9×	80	1.3k
Ján Plesnı́k Slovakia	14	452 0.6×	258 1.1×	136 0.7×	268 1.4×	154 1.0×	37	701
Gary MacGillivray Canada	15	566 0.7×	162 0.7×	184 0.9×	102 0.5×	97 0.6×	78	688
Uri N. Peled United States	14	423 0.5×	165 0.7×	130 0.6×	177 0.9×	110 0.7×	47	707
Jenő Lehel Hungary	15	746 1.0×	163 0.7×	361 1.8×	276 1.4×	180 1.1×	83	853

Countries citing papers authored by Renu Laskar

Since Specialization

Citations

This map shows the geographic impact of Renu Laskar'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 Renu Laskar with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Renu Laskar more than expected).

Fields of papers citing papers by Renu Laskar

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Renu Laskar. 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 Renu Laskar. The network helps show where Renu Laskar may publish in the future.

Co-authorship network of co-authors of Renu Laskar

This figure shows the co-authorship network connecting the top 25 collaborators of Renu Laskar. A scholar is included among the top collaborators of Renu Laskar 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 Renu Laskar. Renu Laskar 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:

20 of 20 papers shown

Hedetniemi, Stephen T., et al.. (2020). The 2-dimension of a tree. SHILAP Revista de lepidopterología. 1 indexed citations

Hedetniemi, Stephen T., et al.. (2019). Different-distance sets in a graph. SHILAP Revista de lepidopterología. 1 indexed citations

Hedetniemi, Sandra M., Stephen T. Hedetniemi, Renu Laskar, & Henry Martyn Mulder. (2013). Quorum Colorings of Graphs. AKCE International Journal of Graphs and Combinatorics. 10(1). 97–109. 4 indexed citations

Goddard, Wayne, Sandra M. Hedetniemi, Stephen T. Hedetniemi, & Renu Laskar. (2005). Generalized subgraph-restricted matchings in graphs. Discrete Mathematics. 293(1-3). 129–138. 29 indexed citations

Goddard, Wayne, et al.. (2005). An algorithm for partial Grundy number on trees. Discrete Mathematics. 304(1-3). 108–116. 8 indexed citations

Erdős, Paul, Stephen T. Hedetniemi, Renu Laskar, & Geert Prins. (2003). On the equality of the partial Grundy and upper ochromatic numbers of graphs. Discrete Mathematics. 272(1). 53–64. 21 indexed citations

Dankelmann, Peter & Renu Laskar. (2003). Factor domination and minimum degree. Discrete Mathematics. 262(1-3). 113–119. 5 indexed citations

Dunbar, Jean E., et al.. (2000). α-Domination. Discrete Mathematics. 211(1-3). 11–26. 22 indexed citations

Hattingh, Johannes H. & Renu Laskar. (1998). On weak domination in graphs.. Ars Combinatoria. 49. 9 indexed citations

10.

Labahn, Roger, Stephen T. Hedetniemi, & Renu Laskar. (1994). Periodic gossiping on trees. Discrete Applied Mathematics. 53(1-3). 235–245. 10 indexed citations

11.

Laskar, Renu, et al.. (1993). On the edge-integrity of some graphs and their complements. Discrete Mathematics. 122(1-3). 245–253. 5 indexed citations

12.

Hedetniemi, Stephen T. & Renu Laskar. (1990). Bibliography on domination in graphs and some basic definitions of domination parameters. Discrete Mathematics. 86(1-3). 257–277. 87 indexed citations

13.

Hedetniemi, Stephen T., et al.. (1986). A linear algorithm for finding a minimum dominating set in a cactus. Discrete Applied Mathematics. 13(2-3). 287–292. 26 indexed citations

14.

Laskar, Renu, et al.. (1984). A note on total domination. Discrete Mathematics. 49(1). 7–13. 31 indexed citations

15.

Laskar, Renu, et al.. (1980). Path number of bipartite digraphs. Journal of Combinatorial Theory Series B. 28(2). 243–244. 2 indexed citations

16.

Laskar, Renu, et al.. (1978). On domination and independent domination numbers of a graph. Discrete Mathematics. 23(2). 73–76. 124 indexed citations

17.

Laskar, Renu, et al.. (1976). On decomposition of r-partite graphs into edge-disjoint hamilton circuits. Discrete Mathematics. 14(3). 265–268. 52 indexed citations

18.

Laskar, Renu, et al.. (1976). Some coloring numbers for complete r-partite graphs. Journal of Combinatorial Theory Series B. 21(2). 169–170. 2 indexed citations

19.

Bose, R. C. & Renu Laskar. (1967). A characterization of tetrahedral graphs. Journal of Combinatorial Theory. 3(4). 366–385. 29 indexed citations

20.

Laskar, Renu. (1967). A characterization of cubic lattice graphs. Journal of Combinatorial Theory. 3(4). 386–401. 11 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