Networks, Volume 47

Volume 47, Number 1, January 2006

• Tiziana Calamoneri, Annalisa Massini:
  Nearly optimal three dimensional layout of hypercube networks. 1-8
  Electronic Edition (link) BibTeX
• Jean-Claude Bermond, F. Havet, Csaba D. Tóth:
  Fault tolerant on-board networks with priorities. 9-25
  Electronic Edition (link) BibTeX
• Sun-Yuan Hsieh, Tien-Te Hsiao:
  The k-degree Cayley graph and its topological properties. 26-36
  Electronic Edition (link) BibTeX
• Hasan Ural, Keqin Zhu:
  Distributed delay constrained multicast routing algorithm with efficient fault recovery. 37-51
  Electronic Edition (link) BibTeX
• Roberto Baldacci, Vittorio Maniezzo:
  Exact methods based on node-routing formulations for undirected arc-routing problems. 52-60
  Electronic Edition (link) BibTeX

Volume 47, Number 2, March 2006

• Stefan Dobrev, Paola Flocchini, Rastislav Kralovic, Peter Ruzicka, Giuseppe Prencipe, Nicola Santoro:
  Black hole search in common interconnection networks. 61-71
  Electronic Edition (link) BibTeX
• Ann Melissa Campbell, Timothy J. Lowe, Li Zhang:
  Upgrading arcs to minimize the maximum travel time in a network. 72-80
  Electronic Edition (link) BibTeX
• Donglei Du, R. Chandrasekaran:
  The multiroute maximum flow problem revisited. 81-92
  Electronic Edition (link) BibTeX
• S. Miquel, Bas van Velzen, Herbert Hamers, Henk Norde:
  Fixed tree games with multilocated players. 93-101
  Electronic Edition (link) BibTeX
• Yuqing Lin, Mirka Miller, Camino Balbuena, Xavier Marcote:
  All (k;g)-cages are edge-superconnected. 102-110
  Electronic Edition (link) BibTeX
• Stefan Hougardy, Stefan Kirchner:
  Lower bounds for the relative greedy algorithm for approximating Steiner trees. 111-115
  Electronic Edition (link) BibTeX
• Johanna Becker, Zsolt Csizmadia, Jérôme Galtier, Alexandre Laugier, Jácint Szabó, László Szegö:
  An integer programming approach to routing in daisy networks. 116-121
  Electronic Edition (link) BibTeX

Volume 47, Number 3, May 2006

• Yogesh K. Agarwal:
  k-Partition-based facets of the network design problem. 123-139
  Electronic Edition (link) BibTeX
• J. Gómez Martí, M. Miller:
  Two new families of large compound graphs. 140-146
  Electronic Edition (link) BibTeX
• Yen Hung Chen, Bang Ye Wu, Chuan Yi Tang:
  Approximation algorithms for some k-source shortest paths spanning tree problems. 147-156
  Electronic Edition (link) BibTeX
• Elder M. Macambira, Nelson Maculan, Cid C. de Souza:
  A column generation approach for SONET ring assignment. 157-171
  Electronic Edition (link) BibTeX
• Lars Engebretsen, Madhu Sudan:
  Harmonic broadcasting is bandwidth-optimal assuming constant bit rate. 172-177
  Electronic Edition (link) BibTeX
• Paraskevi Fragopoulou:
  Approximation algorithms for the k-source multicast tree construction problem. 178-183
  Electronic Edition (link) BibTeX

Volume 47, Number 4, July 2006

• Gautam Appa, Balázs Kotnyek:
  A bidirected generalization of network matrices. 185-198
  Electronic Edition (link) BibTeX
• Olena Chapovska, Abraham P. Punnen:
  Variations of the prize-collecting Steiner tree problem. 199-205
  Electronic Edition (link) BibTeX
• Daniel J. Rosenkrantz, Giri Kumar Tayi, S. S. Ravi:
  Obtaining online approximation algorithms for facility dispersion from offline algorithms. 206-217
  Electronic Edition (link) BibTeX
• Hovhannes A. Harutyunyan:
  Minimum multiple message broadcast graphs. 218-224
  Electronic Edition (link) BibTeX
• Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang:
  Approximation algorithms for channel allocation problems in broadcast networks. 225-236
  Electronic Edition (link) BibTeX
• Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir, Dionisio Pérez-Brito:
  The bi-criteria doubly weighted center-median path problem on a tree. 237-247
  Electronic Edition (link) BibTeX