Discrete Applied Mathematics, Volume 43

Volume 43, Number 1, May 1993

Egon Balas, Liqun Qi:
Linear-Time Separation Algorithms for the Three-Index Assignment Polytope. 1-12
Eric Bibelnieks, Perino M. Dearing:
Neighborhood Subtree Tolerance Graphs. 13-26
Dean S. Clark, James T. Lewis:
Circular a Avoiding Sequences with Prescribed Sum. 27-36
Klaus Jansen:
The Allocation Problem in Hardware Design. 37-46
Dongdai Lin, Mulan Liu:
The Equivalence Classes of LR Arrays. 47-61
Gerard Sierksma:
The Skeleton of the Symmetric Traveling Salesman Polytope. 63-74
Alan Wagner, Derek G. Corneil:
On the Complexity of the Embedding Problem for Hypercube Related Graphs. 75-95

Note

Addendum

Dominique de Werra, Jacek Blazewicz:
Some Preemptive open Shop Scheduling Problems with a Renewable or a Nonrenewable Resource. (Discrete Applied Mathematics 35 (1992) 205-219). 103-104

Donna Crystal Llewellyn:
Preface. 109
Ingo Althöfer, Klaus-Uwe Koschnick:
On the Deterministic Complexity of Searching Local Maxima. 111-113
Walter Kern:
On the Depth of Combinatorial Optimization Problems. 115-129
Donna Crystal Llewellyn, Craig A. Tovey:
Dividing and Conquering the Square. 131-153
Ronald L. Rardin, Moises Sudit:
Paroid Search: Generic Local Combinatorial Optimization. 155-174
Rakesh Vohra, Nicholas G. Hall:
A Probabilistic Analysis of the Maximal Covering Location Problem. 175-183

Robert J. Cimikowski:
On Certain Hamiltonian Inner Triangulations. 185-195
Collette R. Coullard, John G. Del Greco, Donald K. Wagner:
Recognizing a Class of Bicircular Matroids. 197-215
Michael E. Houle, Hiroshi Imai, Keiko Imai, Jean-Marc Robert, Peter Yamamoto:
Orthogonal Weighted Linear L₁ and L_infty Approximation and Applications. 217-232
Shlomo Moran, Yaron Wolfsthal:
Two-Page Book Embedding of Trees under Vertex-Neighborhood Constraints. 233-241
Thomas Roos:
Voronoi Diagrams over Dynamic Scenes. 243-259
Alejandro A. Schäffer:
A Faster Algorithm to Recognize Undirected Path Graphs. 261-295