Discrete Applied Mathematics, Volume 158

Volume 158, Number 1, January 2010

• Sarah Spence Adams, Alex Trazkovich, Denise Sakai Troxell, Bradford Westgate:
  On island sequences of labelings with a condition at distance two. 1-7
  
• Gerard J. Chang, Jiaojiao Wu, Xuding Zhu:
  Rainbow domination on trees. 8-12
  
• Guoli Ding, Robert F. Lax, Jianhua Chen, Peter P. Chen, Brian D. Marx:
  Transforms of pseudo-Boolean random variables. 13-24
  
• Emma Y. Jin, Christian M. Reidys:
  RNA pseudoknot structures with arc-length >=3 and stack-length >=sigma. 25-36
  
• Zhaohong Niu, Liming Xiong:
  Supereulerianity of k-edge-connected graphs with a restriction on small bonds. 37-43
  
• Ricardo Riaza, Alfonso J. Encinas:
  Augmented nodal matrices and normal trees. 44-61
  
• Yonghong Xiang, Iain A. Stewart:
  One-to-many node-disjoint paths in (n, k)-star graphs. 62-70
  

• Elisabeth Gassner, Johannes Hatzl, Sven Oliver Krumke, Sleman Saliba:
  clever or smart: Strategies for the online target date assignment problem. 71-79
  

Volume 158, Number 2, January 2010

• Endre Boros, Ondrej Cepek, Alexander Kogan, Petr Kucera:
  Exclusive and essential sets of implicates of Boolean functions. 81-96
  
• Sylvain Boussier, Michel Vasquez, Yannick Vimont, Saïd Hanafi, Philippe Michelon:
  A multi-level search strategy for the 0-1 Multidimensional Knapsack Problem. 97-109
  
• Andreas Brandstädt, Peter Wagner:
  Characterising (k, l)-leaf powers. 110-122
  
• Dirk Briskorn, Sigrid Knust:
  Constructing fair sports league schedules with regard to strength groups. 123-135
  
• Nicholas J. Cavenagh, Ian M. Wanless:
  On the number of transversals in Cayley tables of cyclic groups. 136-146
  
• Michael A. Henning, Lucas C. van der Merwe:
  Properties of total domination edge-critical graphs. 147-153
  

• Akira Kamibeppu:
  An upper bound for the competition numbers of graphs. 154-157
  

Volume 158, Number 3, February 2010

• Christian Bachmaier, Hedi Buchner, Michael Forster, Seok-Hee Hong:
  Crossing minimization in extended level drawings of graphs. 159-179
  
• Jesús Mario Bilbao, M. Ordóñez:
  The core and the Weber set of games on augmenting systems. 180-188
  
• Michael Ferrara, Michael Jacobson, Angela Harris:
  The game of F-saturator. 189-197
  
• Ioan Tomescu, Syed Ahtsham Ul Haq Bokhary:
  Series-parallel chromatic hypergraphs. 198-203
  
• Zhongxun Zhu, Shuchao Li, Liansheng Tan:
  Tricyclic graphs with maximum Merrifield-Simmons index. 204-212
  

• M. Atapour, Seyed Mahmoud Sheikholeslami, A. N. Ghameshlou, Lutz Volkmann:
  Signed star domatic number of a graph. 213-218
  
• Ali Behtoei, Mohsen Jannesari, Bijan Taeri:
  A characterization of block graphs. 219-221
  
• Malte Fliedner, Nils Boysen, Armin Scholl:
  Solving symmetric mixed-model multi-level just-in-time scheduling problems. 222-231
  
• Hossein Hajiabolhassan:
  On the b-chromatic number of Kneser graphs. 232-234
  

• Kyungsik Lee:
  Integral polyhedra related to integer multicommodity flows on a cycle. 235-238
  

Volume 158, Number 4, February 2010

• Ulrich Faigle, Johann Hurink:
  Cologne/Twente workshop on graphs and combinatorial optimization CTW 2007. 239
  
• Deepak Ajwani, Tobias Friedrich:
  Average-case analysis of incremental topological ordering. 240-250
  
• Stephan Dominique Andres:
  Directed defective asymmetric graph coloring games. 251-260
  
• Paul S. Bonsma:
  Most balanced minimum cuts. 261-276
  
• Florentine Bunke, Horst W. Hamacher, Francesco Maffioli, Anne M. Schwahn:
  Minimum cut bases in undirected networks. 277-290
  
• Dimitri Drapkin, Rüdiger Schultz:
  An algorithm for stochastic programs with first-order dominance constraints induced by linear recourse. 291-297
  
• Birgit Engels:
  The Transitive Minimum Manhattan Subnetwork Problem in 3 dimensions. 298-307
  
• Henning Fernau:
  minimum dominating set of queens: A trivial programming exercise? 308-318
  
• Gregory Gutin, Eun Jung Kim:
  The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops. 319-330
  
• Ruijuan Li, Shengjia Li, Yubao Guo:
  Degree conditions on distance 2 vertices that imply k-ordered Hamiltonian. 331-339
  
• Shengjia Li, Wei Meng, Yubao Guo:
  Three supplements to Reid's theorem in multipartite tournaments. 340-348
  
• Isabel Méndez-Díaz, Paula Zabala:
  Solving a multicoloring problem with overlaps using integer programming. 349-354
  
• Carla Silva Oliveira, Leonardo Silva de Lima, Nair Maria Maia de Abreu, Pierre Hansen:
  Bounds on the index of the signless Laplacian of a graph. 355-360
  
• Joachim Spoerhase, Hans-Christoph Wirth:
  Relaxed voting and competitive location under monotonous gain functions on trees. 361-373