Does Randomization Help in On-Line Bin Packing? - Barun Chandra (Inf. Process. Lett., 1992)

New Results on the Old k-Opt Algorithm for the TSP. - Barun Chandra; Howard J. Karloff; Craig A. Tovey (SODA, 1994)

Constructing Sparse Spanners for Most Graphs in Higher Dimensions. - Barun Chandra (Inf. Process. Lett., 1994)

New sparseness results on graph spanners. - Barun Chandra; Gautam Das 001; Giri Narasimhan; José Soares (Int. J. Comput. Geom. Appl., 1995)

Constructing Reliable Communication Networks of Small Weight Online. - Barun Chandra; Sundar Vishwanathan (J. Algorithms, 1995)

Facility Dispersion and Remote Subgraphs. - Barun Chandra; Magnús M. Halldórsson (SWAT, 1996)

New Results on the Old k-opt Algorithm for the Traveling Salesman Problem. - Barun Chandra; Howard J. Karloff; Craig A. Tovey (SIAM J. Comput., 1999)

Approximation Algorithms for Dispersion Problems. - Barun Chandra; Magnús M. Halldórsson (J. Algorithms, 2001)

Greedy Local Improvement and Weighted Set Packing Approximation. - Barun Chandra; Magnús M. Halldórsson (J. Algorithms, 2001)