Journal: Networks

Volume 56, Issue 4

229 -- 243Hanne L. Petersen, Claudia Archetti, Maria Grazia Speranza. Exact solutions to the double travelling salesman problem with multiple stacks
244 -- 254Marcus Brazil, C. J. Ras, D. A. Thomas. Approximating minimum Steiner point trees in Minkowski planes
255 -- 262Carles Capdevila, Josep Conde, Geoffrey Exoo, Joan Gimbert, Nacho López. Ranking measures for radially Moore graphs
263 -- 271Lucio Bianco, Massimiliano Caramia. A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time
272 -- 281Jinn-Shyong Yang, Jou-Ming Chang. Independent spanning trees on folded hyper-stars

Volume 56, Issue 3

159 -- 168Feodor F. Dragan, Chenyu Yan. Network flow spanners
169 -- 182Ivana Ljubic. A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
183 -- 187Ching-Chi Lin, Gerard J. Chang, Gen-Huey Chen. The degree-preserving spanning tree problem in strongly chordal and directed path graphs
188 -- 206César Rego, Tabitha James, Fred Glover. An ejection chain algorithm for the quadratic assignment problem
207 -- 214Fedor V. Fomin, Pinar Heggernes, Rodica Mihai. Mixed search number and linear-width of interval and split graphs
215 -- 227Stephen D. Boyles, S. Travis Waller. A mean-variance model for the minimum cost flow problem with stochastic arc costs

Volume 56, Issue 2

89 -- 0Bruce L. Golden, Douglas R. Shier. Editorial: 2008 Glover-Klingman prize winners
90 -- 94Kannan Balakrishnan, Bostjan Bresar, Matjaz Kovse, Manoj Changat, Ajitha R. Subhamathi, Sandi Klavzar. Simultaneous embeddings of graphs as median and antimedian subgraphs
95 -- 102Stéphane Bessy, Clément Lepelletier. Optical index of fault tolerant routings in WDM networks
103 -- 115Evangelos Kranakis, Michel Paquette, Andrzej Pelc. The diameter and connectivity of networks with random dependent faults
116 -- 130Jiong Guo, Rolf Niedermeier, Sebastian Wernicke. Fixed-parameter tractability results for full-degree spanning tree and its dual
131 -- 142Jiong Guo, Johannes Uhlmann. Kernelization and complexity results for connectivity augmentation problems
143 -- 148Yuqing Lin, Hongliang Lu, Yunjian Wu, Qinglin Yu. On superconnectivity of (4, ::::g::::)-cages with even girth
149 -- 157Satoshi Fujita. Polynomial time algorithm for constructing vertex-disjoint paths in transposition graphs

Volume 56, Issue 1

1 -- 10Christian Wulff-Nilsen. Bounding the expected number of rectilinear full Steiner trees
11 -- 19Shiying Wang, Jing Li, Lihong Wu, Shangwei Lin. Neighborhood conditions for graphs to be super restricted edge connected
20 -- 29Tingting Cui, Dorit S. Hochbaum. Complexity of some inverse shortest path lengths problems
30 -- 38Zhengbing Bian, Qian-Ping Gu. Wavelength assignment in multifiber star networks
39 -- 49Vangelis Th. Paschos, Orestis Telelis, Vassilis Zissimopoulos. Probabilistic models for the Steiner Tree problem
50 -- 69Angel Corberán, Christian Prins. Recent results on Arc Routing Problems: An annotated bibliography
70 -- 80John D. Lamb. Insertion heuristics for central cycle problems
81 -- 88Camino Balbuena, D. González-Moreno, Xavier Marcote. On the connectivity of semiregular cages