Discrete Applied Mathematics, Volume 157

Volume 157, Number 1, January 2009

• Jun Yan, Jun-Ming Xu, Chao Yang:
  Forwarding index of cube-connected cycles. 1-7
  Electronic Edition (link) BibTeX
• Yaojun Chen, T. C. Edwin Cheng, Ran Xu:
  The Ramsey number for a cycle of length six versus a clique of order eight. 8-12
  Electronic Edition (link) BibTeX
• Dániel Marx, Marcus Schaefer:
  The complexity of nonrepetitive coloring. 13-18
  Electronic Edition (link) BibTeX
• Frédéric Gardi:
  Mutual exclusion scheduling with interval graphs or related classes, Part I. 19-35
  Electronic Edition (link) BibTeX
• Lali Barrière, Francesc Comellas, Cristina Dalfó, Miguel Angel Fiol:
  The hierarchical product of graphs. 36-48
  Electronic Edition (link) BibTeX
• Chase Rainwater, Joseph Geunes, H. Edwin Romeijn:
  The generalized assignment problem with flexible jobs. 49-67
  Electronic Edition (link) BibTeX
• Alexandre Dolgui, I. Ihnatsenka:
  Balancing modular transfer lines with serial-parallel activation of spindle heads at stations. 68-89
  Electronic Edition (link) BibTeX
• Aubin Jarry, Stéphane Pérennes:
  Disjoint paths in symmetric digraphs. 90-97
  Electronic Edition (link) BibTeX
• Michele Flammini, Alfredo Navarra:
  Layouts for mobility management in wireless ATM networks. 98-111
  Electronic Edition (link) BibTeX
• Zeev Nutov:
  Listing minimal edge-covers of intersecting families with applications to connectivity problems. 112-117
  Electronic Edition (link) BibTeX
• Xujin Chen, Guoli Ding, Wenan Zang:
  The box-TDI system associated with 2-edge connected spanning subgraphs. 118-125
  Electronic Edition (link) BibTeX
• Robert Elsässer, Ulf Lorenz, Thomas Sauerwald:
  On randomized broadcasting in Star graphs. 126-139
  Electronic Edition (link) BibTeX
• Ji-Cherng Lin, Ming-Yi Chiu:
  Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model. 140-148
  Electronic Edition (link) BibTeX
• Chandan K. Dubey, Shashank K. Mehta:
  Critically indecomposable graphs. 149-163
  Electronic Edition (link) BibTeX
• F. H. Chang, Hung-Lin Fu, Frank K. Hwang, B. C. Lin:
  The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks. 164-169
  Electronic Edition (link) BibTeX
• Jun-Yo Chen, Ko-Wei Lih, Jiaojiao Wu:
  Coloring the square of the Kneser graph I and the Schrijver graph I. 170-176
  Electronic Edition (link) BibTeX
• Henning Fernau, Juan A. Rodríguez, Jose Maria Sigarreta:
  Offensive r-alliances in graphs. 177-182
  Electronic Edition (link) BibTeX
• André R. S. Amaral:
  A new lower bound for the single row facility layout problem. 183-190
  Electronic Edition (link) BibTeX
• Qizhong Lin, Yusheng Li:
  On Ramsey numbers of fans. 191-194
  Electronic Edition (link) BibTeX
• Weigen Yan, Yeong-Nan Yeh:
  On the matching polynomial of subdivision graphs. 195-200
  Electronic Edition (link) BibTeX

Volume 157, Number 2, January 2009

• Mark H. Siggers:
  Dichotomy for bounded degree H-colouring. 201-210
  Electronic Edition (link) BibTeX
• Juan Alberto Rodríguez-Velazquez, Jose Maria Sigarreta:
  Global defensive k-alliances in graphs. 211-218
  Electronic Edition (link) BibTeX
• Jose Maria Sigarreta, Juan Alberto Rodríguez-Velazquez:
  On the global offensive alliance number of a graph. 219-226
  Electronic Edition (link) BibTeX
• Hans-Jürgen Bandelt, Arne Röhl:
  Quasi-median hulls in Hamming space are Steiner hulls. 227-233
  Electronic Edition (link) BibTeX
• Ersoy Subasi, Munevver Mine Subasi, András Prékopa:
  On strong unimodality of multivariate discrete distributions. 234-246
  Electronic Edition (link) BibTeX
• Robin Nunkesser, Philipp Woelfel:
  Representation of graphs by OBDDs. 247-261
  Electronic Edition (link) BibTeX
• T. C. Edwin Cheng, Liying Kang, Erfang Shan:
  A polynomial-time algorithm for the paired-domination problem on permutation graphs. 262-271
  Electronic Edition (link) BibTeX
• Cristina G. Fernandes, Orlando Lee, Yoshiko Wakabayashi:
  Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width. 272-279
  Electronic Edition (link) BibTeX
• Claire Hanen, Alix Munier Kordon:
  Periodic schedules for linear precedence constraints. 280-291
  Electronic Edition (link) BibTeX
