Discrete Applied Mathematics, Volume 92

Volume 92, Number 1, March 1999

• Claudio Arbib, Dario Pacciarelli, Stefano Smriglio:
  A Three-dimensional Matching Model for Perishable Production Scheduling. 1-15
  
• Luca G. Tallini, Ugo Vaccaro:
  Efficient m-ary Balanced Codes. 17-56
  
• Feng Tian, Bing Wei, Zhang Lei:
  Hamiltonicity in 3-domination-critical Graphs with alpha = delta + 2. 57-70
  
• Fuji Zhang, Li Huaien:
  On Acyclic Conjugated Molecules with Minimal Energies. 71-84
  
• Shutao Xia, Fangwei Fu:
  On the Average Hamming Distance for Binary Codes. 85-89
  

Volume 92, Number 2-3, June 1999

• Ulrik Brandes, Wolfram Schlickenrieder, Gabriele Neyer, Dorothea Wagner, Karsten Weihe:
  A Software Package of Algorithms and Heuristics for Disjoint Paths in Planar Networks. 91-110
  
• Alberto Caprara, Juan José Salazar González:
  Separating Lifted Odd-hole Inequalities to Solve the Index Selection Problem. 111-134
  
• Soo Y. Chang, Hark-Chin Hwang:
  The Worst-case Analysis of the MULTIFIT Algorithm for Scheduling Nonsimultaneous Parallel Machines. 135-147
  
• Hikoe Enomoto, Miki Shimabara Miyauchi, Katsuhiro Ota:
  Lower Bounds for the Number of Edge-crossings Over the Spine in a Topological Book Embedding of a Graph. 149-155
  
• Jeffrey C. Jackson, Eli Shamir, Clara Shwartzman:
  Learning with Queries Corrupted by Classification Noise. 157-175
  
• Raffaele Mosca:
  Stable Sets in Certain P₆-free Graphs. 177-191
  
• Mathieu Raffinot:
  Asymptotic Estimation of the Average Number of Terminal States in DAWGs. 193-203
  
• Jürgen Dassow, Gheorghe Paun:
  On the Regularity of Languages Generated by Context-free Evolutionary Grammars. 205-209
  
• Satoru Fujishige, Satoru Iwata:
  Minimizing a Submodular Function Arising From a Concave Function. 211-215
  
• Venkatesan Guruswami:
  Maximum Cut on Line and Total Graphs. 217-221
  
• Masahiro Miyakawa, Akihiro Nozaki, Grant Pogosyan, Ivo G. Rosenberg:
  A Map From the Lower-half of the n-cube Onto the (n-1)-cube Which Preserves Intersecting Antichains. 223-228
  
• Ján Plesník:
  Constrained Weighted Matchings and Edge Coverings in Graphs. 229-241
  
• René Sitters:
  A Short Proof of a Conjecture on the Tr-choice Number of Even Cycles. 243-246
  
• Gerhard J. Woeginger:
  Sensitivity Analysis for Knapsack Problems: Another Negative Result. 247-251