▶ A note on the upper bound for the paired-domination number of a graph with minimum degree at least two (pages 115–116) Shenwei Huang and Erfang Shan Abstract
▶ Stackelberg network pricing is hard to approximate (pages 117–120) Gwenaë Joret
Abstract
▶ Constructions of small regular bipartite graphs of girth 6 (pages 121–127) G. Araujo-Pardo and Camino Balbuena Abstract
▶ Single-vehicle scheduling problems with release and service times on a line (pages 128–134) , Wei Yu and Zhaohui Liu Abstract
▶ A minimum cost flow formulation for approximated MLC segmentation (pages 135–140) Thomas Kalinowski, Abstract
▶ On cut-based inequalities for capacitated network design polyhedra (pages 141–156) Christian Raack, Arie M.C.A. Koster, Sebastian Orlowski and Roland Wess
l Abstract
▶ Nonadaptive broadcasting in trees (pages 157–168) Hovhannes A. Harutyunyan, Arthur L. Liestman, Kazuhisa Makino and Thomas C. Shermer Abstract
▶ Earliest arrival flows on series-parallel graphs (pages 169–173) Stefan Ruzika, Heike Sperber and Mechthild Steine, Abstract
▶ On terminal delta-wye reducibility of planar graphs (pages 174–186) Isidoro Gitler and Feliú Sagols Abstract
▶ Optimal online ring routing (pages 187–197) Jessen T. Havill and Kevin R. Hutson Abstract