• Dong Ye, Heping Zhang:
  2-extendability of toroidal polyhexes and Klein-bottle polyhexes. 292-299
  Electronic Edition (link) BibTeX
• Lavanya Kannan, Arthur M. Hobbs, Hong-Jian Lai, Hongyuan Lai:
  Transforming a graph into a 1-balanced graph. 300-308
  Electronic Edition (link) BibTeX
• Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters:
  Highly connected random geometric graphs. 309-320
  Electronic Edition (link) BibTeX
• Adrian Kosowski:
  Forwarding and optical indices of a graph. 321-329
  Electronic Edition (link) BibTeX
• Renu Laskar, Jeremy Lyle:
  Fall colouring of bipartite graphs and cartesian products of graphs. 330-338
  Electronic Edition (link) BibTeX
• Vladimir Kats, Eugene Levner:
  A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case. 339-355
  Electronic Edition (link) BibTeX
• M. Esmaeili, A. Zaghian:
  On the combinatorial structure of a class of I shortened Hamming codes and their dual-codes. 356-363
  Electronic Edition (link) BibTeX
• Andrei Tchernykh, Denis Trystram, Carlos A. Brizuela, Isaac D. Scherson:
  Idle regulation in non-clairvoyant scheduling of parallel jobs. 364-376
  Electronic Edition (link) BibTeX
• Robert E. L. Aldred, Dries Van Dyck, Gunnar Brinkmann, Veerle Fack, Brendan D. McKay:
  Graph structural properties of non-Yutsis graphs allowing fast recognition. 377-386
  Electronic Edition (link) BibTeX
• Hong-Bin Chen, Yongxi Cheng, Qian He, Chongchong Zhong:
  Transforming an error-tolerant separable matrix to an error-tolerant disjunct matrix. 387-390
  Electronic Edition (link) BibTeX
• Jianping Ou:
  On extremal unicyclic molecular graphs with maximal Hosoya index. 391-397
  Electronic Edition (link) BibTeX
• Shinya Fujita, Ken-ichi Kawarabayashi:
  Note on non-separating and removable cycles in highly connected graphs. 398-399
  Electronic Edition (link) BibTeX
• S. Jahanbekam:
  A comment to: Two classes of edge domination in graphs. 400-401
  Electronic Edition (link) BibTeX
• M. Basu, Md. M. Rahaman, S. Bagchi:
  On a new code, [2ⁿ-1, n, 2^n-1]. 402-405
  Electronic Edition (link) BibTeX
• Frédéric Giroire:
  Order statistics and estimating cardinalities of massive data sets. 406-427
  Electronic Edition (link) BibTeX
• Hyeonjin Kim, Sung-Mo Park, Sang Geun Hahn:
  On the weight and nonlinearity of homogeneous rotation symmetric Boolean functions of degree 2. 428-432
  Electronic Edition (link) BibTeX
• Wei Dong, Baogang Xu:
  A note on list improper coloring of plane graphs. 433-436
  Electronic Edition (link) BibTeX

Volume 157, Number 3, February 2009

• László G. Nyúl, Kálmán Palágyi:
  Preface. 437
  Electronic Edition (link) BibTeX
• Kees Joost Batenburg, Jan Sijbers:
  Generic iterative subset algorithms for discrete tomography. 438-451
  Electronic Edition (link) BibTeX
• Valentin E. Brimkov:
  Formulas for the number of (n-2)-gaps of binary objects in arbitrary dimension. 452-463
  Electronic Edition (link) BibTeX
• Srecko Brlek, Xavier Provençal, Jean-Marc Fedou:
  On the tiling by translation problem. 464-475
  Electronic Edition (link) BibTeX
• Martine Dexet, Eric Andres:
  A generalized preimage for the digital analytical hyperplane recognition. 476-489
  Electronic Edition (link) BibTeX
• Rocío González-Díaz, María José Jiménez, Belén Medrano, Pedro Real:
  Chain homotopies for object topological representations. 490-499
  Electronic Edition (link) BibTeX
• Damien Jamet, Jean-Luc Toutant:
  Minimal arithmetic thickness connecting discrete planes. 500-509
  Electronic Edition (link) BibTeX
• Gaëlle Largeteau-Skapin, Eric Andres:
  Discrete-Euclidean operations. 510-523
  Electronic Edition (link) BibTeX
• Hans Meine, Ullrich Köthe, Peer Stelldinger:
  A topological sampling theorem for Robust boundary reconstruction and image segmentation. 524-541
  Electronic Edition (link) BibTeX
• Samuel Peltier, Laurent Fuchs, Pascal Lienhardt:
  Simploidals sets: Definitions, operations and comparison with simplicial sets. 542-557
  Electronic Edition (link) BibTeX
• Isabelle Sivignon, David Coeurjolly:
  Minimum decomposition of a digital surface into digital plane segments is NP-hard. 558-570
  Electronic Edition (link) BibTeX
• Peter Veelaert, Kristof Teelen:
  Feature controlled adaptive difference operators. 571-582
  Electronic Edition (link) BibTeX