R. Sritharan

648 total citations
33 papers, 307 citations indexed

About

R. Sritharan is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Discrete Mathematics and Combinatorics. According to data from OpenAlex, R. Sritharan has authored 33 papers receiving a total of 307 indexed citations (citations by other indexed papers that have themselves been cited), including 32 papers in Computational Theory and Mathematics, 11 papers in Computer Networks and Communications and 9 papers in Discrete Mathematics and Combinatorics. Recurrent topics in R. Sritharan's work include Advanced Graph Theory Research (31 papers), Complexity and Algorithms in Graphs (15 papers) and Graph Labeling and Dimension Problems (14 papers). R. Sritharan is often cited by papers focused on Advanced Graph Theory Research (31 papers), Complexity and Algorithms in Graphs (15 papers) and Graph Labeling and Dimension Problems (14 papers). R. Sritharan collaborates with scholars based in United States, Canada and Germany. R. Sritharan's co-authors include Jeremy Spinrad, Kathie Cameron, Chı́nh T. Hoàng, Ryan Hayward, Andreas Brandstädt, Van Bang Lê, Celina M.H. de Figueiredo, Luérbio Faria, Sulamita Klein and Irena Rusu and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Networks.

In The Last Decade

R. Sritharan

29 papers receiving 288 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
R. Sritharan United States	11	287	123	67	51	29	33	307
Vassilis Giakoumakis France	11	284 1.0×	58 0.5×	119 1.8×	42 0.8×	55 1.9×	21	294
Sulamita Klein Brazil	9	424 1.5×	114 0.9×	153 2.3×	122 2.4×	57 2.0×	51	451
Reza Naserasr France	10	224 0.8×	29 0.2×	98 1.5×	57 1.1×	59 2.0×	45	260
Florent Foucaud France	9	181 0.6×	51 0.4×	48 0.7×	51 1.0×	27 0.9×	38	215
Bert Gerards Netherlands	11	229 0.8×	60 0.5×	80 1.2×	65 1.3×	37 1.3×	19	248
Nguyen Huy Xuong France	7	232 0.8×	71 0.6×	63 0.9×	64 1.3×	77 2.7×	9	278
Zhengke Miao China	8	224 0.8×	44 0.4×	61 0.9×	63 1.2×	49 1.7×	61	253
B. Jamison United States	9	341 1.2×	90 0.7×	87 1.3×	52 1.0×	69 2.4×	11	350
Luérbio Faria Brazil	8	175 0.6×	61 0.5×	49 0.7×	37 0.7×	36 1.2×	56	212
Bert L. Hartnell Canada	12	491 1.7×	137 1.1×	141 2.1×	74 1.5×	147 5.1×	52	538

Countries citing papers authored by R. Sritharan

Since Specialization

Citations

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

Fields of papers citing papers by R. Sritharan

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of R. Sritharan

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

Sritharan, R., et al.. (2019). Some completion problems for graphs without chordless cycles of prescribed lengths. Discrete Applied Mathematics. 268. 21–34. 1 indexed citations

Sritharan, R., et al.. (2017). Completing colored graphs to meet a target property. Discrete Applied Mathematics. 223. 39–51. 2 indexed citations

Sritharan, R.. (2016). Graph modification problem for some classes of graphs. Journal of Discrete Algorithms. 38-41. 32–37.

Hoàng, Chı́nh T., Marcin Kamiński, Joe Sawada, & R. Sritharan. (2012). Finding and listing induced paths and cycles. Discrete Applied Mathematics. 161(4-5). 633–641. 6 indexed citations

Sritharan, R., et al.. (2011). Maximum induced matching problem on hhd-free graphs. Discrete Applied Mathematics. 160(3). 224–230. 5 indexed citations

Hoàng, Chı́nh T., et al.. (2010). On graphs without a C4 or a diamond. Discrete Applied Mathematics. 159(7). 581–587. 10 indexed citations

Kratsch, Dieter, Jeremy Spinrad, & R. Sritharan. (2007). A new characterization of HH-free graphs. Discrete Mathematics. 308(20). 4833–4835. 1 indexed citations

Figueiredo, Celina M.H. de, Luérbio Faria, Sulamita Klein, & R. Sritharan. (2007). On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs. Theoretical Computer Science. 381(1-3). 57–67. 17 indexed citations

Sritharan, R.. (2007). Chordal bipartite completion of colored graphs. Discrete Mathematics. 308(12). 2581–2588. 12 indexed citations

10.

Brandstädt, Andreas, et al.. (2007). The induced matching and chain subgraph cover problems for convex bipartite graphs. Theoretical Computer Science. 381(1-3). 260–265. 11 indexed citations

11.

Sritharan, R., et al.. (2006). A note on the recognition of bisplit graphs. Discrete Mathematics. 306(17). 2108–2110. 1 indexed citations

12.

Hoàng, Chı́nh T., et al.. (2005). Disjoint clique cutsets in graphs without long holes. Journal of Graph Theory. 48(4). 277–298. 1 indexed citations

13.

Cameron, Kathie, et al.. (2004). The list partition problem for graphs. Symposium on Discrete Algorithms. 391–399. 20 indexed citations

14.

Spinrad, Jeremy, et al.. (2003). Recognition of some perfectly orderable graph classes. Discrete Applied Mathematics. 128(2-3). 355–373. 3 indexed citations

15.

Cameron, Kathie, et al.. (2003). Finding a maximum induced matching in weakly chordal graphs. Discrete Mathematics. 266(1-3). 133–142. 49 indexed citations

16.

Chvátal, Vašek, Irena Rusu, & R. Sritharan. (2002). Dirac-type characterizations of graphs without long chordless cycles. Discrete Mathematics. 256(1-2). 445–448. 8 indexed citations

17.

Hoàng, Chı́nh T. & R. Sritharan. (2001). Finding houses and holes in graphs. Theoretical Computer Science. 259(1-2). 233–244. 5 indexed citations

18.

Hayward, Ryan, Jeremy Spinrad, & R. Sritharan. (2000). Weakly chordal graph algorithms via handles. Symposium on Discrete Algorithms. 42–49. 24 indexed citations

19.

Spinrad, Jeremy & R. Sritharan. (1995). Algorithms for weakly triangulated graphs. Discrete Applied Mathematics. 59(2). 181–191. 33 indexed citations

20.

Sritharan, R., et al.. (1995). A Characterization of Some Graph Classes with No Long Holes. Journal of Combinatorial Theory Series B. 65(1). 156–162. 6 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