External Links

    Journal: Networks

    Volume 43, Issue 4

    0 -- 0. From the editors
    201 -- 211Deepak Rajan, Alper Atamtürk. A directed cycle-based column-and-cut generation method for capacitated survivable network design
    212 -- 223Tetsuya Fujie. The maximum-leaf spanning tree problem: Formulations and facets
    224 -- 225M. G. Karagiannopoulos, Michael N. Vrahatis, Gerasimos C. Meletiou. A note on a secure voting system on a public network
    226 -- 240Natashia Boland, Horst W. Hamacher, Frank Lenzen. Minimizing beam-on time in cancer radiation treatment using multileaf collimators
    241 -- 255Maria Paola Scaparra, Stefano Pallottino, Maria Grazia Scutellà. Large-scale local search heuristics for the capacitated vertex p-center problem
    256 -- 265Vardges Melkonian, Éva Tardos. Algorithms for a network design problem with crossing supermodular demands
    266 -- 272Sheshayya A. Choudum, R. Usha Nandini. Complete binary trees in folded and enhanced cubes

    Volume 43, Issue 3

    125 -- 140Wided Ouaja, Barry Richards. A hybrid multicommodity routing algorithm for traffic engineering
    141 -- 152John Nolan. Bisectored unit disk graphs
    153 -- 162Bettina Klinz, Gerhard J. Woeginger. Minimum-cost dynamic flows: The series-parallel case
    163 -- 176S. Raghavan. Low-connectivity network design on series-parallel graphs
    177 -- 189Martine Labbé, Gilbert Laporte, Inmaculada Rodríguez Martín, Juan José Salazar González. The Ring Star Problem: Polyhedral analysis and exact algorithm
    190 -- 199Geir Dahl, Bjarne Johannessen. The 2-path network problem

    Volume 43, Issue 2

    61 -- 70Arthur M. Farley. Minimal path broadcast networks
    71 -- 86Corinne Feremans, Martine Labbé, Gilbert Laporte. The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
    87 -- 102Raffaele Pesenti, Franca Rinaldi, Walter Ukovich. An exact algorithm for the min-cost network containment problem
    103 -- 108Ivo Blöchliger, Dominique de Werra. On some properties of suboptimal colorings of graphs
    109 -- 118Dov Dvir, Gabriel Y. Handler. The absolute center of a network
    119 -- 124Marek Chrobak, Leszek Gasieniec, Wojciech Rytter. A randomized algorithm for gossiping in radio networks

    Volume 43, Issue 1

    1 -- 9Illya V. Hicks. Branch decompositions and minor containment
    10 -- 27Anantaram Balakrishnan, Thomas L. Magnanti, Prakash Mirchandani. Connectivity-splitting models for survivable network design
    28 -- 38Jung-Sheng Fu, Gen-Huey Chen. Fault-tolerant cycle embedding in hierarchical cubic networks
    39 -- 53Kaj Holmberg, Di Yuan. Optimization of Internet Protocol network design and routing
    54 -- 59Xavier Marcote, Camino Balbuena. Edge-superconnectivity of cages
    runs on