- CSB - MetaPress - Google - Bing - Yahoo
 | 2001 | |
|---|---|---|
| j7 |      | Barun Chandra, Magnús M. Halldórsson: Approximation Algorithms for Dispersion Problems. J. Algorithms 38(2): 438-465 (2001) |
| j6 | | Barun Chandra, Magnús M. Halldórsson: Greedy Local Improvement and Weighted Set Packing Approximation. J. Algorithms 39(2): 223-240 (2001) |
| 1999 | ||
| j5 | | 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) |
| c4 | | Barun Chandra, Magnús M. Halldórsson: Greedy Local Improvement and Weighted Set Packing Approximation. SODA 1999: 169-176 |
| 1996 | ||
| c3 | | |
| 1995 | ||
| j4 | | Barun Chandra, Gautam Das, Giri Narasimhan, José Soares: New sparseness results on graph spanners. Int. J. Comput. Geometry Appl. 5: 125-144 (1995) |
| j3 | | Barun Chandra, Sundar Vishwanathan: Constructing Reliable Communication Networks of Small Weight Online. J. Algorithms 18(1): 159-175 (1995) |
| 1994 | ||
| j2 | | Barun Chandra: Constructing Sparse Spanners for Most Graphs in Higher Dimensions. Inf. Process. Lett. 51(6): 289-294 (1994) |
| c2 | | Barun Chandra, Howard J. Karloff, Craig A. Tovey: New Results on the Old k-Opt Algorithm for the TSP. SODA 1994: 150-159 |
| 1992 | ||
| j1 | | Barun Chandra: Does Randomization Help in On-Line Bin Packing? Inf. Process. Lett. 43(1): 15-19 (1992) |
| c1 | | Barun Chandra, Gautam Das, Giri Narasimhan, José Soares: New Sparseness Results on Graph Spanners. Symposium on Computational Geometry 1992: 192-201 |
| 1 | Gautam Das | |
| 2 | Magnús M. Halldórsson | |
| 3 | Howard J. Karloff | |
| 4 | Giri Narasimhan | |
| 5 | José Soares | |
| 6 | Craig A. Tovey | |
| 7 | Sundar Vishwanathan |
Colors in the list of coauthors
Last update Fri May 24 09:28:39 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page