1. Two-Connected Networks with Rings of Bounded Cardinality

   • B. Fortz
   • M. Labbé

   OriginalPaper Pages: 123 - 148

2. A Branch and Bound Algorithm for Primary Routes Assignment in Survivable Connection Oriented Networks

   • Krzysztof M. Walkowiak

   OriginalPaper Pages: 149 - 171

3. Finding All Maximal Cliques in Dynamic Graphs

   • Volker Stix

   OriginalPaper Pages: 173 - 186

4. An Augmented Lagrangian Algorithm for Large Scale Multicommodity Routing

   • Torbjörn Larsson
   • Di Yuan

   OriginalPaper Pages: 187 - 215