Discrete Applied Mathematics, Volume 23

Volume 23, Number 1, April 1989

Thomas Andreae:
A ternary search problem on graphs. 1-10
Stefan Arnborg, Andrzej Proskurowski:
Linear time algorithms for NP-hard problems restricted to partial k-trees. 11-24
Larry Aupperle, J. Mark Keil:
Polynomial algorithms for restricted Euclidean p-centre problems. 25-31
W. Bucher:
On the generation of powers by OS schemes. 33-43
Peter Butkovic, Ján Plávka:
On the dependence of the maximum cycle mean of a matrix on permutations of the rows and columns. 45-53
Renato M. Capocelli, Ugo Vaccaro:
Structure of decoders for multivalued encodings. 55-71
Stanislaw Zdrzalka, Józef Grabowski:
An algorithm for single machine sequencing with release dates to minimize maximum cost. 73-89
Jean-Marc Champarnaud, Jean-Eric Pin:
A maxmin problem on finite automata. 91-96

Marie-Claude Heydemann, J. C. Meyer, Dominique Sotteau:
On forwarding indices of networks. 103-123
Robert G. Jeroslow:
Representability of functions. 125-137
Roger Labahn:
Extremal broadcasting problems. 139-155
Donna Crystal Llewellyn, Craig A. Tovey, Michael A. Trick:
Local optimization on graphs. 157-178
Masahiro Miyakawa, Ivan Stojmenovic:
Classification of P_k2. 179-192
Gilles Zémor:
On positive and negative atoms of Cayley digraphs. 193-195

Egon Balas, Matthew J. Saltzman:
Facets of the three-index assignment polytope. 201-229
Charles Cable, Kathryn F. Jones, J. Richard Lundgren, Suzanne M. Seager:
Niche graphs. 231-241
Fillia Makedon, Ivan Hal Sudborough:
On minimizing width in linear layouts. 243-265
Randy Shull, James B. Orlin, Alan Shuchat, Marianne L. Gardner:
The structure of bases in bicircular matroids. 267-283
M. Reza Emamy-Khansary:
The worst case behavior of a greedy algorithm for a class of pseudo-Boolean functions. 285-287
Hugo Krawczyk, Azaria Paz:
The diophantine problem of Frobenius: A close bound. 289-291

Last update Sat May 25 15:52:03 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page