
Search the dblp DataBase
Barun Chandra:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Barun Chandra, Gautam Das, Giri Narasimhan, José Soares
New Sparseness Results on Graph Spanners. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1992, pp:192201 [Conf]
 Barun Chandra, Magnús M. Halldórsson
Greedy Local Improvement and Weighted Set Packing Approximation. [Citation Graph (0, 0)][DBLP] SODA, 1999, pp:169176 [Conf]
 Barun Chandra, Howard J. Karloff, Craig A. Tovey
New Results on the Old kOpt Algorithm for the TSP. [Citation Graph (0, 0)][DBLP] SODA, 1994, pp:150159 [Conf]
 Barun Chandra, Magnús M. Halldórsson
Facility Dispersion and Remote Subgraphs. [Citation Graph (0, 0)][DBLP] SWAT, 1996, pp:5365 [Conf]
 Barun Chandra, Gautam Das, Giri Narasimhan, José Soares
New sparseness results on graph spanners. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 1995, v:5, n:, pp:125144 [Journal]
 Barun Chandra
Does Randomization Help in OnLine Bin Packing? [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1992, v:43, n:1, pp:1519 [Journal]
 Barun Chandra
Constructing Sparse Spanners for Most Graphs in Higher Dimensions. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1994, v:51, n:6, pp:289294 [Journal]
 Barun Chandra, Magnús M. Halldórsson
Approximation Algorithms for Dispersion Problems. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2001, v:38, n:2, pp:438465 [Journal]
 Barun Chandra, Magnús M. Halldórsson
Greedy Local Improvement and Weighted Set Packing Approximation. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2001, v:39, n:2, pp:223240 [Journal]
 Barun Chandra, Sundar Vishwanathan
Constructing Reliable Communication Networks of Small Weight Online. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1995, v:18, n:1, pp:159175 [Journal]
 Barun Chandra, Howard J. Karloff, Craig A. Tovey
New Results on the Old kopt Algorithm for the Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1999, v:28, n:6, pp:19982029 [Journal]
Search in 0.002secs, Finished in 0.003secs
