Discrete Applied Mathematics, Volume 55

Volume 55, Number 1, 1994

• Endre Boros, Peter L. Hammer, Xiaorong Sun:
  Recognition of q-Horn Formulae in Linear Time. 1-13
  
• Helen Cameron, Derick Wood:
  Maximal Path Length of Binary Trees. 15-35
  
• Rudi Penne:
  Isostatic Bar and Joint Frameworks in the Plane with Irreducible Pure Conditions. 37-57
  
• Sergey Vasil'evich Sevast'janov:
  on Some Geometric Methods in Scheduling Theory: A Survey. 59-82
  
• Gabriel Istrate, Gheorghe Paun:
  Some Combinatorial Properties of Self-reading Sequences. 83-86
  
• Stanislaw Krynski:
  Graphs in Which All Hamiltonian Cycles Have the Same Length. 87-89
  
• Abraham P. Punnen, Kunhiraman Nair:
  Improved Complexity Bound for the Maximum Cardinality Bottleneck Bipartite Matching Problem. 91-93
  

Volume 55, Number 2, 1994

• Amotz Bar-Noy, Shlomo Kipnis:
  Broadcasting Multiple Messages in Simultaneous Send/receive Systems. 95-105
  
• Dominique de Werra:
  on an optimization Problem occurring in FMSs: A Hypergraph-theoretical Formulation. 107-111
  
• Antoine Gautier, Frieda Granot:
  on the Equivalence of Constrained and Unconstrained Flows. 113-132
  
• Chính T. Hoàng:
  Efficient Algorithms for Minimum Weighted Colouring of Some Classes of Perfect Graphs. 133-143
  
• Antoon W. J. Kolen, A. H. G. Rinnooy Kan, C. P. M. van Hoesel, Albert P. M. Wagelmans:
  Sensitivity Analysis of List Scheduling Heuristics. 145-162
  
• Jon Lee, Walter D. Morris Jr.:
  Geometric Comparison of Combinatorial Polytopes. 163-182
  
• Hananya Yinnone:
  Maximum Number of Disjoint Paths Connecting Specified Terminals in a Graph. 183-195
  

Volume 55, Number 3, 1994

• Esther M. Arkin, Refael Hassin:
  Approximation Algorithms for the Geometric Covering Salesman Problem. 197-218
  
• Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger:
  Scheduling with Incompatible Jobs. 219-232
  
• Mao-cheng Cai:
  An Algorithm for an Eulerian Trail Traversing Specified Edges in Given order. 233-239
  
• Grant A. Cheston, Gerd Fricke:
  Classes of Graphs for Which Upper Fractional Domination Equals Independence, Upper Domination, and upper Irredundance. 241-258
  
• J. A. Hoogeveen, Steef L. van de Velde, Bart Veltman:
  Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations. 259-272
  
• Gilbert Laffond, Jean-François Laslier, Michel Le Breton:
  The Copeland Measure of Condorcet Choice Functions. 273-279
  
• Thierry Mautor, Catherine Roucairol:
  A New Exact Algorithm for the Solution of Quadratic Assignment Problems. 281-293
  
• Takao Nishizeki, Svatopluk Poljak:
  k-Connectivity and Decomposition of Graphs into Forests. 295-301