Volume 59, Number 1, January 2012

Special Issue on the INOC 2009 Conference, April 26-29, 2009, Pisa, Italy

• 
  Luis Gouveia, Maria Grazia Scutellà: Editorial. 1-2
• 
  Pablo Adasme, Abdel Lisser, Ismael Soto: A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access. 3-12
• 
  Shinji Imahori, Yuichiro Miyamoto, Hideki Hashimoto, Yusuke Kobayashi, Mihiro Sasaki, Mutsunori Yagiura: The complexity of the node capacitated in-tree packing problem. 13-21
• 
  Edward Bortnikov, Samir Khuller, Jian Li, Yishay Mansour, Joseph Naor: The load-distance balancing problem. 22-29
• 
  Walid Ben-Ameur, Mohamed Didi Biha: On the minimum cut separator problem. 30-36
• 
  Pierre Fouilhoux, Oya Ekin Karasan, Ali Ridha Mahjoub, Onur Özkök, Hande Yaman: Survivability in hierarchical telecommunications networks. 37-58
• 
  Olivier Klopfenstein, Dritan Nace: Cover inequalities for robust knapsack sets - Application to the robust bandwidth packing problem. 59-72
• 
  Friedrich Pukelsheim, Federica Ricca, Bruno Simeone, Andrea Scozzari, Paolo Serafini: Network flow methods for electoral systems. 73-88
• 
  Ivana Ljubic, Peter Putz, Juan José Salazar González: Exact approaches to the single-source network loading problem. 89-106
• 
  Stefanie Kosuch, Pierre Le Bodic, Janny Leung, Abdel Lisser: On a stochastic bilevel programming problem. 107-116
• 
  Jordi Castro, Jordi Cuesta: Improving an interior-point algorithm for multicommodity flows by quadratic regularizations. 117-131
• 
  Sebastian Orlowski, Michal Pióro: Complexity of column generation in network design with path-based survivability mechanisms. 132-147
• 
  Eduardo Uchoa, Túlio A. M. Toffolo, Maurício C. de Souza, Alexandre Xavier Martins, Ricardo Fukasawa: Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem. 148-160
• 
  Bernardetta Addis, Giuliana Carello, Alberto Ceselli: Exactly solving a two-level location problem with modular node capacities. 161-180
• 
  Christina Büsing: Recoverable robust shortest path problems. 181-189

Volume 59, Number 2, March 2012

• 
  Paolo Serafini, Bruno Simeone: Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment. 191-208
• 
  Viswanath Nagarajan, R. Ravi: Approximation algorithms for distance constrained vehicle routing problems. 209-214
• 
  Darko Skorin-Kapov, Jadranka Skorin-Kapov: A note on Steiner tree games. 215-225
• 
  Babacar Thiongane: Lagrangean decomposition/relaxation for the routing and wavelength assignment problem. 226-239
• 
  Giacomo Nannicini, Daniel Delling, Dominik Schultes, Leo Liberti: Bidirectional A* search on time-dependent road networks. 240-251
• 
  Carol A. Meyers, Andreas S. Schulz: The complexity of welfare maximization in congestion games. 252-260
• 
  Peteris Daugulis: A note on a generalization of eigenvector centrality for bipartite graphs and applications. 261-264

Volume 59, Number 3, May 2012

In Honor of Rossella Petreschi

• 
  Tiziana Calamoneri, Irene Finocchi: Editorial: Preface to the special issue. 265-266
• 
  Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati: Succinct greedy drawings do not always exist. 267-274
• 
  Giorgio Ausiello, Donatella Firmani, Luigi Laura: Real-time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components. 275-288
• 
  Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri: Optimal gossiping in geometric radio networks in the presence of dynamical faults. 289-298
• 
  Sajal K. Das, Giacomo Ghidini, Alfredo Navarra, Maria Cristina Pinotti: Localization and scheduling protocols for actor-centric sensor networks. 299-319
• 
  Raymond Greenlaw, Sanpawat Kantabutra, Pattama Longani: A mobility model for studying wireless communication and the complexity of problems in the model. 320-330
• 
  Andrzej Pelc: Deterministic rendezvous in networks: A comprehensive survey. 331-347

Volume 59, Number 4, July 2012

• 
  Eddie Cheng, Philip Hu, Roger Jia, László Lipták: Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions. 349-356
• 
  Eddie Cheng, Philip Hu, Roger Jia, László Lipták: Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars. 357-364
• 
  Ioannis Gamvros, Luis Gouveia, S. Raghavan: Reload cost trees and network design. 365-379
• 
  Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking: Computing approximate Nash equilibria in network congestion games. 380-386
• 
  Charles Bordenave, Michel Gendreau, Gilbert Laporte: A branch-and-cut algorithm for the preemptive swapping problem. 387-399
• 
  Douglas S. Altner, J. Paul Brooks: Coverings and matchings in r-partite hypergraphs. 400-410