| 2001 |
|---|
| 11 | | Barun Chandra,
Magnús M. Halldórsson:
Approximation Algorithms for Dispersion Problems.
J. Algorithms 38(2): 438-465 (2001) |
| 10 | | Barun Chandra,
Magnús M. Halldórsson:
Greedy Local Improvement and Weighted Set Packing Approximation.
J. Algorithms 39(2): 223-240 (2001) |
| 1999 |
|---|
| 9 | EE | Barun Chandra,
Magnús M. Halldórsson:
Greedy Local Improvement and Weighted Set Packing Approximation.
SODA 1999: 169-176 |
| 8 | | Barun Chandra,
Howard J. Karloff,
Craig A. Tovey:
New Results on the Old k-opt Algorithm for the Traveling Salesman Problem.
SIAM J. Comput. 28(6): 1998-2029 (1999) |
| 1996 |
|---|
| 7 | | Barun Chandra,
Magnús M. Halldórsson:
Facility Dispersion and Remote Subgraphs.
SWAT 1996: 53-65 |
| 1995 |
|---|
| 6 | | Barun Chandra,
Gautam Das,
Giri Narasimhan,
José Soares:
New sparseness results on graph spanners.
Int. J. Comput. Geometry Appl. 5: 125-144 (1995) |
| 5 | | Barun Chandra,
Sundar Vishwanathan:
Constructing Reliable Communication Networks of Small Weight Online.
J. Algorithms 18(1): 159-175 (1995) |
| 1994 |
|---|
| 4 | | Barun Chandra,
Howard J. Karloff,
Craig A. Tovey:
New Results on the Old k-Opt Algorithm for the TSP.
SODA 1994: 150-159 |
| 3 | | Barun Chandra:
Constructing Sparse Spanners for Most Graphs in Higher Dimensions.
Inf. Process. Lett. 51(6): 289-294 (1994) |
| 1992 |
|---|
| 2 | EE | Barun Chandra,
Gautam Das,
Giri Narasimhan,
José Soares:
New Sparseness Results on Graph Spanners.
Symposium on Computational Geometry 1992: 192-201 |
| 1 | | Barun Chandra:
Does Randomization Help in On-Line Bin Packing?
Inf. Process. Lett. 43(1): 15-19 (1992) |
