Discrete Applied Mathematics, Volume 27

Volume 27, Numbers 1-2, May 1990

• Pavol Hell:
  Preface. 1
  
• Alok Aggarwal, Maria M. Klawe:
  Applications of generalized matrix searching to geometric algorithms. 3-23
  
• Noga Alon, Yossi Azar, Yiftach Ravid:
  Universal sequences for complete graphs. 25-28
  
• Richard P. Anstee:
  Simplified existence theorems for (g, f)-factors. 29-38
  
• David Avis, Mike Doskas:
  Algorithms for high dimensional stabbing problems. 39-48
  
• Yossi Azar, Nicholas Pippenger:
  Parallel selection. 49-58
  
• F. Cheah, Derek G. Corneil:
  The complexity of regular subgraph recognition. 59-68
  
• Norm Dadoun, David G. Kirkpatrick:
  Parallel algorithms for fractional and maximal independent sets in planar graphs. 69-83
  
• Peter L. Hammer, Frédéric Maffray:
  Completely separable graphs. 85-99
  
• Janelle J. Harms, Charles J. Colbourn:
  Probabilistic single processor scheduling. 101-112
  
• David W. Matula, Farhad Shahrokhi:
  Sparsest cuts and bottlenecks in graphs. 113-123
  
• Hiroshi Nagamochi, Toshihide Ibaraki:
  Multicommodity flows in certain planar directed networks. 125-145
  
• Richard J. Nowakowski, Ivan Rival, Jorge Urrutia:
  Representing orders on the plane by translating points and lines. 147-156
  
• Hitoshi Suzuki, Akira Ishiguro, Takao Nishizeki:
  Edge-disjoint paths in a grid bounded by two nested rectangles. 157-178
  
• Peter Winkler:
  Mean distance in a tree. 179-185
  

Volume 27, Number 3, June 1990

• A. J. Bromfield, F. C. Piper:
  Linear recursion properties of uncorrelated binary sequences. 187-193
  
• Grant A. Cheston, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs:
  On the computational complexity of upper fractional domination. 195-207
  
• Peter C. Fishburn, Fred S. Roberts, Helen M. Marcus-Roberts:
  Van Lier sequences. 209-220
  
• Kazuo Murota:
  Principal structure of layered mixed matrices. 221-234
  
• András Prékopa:
  The discrete moment problem and linear programming. 235-254
  
• Terunao Soneoka, Hiroshi Nakada, Makoto Imase:
  Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter. 255-265
  
• Craig Williams, Dana Richards:
  Efficient algorithms for path partitions. 267-276
  
• Mark Chaimovich:
  Subset-sum problems with different summands: computation. 277-282
  
• William H. Cunningham:
  Computing the binding number of a graph. 283-285
  
• Jennifer Ryan:
  Fractional total colouring. 287-292
  

Last update Sat May 25 20:00:25 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page