Barun Chandra

531 total citations
12 papers, 254 citations indexed

About

Barun Chandra is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Industrial and Manufacturing Engineering. According to data from OpenAlex, Barun Chandra has authored 12 papers receiving a total of 254 indexed citations (citations by other indexed papers that have themselves been cited), including 8 papers in Computational Theory and Mathematics, 3 papers in Computer Graphics and Computer-Aided Design and 3 papers in Industrial and Manufacturing Engineering. Recurrent topics in Barun Chandra's work include Graph Labeling and Dimension Problems (5 papers), Advanced Graph Theory Research (5 papers) and Computational Geometry and Mesh Generation (3 papers). Barun Chandra is often cited by papers focused on Graph Labeling and Dimension Problems (5 papers), Advanced Graph Theory Research (5 papers) and Computational Geometry and Mesh Generation (3 papers). Barun Chandra collaborates with scholars based in United States, India and Iceland. Barun Chandra's co-authors include Magnús M. Halldórsson, Gautam Das, Giri Narasimhan, José Soares, Craig A. Tovey, Howard Karloff and Sundar Vishwanathan and has published in prestigious journals such as SIAM Journal on Computing, Journal of Algorithms and Information Processing Letters.

In The Last Decade

Barun Chandra

10 papers receiving 229 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Barun Chandra United States	7	107	100	72	60	56	12	254
Yoram J. Sussmann United States	7	64 0.6×	135 1.4×	90 1.3×	32 0.5×	31 0.6×	7	258
Karl Heinz Borgwardt Germany	6	97 0.9×	34 0.3×	37 0.5×	31 0.5×	31 0.6×	14	217
Glenn K. Manacher United States	9	165 1.5×	83 0.8×	42 0.6×	57 0.9×	122 2.2×	22	324
Frédéric Roupin France	8	121 1.1×	64 0.6×	52 0.7×	12 0.2×	40 0.7×	18	210
Glencora Borradaile United States	11	193 1.8×	94 0.9×	21 0.3×	75 1.3×	41 0.7×	31	293
Kiyohito Nagano Japan	8	104 1.0×	113 1.1×	13 0.2×	16 0.3×	69 1.2×	11	224
V. Zissimopoulos France	11	25 0.2×	230 2.3×	152 2.1×	99 1.6×	71 1.3×	18	432
Dorit Dor Israel	6	128 1.2×	45 0.5×	17 0.2×	14 0.2×	95 1.7×	10	250
Bertrand Estellon France	10	82 0.8×	42 0.4×	112 1.6×	12 0.2×	30 0.5×	18	267

Countries citing papers authored by Barun Chandra

Since Specialization

Citations

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

Fields of papers citing papers by Barun Chandra

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Barun Chandra

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

12 of 12 papers shown

1.

Chandra, Barun, et al.. (2020). Group S3 cordial prime labeling of some splitting graphs. AIP conference proceedings. 2277. 100009–100009. 1 indexed citations

2.

Chandra, Barun, et al.. (2019). Group $S_{3}$ cordial prime labeling of graphs. Malaya Journal of Matematik. S(1). 403–407.

3.

Chandra, Barun & Magnús M. Halldórsson. (2001). Greedy Local Improvement and Weighted Set Packing Approximation. Journal of Algorithms. 39(2). 223–240. 18 indexed citations

4.

Chandra, Barun & Magnús M. Halldórsson. (2001). Approximation Algorithms for Dispersion Problems. Journal of Algorithms. 38(2). 438–465. 44 indexed citations

5.

Chandra, Barun, Howard Karloff, & Craig A. Tovey. (1999). New Results on the Old k-opt Algorithm for the Traveling Salesman Problem. SIAM Journal on Computing. 28(6). 1998–2029. 50 indexed citations

6.

Chandra, Barun, et al.. (1995). Facility Dispersion and Remote Subgraphs. IPSJ SIG Notes. 1995(32). 69–76. 1 indexed citations

7.

Chandra, Barun & Sundar Vishwanathan. (1995). Constructing Reliable Communication Networks of Small Weight Online. Journal of Algorithms. 18(1). 159–175. 4 indexed citations

8.

Chandra, Barun, Gautam Das, Giri Narasimhan, & José Soares. (1995). NEW SPARSENESS RESULTS ON GRAPH SPANNERS. International Journal of Computational Geometry & Applications. 5(01n02). 125–144. 37 indexed citations

9.

Chandra, Barun, Howard Karloff, & Craig A. Tovey. (1994). New results on the old k-opt algorithm for the TSP. Symposium on Discrete Algorithms. 150–159. 20 indexed citations

10.

Chandra, Barun. (1994). Constructing sparse spanners for most graphs in higher dimensions. Information Processing Letters. 51(6). 289–294. 3 indexed citations

11.

Chandra, Barun, Gautam Das, Giri Narasimhan, & José Soares. (1992). New sparseness results on graph spanners. 192–201. 66 indexed citations

12.

Chandra, Barun. (1992). Does randomization help in on-line bin packing?. Information Processing Letters. 43(1). 15–19. 10 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