Discrete Applied Mathematics, Volume 70

Volume 70, Number 1, September 1996

• Pavol Hell, David G. Kirkpatrick, Brenda Li:
  Rounding in Symmetric Matrices and Undirected Graphs. 1-21
  
• Pavol Hell, Jaroslav Nesetril, Xuding Zhu:
  Complexity of Tree Homomorphisms. 23-36
  
• Johann Hurink:
  Polygon Scheduling. 37-55
  
• Gheorghe Paun:
  On the Splicing Operation. 57-79
  
• Chen Zhi-Long:
  Parallel Machine Scheduling with Time Dependent Processing Times. 81-93
  

Volume 70, Number 2, September 1996

• Rainer E. Burkard, Bettina Klinz, Rüdiger Rudolf:
  Perspectives of Monge Properties in Optimization. 95-161
  
• Tuvi Etzion, Sara Bitan:
  On the Chromatic Number, Colorings, and Codes of the Johnson Graph. 163-175
  
• Zbigniew Lonc:
  On the Complexity of Some Edge-partition Problems for Graphs. 177-183
  

Volume 70, Number 3, October 1996

• D. T. Lee, Chung-Do Yang, C. K. Wong:
  Rectilinear Paths Among Rectilinear Obstacles. 185-215
  
• Samir Khuller, Balaji Raghavachari, Azriel Rosenfeld:
  Landmarks in Graphs. 217-229
  
• T. C. Edwin Cheng, Mikhail Y. Kovalyov:
  Batch Scheduling and Common Due-date Assignment on a Single Machine. 231-245
  
• Lucian Finta, Zhen Liu:
  Single Machine Scheduling Subject To Precedence Delays. 247-266
  
• Frieda Granot, Michal Penn:
  Polynomial Algorithms for (integral) Maximum Two-flows in Vertex Edge-capacitated Planar Graphs. 267-283