Discrete Applied Mathematics, Volume 146

Volume 146, Number 1, February 2005

• George Steiner, Zhihui Xue:
  The maximum traveling salesman problem on van der Veen matrices. 1-2
  
• Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos:
  A hypocoloring model for batch scheduling. 3-26
  
• Cristina Bazgan, Refael Hassin, Jérôme Monnot:
  Approximation algorithms for some vehicle routing problems. 27-42
  
• Igor Dolinka:
  A note on identities of two-dimensional languages. 43-50
  
• Andreas W. M. Dress, Barbara Holland, Katharina T. Huber, Jack H. Koolen, Vincent Moulton, Jan Weyer-Menkhoff:
  Delta additive and Delta ultra-additive maps, Gromov's trees, and the Farris transform. 51-73
  
• Vadim V. Lozin, Raffaele Mosca:
  Independent sets in extensions of 2K₂-free graphs. 74-80
  
• Anna Palbom:
  Complexity of the directed spanning cactus problem. 81-91
  
• John P. Georges, David W. Mauro:
  A note on collections of graphs with non-surjective lambda labelings. 92-98
  
• Amine El Sahili:
  A characterization problem on underlying graphs of line digraphs. 99-101
  
• Sheng-Liang Yang:
  On the LU factorization of the Vandermonde matrix. 102-105
  
• Sylvie Corteel, Mario Valencia-Pabon, Juan Carlos Vera:
  On approximating the b-chromatic number. 106-110
  
• Erzsébet Csuhaj-Varjú, Jürgen Dassow:
  A remark on evolutionary systems. 111-115
  

Volume 146, Number 2, March 2005

• Amihood Amir, Gad M. Landau:
  Foreword. 123
  
• Gary Benson:
  Tandem cyclic alignment. 124-133
  
• Anne Bergeron:
  A very elementary presentation of the Hannenhalli-Pevzner theory. 134-145
  
• Aviezri S. Fraenkel, Jamie Simpson:
  An extension of the periodicity lemma to longer periods. 146-155
  
• Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi:
  On-line construction of compact directed acyclic word graphs. 156-179
  
• Shmuel Tomi Klein, Yair Wiseman:
  Parallel Lempel Ziv coding. 180-191
  

Volume 146, Number 3, March 2005

• Daniel Meister:
  Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs. 193-218
  
• Shun-Shii Lin, Chung-Liang Wei:
  Optimal algorithms for constructing knight's tours on arbitrary n?m chessboards. 219-232
  
• Derek E. Armstrong, Sheldon H. Jacobson:
  Data-independent neighborhood functions and strict local optima. 233-243
  
• Jørgen Bang-Jensen, Morten Hegner Nielsen:
  Finding complementary cycles in locally semicomplete digraphs. 245-256
  
• Gary Chartrand, Ladislav Nebesky, Ping Zhang:
  Hamiltonian colorings of graphs. 257-272
  
• Hanif D. Sherali, Jonathan Cole Smith:
  A class of web-based facets for the generalized vertex packing problem. 273-286
  
• Wieslaw Kubiak:
  Minimization of ordered, symmetric half-products. 287-300
  
• Peter Leupold, Carlos Martín-Vide, Victor Mitrana:
  Uniformly bounded duplication languages. 301-310
  
• Toshinori Yamada, Takashi Ohtsuka, Akitsugu Watanabe, Shuichi Ueno:
  On sequential diagnosis of multiprocessor systems. 311-342
  
• V. Yugandhar, Sanjeev Saxena:
  Parallel algorithms for separable permutations. 343-364