Journals in DBLP

J. Comb. Optim.
2001, volume: 5, number: 4

1. Mauricio G. C. Resende
   "Mobile Networks and Computing". [Citation Graph (0, 0)][DBLP]
   J. Comb. Optim., 2001, v:5, n:4, pp:297-298 [Journal]
   
2. Xiaotie Deng, Evangelos E. Milios, Andranik Mirzaian
   Robot Map Verification of a Graph World. [Citation Graph (0, 0)][DBLP]
   J. Comb. Optim., 2001, v:5, n:4, pp:383-395 [Journal]
   
3. Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
   Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts. [Citation Graph (0, 0)][DBLP]
   J. Comb. Optim., 2001, v:5, n:4, pp:397-410 [Journal]
   
4. H. Y. Lau, H. F. Ting
   The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent. [Citation Graph (0, 0)][DBLP]
   J. Comb. Optim., 2001, v:5, n:4, pp:411-420 [Journal]
   
5. J. MacGregor Smith, Wu-Ji Li
   Quadratic Assignment Problems and M/G/C/C/ State Dependent Network Flows. [Citation Graph (0, 0)][DBLP]
   J. Comb. Optim., 2001, v:5, n:4, pp:421-443 [Journal]
   
6. Nodari Vakhania
   Tight Performance Bounds of CP-Scheduling on Out-Trees. [Citation Graph (0, 0)][DBLP]
   J. Comb. Optim., 2001, v:5, n:4, pp:445-464 [Journal]
   
7. Mhand Hifi, Catherine Roucairol
   Approximate and Exact Algorithms for Constrained (Un) Weighted Two-dimensional Two-staged Cutting Stock Problems. [Citation Graph (0, 0)][DBLP]
   J. Comb. Optim., 2001, v:5, n:4, pp:465-494 [Journal]
   
8. Mauricio G. C. Resende
   Multichannel Optical Networks: Theory and Practice. [Citation Graph (0, 0)][DBLP]
   J. Comb. Optim., 2001, v:5, n:4, pp:495-496 [Journal]