| 179 | -- | 0 | Bruce L. Golden, Douglas R. Shier. Editorial: 2007 Glover-Klingman Prize winners |
| 180 | -- | 182 | Jyhmin Kuo, Hung-Lin Fu. On the diameter of the generalized undirected de Bruijn graphs ::::UG::::::::::B::::::(::::n::::, ::::m::::), ::::n:::::::2::: < ::::m:::: <= ::::n:::::::3::: |
| 183 | -- | 195 | Bernhard Fuchs. On the hardness of range assignment problems |
| 196 | -- | 201 | Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela. Conditional diameter saturated graphs |
| 202 | -- | 205 | Chao Yang, Jun Ming Xu. Reliability of interconnection networks modeled by Cartesian product digraphs |
| 206 | -- | 215 | Peter Broström, Kaj Holmberg. Valid cycles: A source of infeasibility in open shortest path first routing |
| 216 | -- | 226 | Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco. Approximation bounds for Black Hole Search problems |
| 227 | -- | 234 | Mourad Baïou, Francisco Barahona. A linear programming approach to increasing the weight of all minimum spanning trees |
| 235 | -- | 251 | Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou. Competitive algorithms and lower bounds for online randomized call control in cellular networks |
| 252 | -- | 255 | Dieter Rautenbach, Lutz Volkmann. Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles |
| 256 | -- | 270 | W. Matthew Carlyle, Johannes O. Royset, R. Kevin Wood. Lagrangian relaxation and enumeration for solving constrained shortest-path problems |
| 271 | -- | 276 | Jørgen Bang-Jensen, Tibor Jordán. On persistent directed graphs |
| 277 | -- | 286 | Bey-Chi Lin, Chin-Tau Lea. Multirate nonblocking multicast Log::2::(::::N, m, p::::) networks |
| 287 | -- | 298 | Julie Christophe, Sophie Dewez, Jean-Paul Doignon, Gilles Fasbender, Philippe Grégoire, David Huygens, Martine Labbé, Sourour Elloumi, Hadrien Mélot, Hande Yaman. Linear inequalities among graph invariants: Using ::::GraPHedron:::: to uncover optimal relationships |
| 299 | -- | 306 | Charles J. Colbourn, Gaetano Quattrocchi, Violet R. Syrotiuk. Lower bounds for two-period grooming via linear programming duality |
| 307 | -- | 324 | Charles J. Colbourn, Gaetano Quattrocchi, Violet R. Syrotiuk. Grooming for two-period optical networks |
| 325 | -- | 332 | Gennaro Cordasco, Luisa Gargano, Alberto Negro, Vittorio Scarano, Mikael Hammar. F-Chord: Improved uniform routing on Chord |