Journal: Networks

Volume 45, Issue 4

181 -- 192Fatma Gzara, Jean-Louis Goffin. Exact solution of the centralized network design problem on directed graphs
193 -- 194Yingjie Wang, Jianhua Li, Ling Tie. A simple protocol for deniable authentication based on ElGamal cryptography
195 -- 198Patrizia Beraldi, Gianpaolo Ghiani, Gilbert Laporte, Roberto Musmanno. Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem
199 -- 209Belén Melián-Batista, Manuel Laguna, José A. Moreno-Pérez. Minimizing the cost of placing and sizing wavelength division multiplexing and optical crossconnect equipment in a telecommunications network
210 -- 213Nawarat Ananchuen, Michael D. Plummer. Matchings in 3-vertex-critical graphs: The even case
214 -- 217Yana Kortsarts, Guy Kortsarz, Zeev Nutov. Greedy approximation algorithms for directed multicuts
218 -- 223Fu-Hsing Wang, Cheng-Ju Hsu, Jen-Chih Tsai. Minimal feedback vertex sets in directed split-stars
224 -- 231Jae-Hoon Kim, Kyung-Yong Chwa. Optimal broadcasting with universal lists based on competitive analysis
232 -- 239Toshihide Ibaraki, Yann Vaxès, Xiao-guang Yang. Lowering eccentricity of a tree by node upgrading

Volume 45, Issue 3

113 -- 118Camino Balbuena, Xavier Marcote, Pedro García-Vázquez. On restricted connectivities of permutation graphs
119 -- 124Andreas Baltz, Gerold Jäger, Anand Srivastav. Constructions of sparse asymmetric connectors with number theoretic methods
125 -- 142Alberto Ceselli, Giovanni Righini. A branch-and-price algorithm for the capacitated ::::p::::-median problem
143 -- 164Zevi Miller, Dan Pritikin, Manley Perkel, Ivan Hal Sudborough. The sequential sum problem and performance bounds on the greedy algorithm for the on-line Steiner problem
165 -- 168Jason I. Brown, Xiaohu Li. The strongly connected reliability of complete digraphs
169 -- 179Wei Shi, Abdelmadjid Bouabdallah, Pradip K. Srimani. Leader election in oriented star graphs

Volume 45, Issue 2

49 -- 54Camino Balbuena, Xavier Marcote, Daniela Ferrero. Diameter vulnerability of iterated line digraphs in terms of the girth
55 -- 60Illya V. Hicks. Graphs, branchwidth, and tangles! Oh my!
61 -- 79Thomas L. Magnanti, S. Raghavan. Strong formulations for network design problems with connectivity requirements
80 -- 87Xavier Marcote, Camino Balbuena, Josep Fàbrega. Connectedness of digraphs and graphs under constraints on the conditional diameter
88 -- 94Jian-Hua Yin, Jiong-Sheng Li, Guo-Liang Chen, Cheng Zhong. On the fault-tolerant diameter and wide diameter of omega-connected graphs
95 -- 103Iris Gaber, Michal Parnas. All-port line broadcasting in highly connected graphs
104 -- 111Paola Cappanera, Maria Grazia Scutellà. Balanced paths in acyclic networks: Tractable cases and related approaches

Volume 45, Issue 1

1 -- 3Antonio Sedeño-Noda, Carlos González-Martín, Sergio Alonso. Solving the undirected minimum cost flow problem with arbitrary costs
4 -- 8Frank K. Hwang, Binwu Zhang. Strict nonblockingness of reduced shuffle-exchange networks
9 -- 22Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Andrea Vitaletti, Suhas N. Diggavi, S. Muthukrishnan, Thyagarajan Nandagopal. Parallel scheduling problems in next generation wireless networks
23 -- 35Carme Àlvarez, Maria J. Blesa, Josep Díaz, Maria J. Serna, Antonio Fernández. Adversarial models for priority-based networks
36 -- 41Ravindra K. Ahuja, Horst W. Hamacher. A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy
42 -- 48Yingyu Wan, Weifa Liang. On the minimum number of wavelengths in multicast trees in WDM networks