1. Robot Map Verification of a Graph World

   • Xiaotie Deng
   • Evangelos Milios
   • Andranik Mirzaian

   OriginalPaper Pages: 383 - 395

2. Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts

   • Liang Zhao
   • Hiroshi Nagamochi
   • Toshihide Ibaraki

   OriginalPaper Pages: 397 - 410

3. The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent Set

   • H.Y. Lau
   • H.F. Ting

   OriginalPaper Pages: 411 - 420

4. Quadratic Assignment Problems and M/G/C/C/ State Dependent Network Flows

   • J. Macgregor Smith
   • Wu-Ji Li

   OriginalPaper Pages: 421 - 443

5. Tight Performance Bounds of CP-Scheduling on Out-Trees

   • Nodari Vakhania

   OriginalPaper Pages: 445 - 464

6. Approximate and Exact Algorithms for Constrained (Un) Weighted Two-dimensional Two-staged Cutting Stock Problems

   • Mhand Hifi
   • Catherine Roucairol

   OriginalPaper Pages: 465 - 494

7. Multichannel Optical Networks: Theory and Practice

   • Mauricio G. C. Resende

   BookReview Pages: 495 - 496

8. “Mobile Networks and Computing,”

   • Mauricio G. C. Resende

   BookReview Pages: 497 - 498