Discrete Applied Mathematics, Volume 61

Volume 61, Number 1, 1995

• Martin Anthony, Graham Brightwell, John Shawe-Taylor:
  On Specifying Boolean Functions by Labelled Examples. 1-25
  
• Sunil Chopra, M. R. Rao:
  Facets of the K-partition Polytope. 27-48
  
• Michel X. Goemans:
  An Approximation Algorithm for Scheduling on Three Dedicated Machines. 49-59
  
• Krishnamurthi Ravishankar, Suresh Singh:
  Asymptotically optimal Gossiping in Radio Networks. 61-82
  
• Jens Vygen:
  NP-completeness of Some Edge-disjoint Paths Problems. 83-90
  

Volume 61, Number 2, 1995

• Martin Anthony:
  Classification by Polynomial Surfaces. 91-103
  
• David S. Cohen, Manuel Blum:
  on the Problem of Sorting Burnt Pancakes. 105-120
  
• Annalisa De Bonis, Luisa Gargano, Ugo Vaccaro:
  optimal Detection of a Counterfeit Coin with Multi-arms Balances. 121-131
  
• Michael R. Fellows, Pavol Hell, Karen Seyffarth:
  Large Planar Graphs with Given Diameter and Maximum Degree. 133-153
  
• Beverly Jamison, Stephan Olariu:
  Linear Time optimization Algorithms for P4-sparse Graphs. 155-175
  
• H. L. Abbott, M. J. Smuga-Otto:
  Lower Bounds for Hypergraph Ramsey Numbers. 177-180
  
• Hong-Jian Lai:
  Large Survivable Nets and the Generalized Prisms. 181-185
  

Volume 61, Number 3, 1995

• Martin Aigner, Otfried Schwarzkopf:
  Bounds on the Size of Merging Networks. 187-194
  
• Ross Baldick:
  A Unified Approach to Polynomially Solvable Cases of Integer "non-separable" Quadratic optimization. 195-212
  
• Marc Baumslag:
  An Algebraic Analysis of the Connectivity of DeBruijn and Shuffle-exchange Digraphs. 213-227
  
• Satoru Iwata, Kazuo Murota:
  A Theorem on the Principal Structure for Independent Matchings. 229-244
  
• Klaus Jansen:
  Scheduling of Conditional Executed Jobs on Unrelated Processors. 245-255
  
• Gheorghe Paun, Arto Salomaa:
  Thin and Slender Languages. 257-270
  
• Ulrich Tamm:
  Deterministic Communication Complexity of Set Intersection. 271-283