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