Networks, Volume 53

Volume 53, Number 1, January 2009

• J. Gómez:
  Some new large (delta, 3)-graphs. 1-5
  
• Mark W. Lewis:
  On the use of guided design search for discovering significant decision variables in the fixed-charge capacitated multicommodity network design problem. 6-18
  
• Mindaugas Bloznelis, Jerzy Jaworski, Katarzyna Rybarczyk:
  Component evolution in a secure wireless sensor network. 19-26
  
• Tiziana Calamoneri, Saverio Caminiti, Rossella Petreschi, Stephan Olariu:
  On the L(h, k)-labeling of co-comparability graphs and circular-arc graphs. 27-34
  
• Zhe Hou, Maiko Shigeno:
  New bounds on the minimum number of calls in failure-tolerant gossiping. 35-38
  
• Hung-Lung Wang, Bang Ye Wu, Kun-Mao Chao:
  The backup 2-center and backup 2-median problems on trees. 39-49
  
• Robert Benkoczi, Binay K. Bhattacharya, Arie Tamir:
  Collection depots facility location problems in trees. 50-62
  
• Dorit S. Hochbaum, Asaf Levin:
  The multi-integer set cover and the facility terminal cover problem. 63-66
  
• Archis Ghate, Robert L. Smith:
  A Hit-and-Run approach for generating scale invariant Small World networks. 67-78
  
• Alexander Grigoriev, Joyce van Loon, René Sitters, Marc Uetz:
  Optimal pricing of capacitated networks. 79-87
  

Volume 53, Number 2, March 2009

• Luis Gouveia:
  Preface. 89-90
  
• April K. Andreas, J. Cole Smith:
  Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network. 91-103
  
• Marcus Brazil, Doreen A. Thomas, Benny K. Nielsen, Pawel Winter, Christian Wulff-Nilsen, Martin Zachariasen:
  A novel approach to phylogenetic trees: d-Dimensional geometric Steiner trees. 104-111
  
• Daniele Catanzaro:
  The minimum evolution problem: Overview and classification. 112-125
  
• Daniele Catanzaro, Martine Labbé, Raffaele Pesenti, Juan José Salazar González:
  Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion. 126-140
  
• Alysson M. Costa, Jean-François Cordeau, Gilbert Laporte:
  Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints. 141-159
  
• John Dabney, Brian C. Dean, Stephen T. Hedetniemi:
  A linear-time algorithm for broadcast domination in a tree. 160-169
  
• Lúcia Maria de A. Drummond, Marcelo C. P. Santos, Eduardo Uchoa:
  A distributed dual ascent algorithm for Steiner problems in multicast routing. 170-183
  
• Wayne Goddard, Stephen T. Hedetniemi:
  A note on trees, tables, and algorithms. 184-190
  
• Ekkehard Köhler, Christian Liebchen, Gregor Wünsch, Romeo Rizzi:
  Lower bounds for strictly fundamental cycle bases in grid graphs. 191-205
  
• Renu C. Laskar, Gretchen L. Matthews, Beth Novick, John Villalpando:
  On irreducible no-hole L(2, 1)-coloring of trees. 206-211
  
• Kevin Prendergast, Doreen A. Thomas, Jia F. Weng:
  Optimum Steiner ratio for gradient-constrained networks connecting three points in 3-space, part I. 212-220
  
• Justo Puerto, Federica Ricca, Andrea Scozzari:
  The continuous and discrete path-variance problems on trees. 221-228
  

Volume 53, Number 3, May 2009

• Cenk Çaliskan:
  On a capacity scaling algorithm for the constrained maximum flow problem. 229-230
  
• Elif Akçali, Sila Çetinkaya, Halit Üster:
  Network design for reverse and closed-loop supply chains: An annotated bibliography of models and solution approaches. 231-248
  
• Hanif D. Sherali, Ahmed Ghoniem:
  Joint vehicle assembly-routing problems: An integrated modeling and optimization approach. 249-265
  
• Ralf Klasing, Adrian Kosowski, Alfredo Navarra:
  Cost minimization in wireless networks with a bounded and unbounded number of interfaces. 266-275
  
• Yong Wang, Qian-Ping Gu:
  Minimizing SONET Add-Drop Multiplexers in optical UPSR networks using the minimum number of wavelengths. 276-286
  
• Hovhannes A. Harutyunyan, Arthur L. Liestman, Bin Shao:
  A linear algorithm for finding the k-broadcast center of a tree. 287-292
  
• Michael O. Ball, Geir Dahl, Thomas Vossen:
  Matchings in connection with ground delay program planning. 293-306
  
• Ping-Ying Tsai, Gen-Huey Chen, Jung-Sheng Fu:
  Edge-fault-tolerant pancyclicity of alternating group graphs. 307-313
  

Volume 53, Number 4, July 2009

• Guillermo Pineda-Villavicencio, José Gómez, Mirka Miller, Hebert Pérez-Rosés:
  New largest known graphs of diameter 6. 315-328
  
• Xinmin Hou, Jun-Ming Xu, Min Xu:
  The forwarding indices of wrapped butterfly networks. 329-333
  
• Güvenç Sahin, Ravindra K. Ahuja:
  Lower bounding techniques for the degree-constrained network design problem. 334-344
  
• Harold N. Gabow, Michel X. Goemans, Éva Tardos, David P. Williamson:
  Approximating the smallest k-edge connected spanning subgraph by LP-rounding. 345-357
  
• Ranga Muhandiramge, Natashia Boland:
  Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem. 358-381
  
• Xujin Chen, Bo Chen:
  Cost-effective designs of fault-tolerant access networks in communication systems. 382-391
  
• Steve Alpern, Vic Baston, Shmuel Gal:
  Searching symmetric networks with Utilitarian-Postman paths. 392-402
  

Last update Wed Feb 15 05:40:42 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page