Networks, Volume 42

Volume 42, Number 1, 2003

• Alexandra Makri, Diego Klabjan:
  Algorithms for source-to-all maximum cost-to-time ratio problem in acyclic networks. 1-14
  Electronic Edition (link) BibTeX
• Francesc Comellas, Miguel Angel Fiol, Joan Gimbert, Margarida Mitjana:
  The spectra of wrapped butterfly digraphs. 15-19
  Electronic Edition (link) BibTeX
• Frank K. Hwang, Wen-Dar Lin:
  A general construction for nonblocking crosstalk-free photonic switching networks. 20-25
  Electronic Edition (link) BibTeX
• Roberto Baldacci, Eleni Hadjiconstantinou, Aristide Mingozzi:
  An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections. 26-41
  Electronic Edition (link) BibTeX
• Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni:
  The facility location problem with general cost functions. 42-47
  Electronic Edition (link) BibTeX
• Nenad Mladenovic, Martine Labbé, Pierre Hansen:
  Solving the p-Center problem with Tabu Search and Variable Neighborhood Search. 48-64
  Electronic Edition (link) BibTeX

Volume 42, Number 2, September 2003

• Douglas R. Shier, Bruce L. Golden:
  Editorial: Glover-Klingman prize. 65
  Electronic Edition (link) BibTeX
• Joseph Geunes, Panos M. Pardalos:
  Network optimization in supply chain management and financial engineering: An annotated bibliography. 66-84
  Electronic Edition (link) BibTeX
• Chang-Hsiung Tsai, Tyne Liang, Lih-Hsing Hsu, Men-Yang Lin:
  Cycle embedding in faulty wrapped butterfly graphs. 85-96
  Electronic Edition (link) BibTeX
• Chih-Jen Tseng, Chyouhwa Chen:
  The performance of QoS-aware IP multicast routing protocols. 97-108
  Electronic Edition (link) BibTeX
• Angel Corberán, Enrique Mota, Juan José Salazar:
  Some recent contributions to routing and location problems. 109-113
  Electronic Edition (link) BibTeX
• Mauricio G. C. Resende, Geraldo Veiga:
  An annotated bibliography of network interior point methods. 114-121
  Electronic Edition (link) BibTeX

Volume 42, Number 3, October 2003

• Francesc Comellas, Pavol Hell:
  Broadcasting in generalized chordal rings. 123-134
  Electronic Edition (link) BibTeX
• I. Dumitrescu, N. Boland:
  Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem. 135-153
  Electronic Edition (link) BibTeX
• Claudia Archetti, Luca Bertazzi, Maria Grazia Speranza:
  Reoptimizing the traveling salesman problem. 154-159
  Electronic Edition (link) BibTeX
• Masud Hasan, Md. Saidur Rahman, Takao Nishizeki:
  A linear algorithm for compact box-drawings of trees. 160-164
  Electronic Edition (link) BibTeX
• Steven B. Horton, T. Easton, R. Gary Parker:
  The linear arrangement problem on recursively constructed graphs. 165-168
  Electronic Edition (link) BibTeX
• Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou:
  Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory. 169-180
  Electronic Edition (link) BibTeX

Volume 42, Number 4, December 2003

• José Gómez, Eduardo A. Canale, Xavier Muñoz:
  Unilaterally connected large digraphs and generalized cycles. 181-188
  Electronic Edition (link) BibTeX
• Hong-Chun Hsu, Yi-Lin Hsieh, Jimmy J. M. Tan, Lih-Hsing Hsu:
  Fault Hamiltonicity and fault Hamiltonian connectivity of the (n, k)-star graphs. 189-201
  Electronic Edition (link) BibTeX
• Xiuzhen Cheng, Xiao Huang, Deying Li, Weili Wu, Ding-Zhu Du:
  A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks. 202-208
  Electronic Edition (link) BibTeX
• Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler:
  On the power of BFS to determine a graph's diameter. 209-222
  Electronic Edition (link) BibTeX