Preface on CTW 2006 Ulrich FaigleRainer SchraderRüdiger Schultz Preface 18 September 2008 Pages: 203 - 204
Edge-swapping algorithms for the minimum fundamental cycle basis problem Edoardo AmaldiLeo LibertiNelson Maculan Original Article 21 October 2008 Pages: 205 - 233
Partial characterizations of coordinated graphs: line graphs and complements of forests Flavia BonomoGuillermo DuránGabriel Sueiro Original Article 13 September 2008 Pages: 251 - 270
A dynamic programming algorithm for the single-machine scheduling problem with release dates and deteriorating processing times Alberto BosioGiovanni Righini Original Article 20 September 2008 Pages: 271 - 280
A minimization version of a directed subgraph homeomorphism problem Janina A. BrennerSándor P. FeketeJan C. van der Veen Original Article 20 September 2008 Pages: 281 - 296
On hamiltonicity of P 3-dominated graphs H. J. BroersmaE. Vumar Original Article 18 September 2008 Pages: 297 - 306
L(h, 1, 1)-labeling of outerplanar graphs Tiziana CalamoneriEmanuele G. FuscoPaola Vocca Original Article 03 December 2008 Pages: 307 - 321
A two-stage model for a day-ahead paratransit planning problem Maria L. A. G. CremersWillem K. Klein HaneveldMaarten H. van der Vlerk Original Article Open access 20 September 2008 Pages: 323 - 341
Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs Jinfeng Feng Original Article 19 September 2008 Pages: 343 - 352
Risk neutral and risk averse power optimization in electricity networks with dispersed generation Sebastian KuhnRüdiger Schultz Original Article 26 September 2008 Pages: 353 - 367
A remark on degree sequences of multigraphs Dirk MeierlingLutz Volkmann Original Article 18 September 2008 Pages: 369 - 374