Barun Chandra

11 papers A* 2Journal 7Unranked 2
YearRankTypeTitle / Venue / Authors
2001 J jnl
Approximation Algorithms for Dispersion Problems.
J. Algorithms
Barun Chandra, Magnús M. Halldórsson
2001 J jnl
Greedy Local Improvement and Weighted Set Packing Approximation.
J. Algorithms
Barun Chandra, Magnús M. Halldórsson
1999 A* conf
Greedy Local Improvement and Weighted Set Packing Approximation.
SODA
Barun Chandra, Magnús M. Halldórsson
1999 J jnl
New Results on the Old k-opt Algorithm for the Traveling Salesman Problem.
SIAM J. Comput.
Barun Chandra, Howard J. Karloff, Craig A. Tovey
1996 — conf
Facility Dispersion and Remote Subgraphs.
SWAT
Barun Chandra, Magnús M. Halldórsson
1995 J jnl
Constructing Reliable Communication Networks of Small Weight Online.
J. Algorithms
Barun Chandra, Sundar Vishwanathan
1995 J jnl
New sparseness results on graph spanners.
Int. J. Comput. Geom. Appl.
Barun Chandra, Gautam Das, Giri Narasimhan, José Soares
1994 J jnl
Constructing Sparse Spanners for Most Graphs in Higher Dimensions.
Inf. Process. Lett.
Barun Chandra
1994 A* conf
New Results on the Old k-Opt Algorithm for the TSP.
SODA
Barun Chandra, Howard J. Karloff, Craig A. Tovey
1992 J jnl
Does Randomization Help in On-Line Bin Packing?
Inf. Process. Lett.
Barun Chandra
1992 — conf
New Sparseness Results on Graph Spanners.
SCG
Barun Chandra, Gautam Das, Giri Narasimhan, José Soares