S.A. Choudum

610 total citations
37 papers, 392 citations indexed

About

S.A. Choudum is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Computer Networks and Communications. According to data from OpenAlex, S.A. Choudum has authored 37 papers receiving a total of 392 indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Computational Theory and Mathematics, 17 papers in Discrete Mathematics and Combinatorics and 14 papers in Computer Networks and Communications. Recurrent topics in S.A. Choudum's work include Advanced Graph Theory Research (25 papers), Limits and Structures in Graph Theory (16 papers) and Interconnection Networks and Systems (14 papers). S.A. Choudum is often cited by papers focused on Advanced Graph Theory Research (25 papers), Limits and Structures in Graph Theory (16 papers) and Interconnection Networks and Systems (14 papers). S.A. Choudum collaborates with scholars based in India and Germany. S.A. Choudum's co-authors include T. Karthick, Gunnar Brinkmann, Stefan Grünewald, Eckhard Steffen, S Kishore, K. R. Parthasarathy, E. Sampathkumar, B. D. Acharya and S. B. Rao and has published in prestigious journals such as Information Sciences, Bulletin of the London Mathematical Society and Networks.

In The Last Decade

S.A. Choudum

36 papers receiving 378 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
S.A. Choudum India 10 235 208 145 101 81 37 392
Marie-Claude Heydemann France 9 181 0.8× 213 1.0× 132 0.9× 44 0.4× 94 1.2× 28 316
Dominique Sotteau France 13 344 1.5× 280 1.3× 363 2.5× 177 1.8× 116 1.4× 34 611
Jean‐Claude Bermond France 16 226 1.0× 396 1.9× 282 1.9× 78 0.8× 73 0.9× 64 608
Xie-Bin Chen China 11 198 0.8× 283 1.4× 176 1.2× 33 0.3× 56 0.7× 29 339
Jaeun Lee South Korea 12 235 1.0× 108 0.5× 96 0.7× 189 1.9× 219 2.7× 70 527
J.-C. Bermond France 8 264 1.1× 171 0.8× 246 1.7× 176 1.7× 93 1.1× 13 430
Hengzhe Li China 10 240 1.0× 279 1.3× 89 0.6× 25 0.2× 87 1.1× 29 347
Claudine Peyrat France 9 154 0.7× 227 1.1× 102 0.7× 54 0.5× 96 1.2× 15 317
Michel Mollard France 12 214 0.9× 136 0.7× 82 0.6× 63 0.6× 138 1.7× 30 318
Petr Gregor Czechia 8 194 0.8× 200 1.0× 138 1.0× 28 0.3× 20 0.2× 34 276

Countries citing papers authored by S.A. Choudum

Since Specialization
Citations

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

Fields of papers citing papers by S.A. Choudum

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of S.A. Choudum

This figure shows the co-authorship network connecting the top 25 collaborators of S.A. Choudum. A scholar is included among the top collaborators of S.A. Choudum 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 S.A. Choudum. S.A. Choudum is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Choudum, S.A., et al.. (2013). Embedding certain height-balanced trees and completepm-ary trees into hypercubes. Journal of Discrete Algorithms. 22. 53–65. 4 indexed citations
2.
Choudum, S.A., et al.. (2011). Embedding a subclass of trees into hypercubes. Discrete Mathematics. 311(10-11). 866–871. 1 indexed citations
3.
Choudum, S.A. & T. Karthick. (2010). First-Fit coloring of {P5,K4−e}-free graphs. Discrete Applied Mathematics. 158(6). 620–626. 6 indexed citations
4.
Choudum, S.A., et al.. (2009). Disjoint paths in hypercubes with prescribed origins and lengths. International Journal of Computer Mathematics. 87(8). 1692–1708. 7 indexed citations
5.
Choudum, S.A., et al.. (2008). Automorphisms of augmented cubes. International Journal of Computer Mathematics. 85(11). 1621–1627. 8 indexed citations
6.
Choudum, S.A., et al.. (2008). Embedding complete ternary trees into hypercubes. Discussiones Mathematicae Graph Theory. 28(3). 463–463.
7.
Choudum, S.A., et al.. (2005). The class of {3K 1 , C 4 }-free graphs.. Australas. J Comb.. 32. 111–116. 3 indexed citations
8.
Sampathkumar, E., B. D. Acharya, S. B. Rao, & S.A. Choudum. (2003). Studying Properties of Graphs through their k-vertex Subsets: I IIκ-complete Graphs and IIκ-completion numbers. Electronic Notes in Discrete Mathematics. 15. 164–167. 1 indexed citations
9.
Choudum, S.A., et al.. (2002). Augmented cubes. Networks. 40(2). 71–84. 120 indexed citations
10.
Choudum, S.A., et al.. (2000). Optimal fault-tolerant networks with a server. Networks. 35(2). 157–157. 1 indexed citations
11.
Choudum, S.A., et al.. (2000). Optimal fault-tolerant networks with a server. Networks. 35(2). 157–160. 2 indexed citations
12.
Choudum, S.A., et al.. (1999). An extension of Vizing's adjacency lemma on edge chromatic critical graphs. Discrete Mathematics. 206(1-3). 97–103. 7 indexed citations
13.
Choudum, S.A. & S Kishore. (1999). Graceful labelling of the union of paths and cycles. Discrete Mathematics. 206(1-3). 105–117. 3 indexed citations
14.
Choudum, S.A., et al.. (1999). Tenacity of complete graph products and grids. Networks. 34(3). 192–196. 17 indexed citations
15.
Choudum, S.A.. (1993). Edge‐chromatic critical graphs and the existence of 1‐factors. Journal of Graph Theory. 17(1). 23–29. 2 indexed citations
16.
Choudum, S.A.. (1991). On forcibly connected graphic sequences. Discrete Mathematics. 96(3). 175–181. 8 indexed citations
17.
Choudum, S.A.. (1991). On graphic and 3-hypergraphic sequences. Discrete Mathematics. 87(1). 91–95. 3 indexed citations
18.
Choudum, S.A.. (1986). A simple proof of the Erdos-Gallai theorem on graph sequences. Bulletin of the Australian Mathematical Society. 33(1). 67–70. 22 indexed citations
19.
Choudum, S.A.. (1977). Some 4-valent, 3-connected, planar, almost pancyclic graphs. Discrete Mathematics. 18(2). 125–129. 5 indexed citations
20.
Choudum, S.A. & K. R. Parthasarathy. (1972). Semi-regular relations and digraphs. Indagationes Mathematicae (Proceedings). 75(4). 326–334. 1 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

Breakdown of academic impact, for papers by Marie-Claude Heydemann Breakdown of academic impact, for papers by Dominique Sotteau Breakdown of academic impact, for papers by Jean‐Claude Bermond Breakdown of academic impact, for papers by Xie-Bin Chen Breakdown of academic impact, for papers by Jaeun Lee Breakdown of academic impact, for papers by J.-C. Bermond Breakdown of academic impact, for papers by Hengzhe Li Breakdown of academic impact, for papers by Claudine Peyrat Breakdown of academic impact, for papers by Michel Mollard Breakdown of academic impact, for papers by Petr Gregor
Rankless by CCL
2026