Journal: Networks

Volume 42, Issue 4

181 -- 188José Gómez, Eduardo A. Canale, Xavier Muñoz. Unilaterally connected large digraphs and generalized cycles
189 -- 201Hong-Chun Hsu, Yi-Lin Hsieh, Jimmy J. M. Tan, Lih-Hsing Hsu. Fault Hamiltonicity and fault Hamiltonian connectivity of the (n, k)-star graphs
202 -- 208Xiuzhen 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
209 -- 222Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler. On the power of BFS to determine a graph s diameter

Volume 42, Issue 3

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

Volume 42, Issue 2

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

Volume 42, Issue 1

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