Discrete Applied Mathematics

Editorial Board
pp. v-vii(3)

Contents
pp. ix-x(2)

Preface
pp. 159-160(2)
Authors: Faigle U.; Pickl S.; Broersma H.; Hurink J.

Making a tournament k-arc-strong by reversing or deorienting arcs
pp. 161-171(11)
Authors: Bang-Jensen J.; Yeo A.

Sparsest cuts and concurrent flows in product graphs
pp. 173-182(10)
Author: Bonsma P.

On treewidth approximations
pp. 183-196(14)
Authors: Bouchitte V.; Kratsch D.; Muller H.; Todinca I.

A linear algorithm for the Hamiltonian completion number of the line graph of a cactus
pp. 197-215(19)
Authors: Detti P.; Meloni C.

Complexity results on a paint shop problem
pp. 217-226(10)
Authors: Epping T.; Hochstattler W.; Oertel P.

Divider-based algorithms for hierarchical tree partitioning
pp. 227-247(21)
Authors: Finocchi I.; Petreschi R.

On approximability of linear ordering and related NP-optimization problems on graphs
pp. 249-269(21)
Authors: Mishra S.; Sikdar K.

Delay-related secondary objectives for rectilinear Steiner minimum trees
pp. 271-298(28)
Authors: Peyer S.; Zachariasen M.; Grove Jorgensen D.

3-Colorability &unknown;P for P₆-free graphs
pp. 299-313(15)
Authors: Randerath B.; Schiermeyer I.

Edge-oblique polyhedral graphs
pp. 315-327(13)
Authors: Schreyer J.; Walther H.

A fully dynamic algorithm for modular decomposition and recognition of cographs
pp. 329-340(12)
Authors: Shamir R.; Sharan R.

Solving problems for maximal reducible flowgraphs
pp. 341-348(8)
Authors: Vernet O.; Markenzon L.

Families of integral trees with diameters 4, 6, and 8
pp. 349-362(14)
Authors: Wang L.; Li X.; Zhang S.

Approximation algorithms for the watchman route and zookeeper's problems
pp. 363-376(14)
Author: Tan X.

The obnoxious center problem on weighted cactus graphs
pp. 377-386(10)
Authors: Zmazek B.; Zerovnik J.

Author index to volume
pp. 387-388(2)