Countries citing papers authored by Kailash C. Madan
Since
Specialization
Citations
This map shows the geographic impact of Kailash C. Madan'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 Kailash C. Madan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Kailash C. Madan more than expected).
Fields of papers citing papers by Kailash C. Madan
This network shows the impact of papers produced by Kailash C. Madan. 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 Kailash C. Madan. The network helps show where Kailash C. Madan may publish in the future.
Co-authorship network of co-authors of Kailash C. Madan
This figure shows the co-authorship network connecting the top 25 collaborators of Kailash C. Madan.
A scholar is included among the top collaborators of Kailash C. Madan 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 Kailash C. Madan. Kailash C. Madan is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Madan, Kailash C., et al.. (2016). On a batch arrival queue with second optional service, random breakdowns, delay time for repairs to start and restricted availability of arrivals during breakdown periods. Journal of Mathematical and Computational Science. 7(1). 175–188.1 indexed citations
4.
Madan, Kailash C.. (2015). On a M[x]/(G1,G2)/1 queue with third-stage optional service and deterministic server vacations. Journal of Mathematical and Computational Science. 5(2). 195–206.2 indexed citations
5.
Madan, Kailash C.. (2014). ON A SINGLE SERVER QUEUE WITH ARRIVALS IN BATCHES OF VARIABLE SIZE, GENERAL SERVICE IN THREE FLUCTUATING MODES, BALKING, RANDOM BREAKDOWNS AND A STAND-BY SERVER DURING BREAKDOWN PERIODS. 35(3). 189–200.2 indexed citations
6.
Madan, Kailash C., et al.. (2014). A BATCH ARRIVAL QUEUE WITH SECOND OPTIONAL SERVICE AND RENEGING DURING VACATION PERIODS. 34(3). 244–258.4 indexed citations
Madan, Kailash C., et al.. (2009). BATCH ARRIVAL QUEUEING SYSTEM WITH RANDOM BREAKDOWNS AND BERNOULLI SCHEDULE SERVER VACATIONS HAVING GENERAL TIME DISTRIBUTION. 20(1). 55–70.25 indexed citations
10.
Choudhury, Gautam & Kailash C. Madan. (2006). A Batch Arrival Queue with Bernoulli Vacation Schedule under Multiple Vacation Policy. 12(2). 1–18.5 indexed citations
11.
Choudhury, Gautam & Kailash C. Madan. (2005). A TWO-STAGE BATCH ARRIVAL QUEUEING SYSTEM WITH A RANDOM SETUP TIME UNDER MODIFIED BERNOULLI SCHEDULE VACATION *. 26(3). 238–250.1 indexed citations
Madan, Kailash C., et al.. (2002). An M/G/1 queue with second optional service and Bernoulli schedule server vacations. Systems Science. 28. 51–62.11 indexed citations
15.
Madan, Kailash C. & Hani M. Samawi. (2002). Steady state analysis of an M/D/1 queue with two stages of heterogeneous server vacations (M/D/G1, G2/1 queue). 23(2). 150–163.1 indexed citations
16.
Madan, Kailash C.. (2002). Balking Phenomenon in the M[x] /G/1 Vacation Queue. Journal of the Korean Statistical Society. 31(4). 491–507.1 indexed citations
17.
Madan, Kailash C., et al.. (2001). On M/D/1 queue with deterministic server vacations. Systems Science. 27. 107–118.8 indexed citations
18.
Madan, Kailash C.. (1999). An M/G/1 queue with optional deterministic server vacations. METRON. 83–95.17 indexed citations
Madan, Kailash C.. (1993). Balking and reneging in a vacation queueing model. Revista Colombiana de Estadística. 14(28).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.