Tapan Kumar Pal

1.1k total citations
18 papers, 795 citations indexed

About

Tapan Kumar Pal is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Management Science and Operations Research. According to data from OpenAlex, Tapan Kumar Pal has authored 18 papers receiving a total of 795 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Computational Theory and Mathematics, 5 papers in Computer Networks and Communications and 5 papers in Management Science and Operations Research. Recurrent topics in Tapan Kumar Pal's work include Advanced Graph Theory Research (12 papers), Complexity and Algorithms in Graphs (9 papers) and Multi-Criteria Decision Making (4 papers). Tapan Kumar Pal is often cited by papers focused on Advanced Graph Theory Research (12 papers), Complexity and Algorithms in Graphs (9 papers) and Multi-Criteria Decision Making (4 papers). Tapan Kumar Pal collaborates with scholars based in India. Tapan Kumar Pal's co-authors include Atanu Sengupta, Debjani Chakraborty, Madhumangal Pal and Anjali Singh and has published in prestigious journals such as SHILAP Revista de lepidopterología, European Journal of Operational Research and Information Sciences.

In The Last Decade

Tapan Kumar Pal

17 papers receiving 728 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Tapan Kumar Pal India	8	402	293	288	226	96	18	795
V. I. Norkin Ukraine	13	410 1.0×	184 0.6×	168 0.6×	85 0.4×	54 0.6×	61	836
Cécile Murat France	12	421 1.0×	310 1.1×	163 0.6×	85 0.4×	83 0.9×	30	1.1k
Paweł Zieliński Poland	17	707 1.8×	313 1.1×	116 0.4×	116 0.5×	83 0.9×	56	1.0k
Μ. Sakawa Japan	13	291 0.7×	388 1.3×	216 0.8×	180 0.8×	48 0.5×	68	612
Abdel Lisser France	16	321 0.8×	189 0.6×	138 0.5×	76 0.3×	39 0.4×	85	742
Pavel Sevastjanov Poland	18	772 1.9×	259 0.9×	177 0.6×	288 1.3×	48 0.5×	37	1.0k
Ludmila Dymova Poland	18	817 2.0×	255 0.9×	173 0.6×	282 1.2×	46 0.5×	39	1.1k
I‎. ‎M‎. Stancu-Minasian Romania	17	346 0.9×	714 2.4×	547 1.9×	206 0.9×	112 1.2×	43	1.0k
Kiyoji Asai Japan	9	539 1.3×	535 1.8×	161 0.6×	376 1.7×	43 0.4×	28	884
Hamid Reza Maleki Iran	16	533 1.3×	539 1.8×	96 0.3×	394 1.7×	46 0.5×	48	918

Countries citing papers authored by Tapan Kumar Pal

Since Specialization

Citations

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

Fields of papers citing papers by Tapan Kumar Pal

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Tapan Kumar Pal

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

18 of 18 papers shown

Singh, Anjali & Tapan Kumar Pal. (2014). In silico Sequence Analysis, Structure Prediction and Function Annotation of Human Bcl-X Beta Protein. SHILAP Revista de lepidopterología.

Sengupta, Atanu & Tapan Kumar Pal. (2009). Fuzzy Preference Ordering of Interval Numbers in Decision Problems. Studies in fuzziness and soft computing. 77 indexed citations

Pal, Madhumangal, et al.. (2007). Selection of programme slots of television channels for giving advertisement: A graph theoretic approach. Information Sciences. 177(12). 2480–2492. 33 indexed citations

Sengupta, Atanu & Tapan Kumar Pal. (2006). Solving the Shortest Path Problem with Interval Arcs. Fuzzy Optimization and Decision Making. 5(1). 71–89. 27 indexed citations

Pal, Madhumangal, et al.. (2005). An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs. Journal of Applied Mathematics and Computing. 17(1-2). 1–23. 5 indexed citations

Pal, Madhumangal, et al.. (2005). An optimal parallel algorithm to construct a tree 3-spanner on interval graphs. International Journal of Computer Mathematics. 82(3). 259–274. 7 indexed citations

Pal, Madhumangal, et al.. (2003). An Efficient Algorithm for Finding All Hinge Vertices on Trapezoid Graphs. Theory of Computing Systems. 36(1). 17–27. 5 indexed citations

Pal, Madhumangal, et al.. (2003). Optimal Sequential and Parallel Algorithms to Compute All Cut Vertices on Trapezoid Graphs. Computational Optimization and Applications. 27(1). 95–113. 1 indexed citations

Pal, Madhumangal, et al.. (2003). Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs. International Journal of Computer Mathematics. 80(8). 937–943. 3 indexed citations

10.

Pal, Madhumangal, et al.. (2003). An optimal pram algorithm for a spanning tree on trapezoid graphs. Journal of Applied Mathematics and Computing. 12(1-2). 21–29. 4 indexed citations

11.

Pal, Madhumangal, et al.. (2002). An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs. International Journal of Computer Mathematics. 79(2). 189–204. 6 indexed citations

12.

Pal, Madhumangal, et al.. (2002). AN OPTIMAL ALGORITHM FOR SOLVING ALL-PAIRS SHORTEST PATHS ON TRAPEZOID GRAPHS. 3(2). 103–116. 17 indexed citations

13.

Pal, Madhumangal, et al.. (2002). An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs. International Journal of Computer Mathematics. 79(10). 1057–1065. 9 indexed citations

14.

Pal, Madhumangal, et al.. (2001). An Efficient Algorithm for Finding a Maximum Weight k-Independent Set on Trapezoid Graphs. Computational Optimization and Applications. 18(1). 49–62. 14 indexed citations

15.

Sengupta, Atanu, Tapan Kumar Pal, & Debjani Chakraborty. (2001). Interpretation of inequality constraints involving interval coefficients and a solution to interval linear programming. Fuzzy Sets and Systems. 119(1). 129–138. 214 indexed citations

16.

Pal, Madhumangal, et al.. (2000). An optimal parallel algorithm for computing cut vertices and blocks on interval graphs. International Journal of Computer Mathematics. 75(1). 59–70. 7 indexed citations

17.

Sengupta, Atanu & Tapan Kumar Pal. (2000). On comparing interval numbers. European Journal of Operational Research. 127(1). 28–43. 362 indexed citations

18.

Pal, Madhumangal, et al.. (1999). An optimal algorithm for finding depth-first spanning tree on permutation graphs. Journal of Applied Mathematics and Computing. 6(3). 493–500. 4 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