Discrete Applied Mathematics, Volume 148

Volume 148, Number 1, April 2005

• Christian Glaßer, Steffen Reith, Heribert Vollmer:
  The complexity of base station positioning in cellular networks. 1-12
  
• Jirí Fiala, Riste Skrekovski:
  Generalized list T-colorings of cycles. 13-25
  
• Therese C. Biedl, Timothy M. Chan, Yashar Ganjali, Mohammad Taghi Hajiaghayi, David R. Wood:
  Balanced vertex-orderings of graphs. 27-48
  
• Hark-Chin Hwang, Kangbok Lee, Soo Y. Chang:
  The effect of machine availability on the worst-case performance of LPT. 49-61
  
• Anis Gharbi, Mohamed Haouari:
  Optimal parallel machines scheduling with availability constraints. 63-87
  
• Keith Edwards, Graham Farr:
  On monochromatic component size for improper colourings. 89-105
  
• Thomas Erlebach, Klaus Jansen:
  Conversion of coloring algorithms into maximum weight independent set algorithms. 107-125
  
• Shuguang Li, Guojun Li, Shaoqiang Zhang:
  Minimizing makespan with release times on identical parallel batching machines. 127-134
  

Volume 148, Number 2, May 2005

• Juan Rada:
  Variation of the Wiener index under tree transformations. 135-146
  
• Baogang Xu, Lusheng Wang:
  Decomposing toroidal graphs into circuits and edges. 147-159
  
• Amr M. Youssef, Stafford E. Tavares:
  Affine equivalence in the AES round function. 161-170
  
• Han Hyuk Cho, Suh-Ryung Kim:
  A class of acyclic digraphs with interval competition graphs. 171-180
  
• Leah Epstein:
  Tight bounds for bandwidth allocation on two links. 181-188
  
• Therese C. Biedl, Timothy M. Chan:
  A note on 3D orthogonal graph drawing. 189-193
  

Volume 148, Number 3, June 2005

• Francine Blanchet-Sadri:
  Primitive partial words. 195-213
  
• Stephen J. Willson:
  Consistent formulas for estimating the total lengths of trees. 214-239
  

• Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, David Schindl:
  A solvable case of image reconstruction in discrete tomography. 240-245
  
• Luis Hernández Encinas, Ángel Martín del Rey, Jaime Muñoz Masqué:
  Faa` di Bruno's formula, lattices, and partitions. 246-255
  
• Alastair Farrugia:
  Orientable convexity, geodetic and hull numbers in graphs. 256-262
  
• Joan P. Hutchinson:
  A note on rectilinear and polar visibility graphs. 263-272
  
• Frank K. Hwang:
  A competitive algorithm to find all defective edges in a graph. 273-277
  

Last update Wed Feb 15 05:30:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page