default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 28
Volume 28, Number 1, July 1990
- Toshihide Ibaraki:
Preface. 1 - Annelie von Arnim, Ulrich Faigle, Rainer Schrader:
The permutahedron of series-parallel posets. 3-9 - Jacek Blazewicz
, Maciej Drozdowski, Günter Schmidt, Dominique de Werra:
Scheduling independent two processor tasks on a uniform duo-processor system. 11-20 - Rainer E. Burkard, En-Yu Yao:
Constrained partitioning problems. 21-34 - Peter L. Hammer, Uri N. Peled, Xiaorong Sun:
Difference graphs. 35-44 - Dorit S. Hochbaum, Ron Shamir:
Minimizing the number of tardy job units under release time constraints. 45-57 - Silvano Martello, Paolo Toth:
Lower bounds and reduction procedures for the bin packing problem. 59-70 - Feng Yang, Ding-Zhu Du:
The complexity of determinacy problem on group testing. 71-81
Volume 28, Number 2, August 1990
- Franz Aurenhammer:
A relationship between Gale transforms and Voronoi diagrams. 83-91 - Ruay Shiung Chang, Richard C. T. Lee:
On the continuous working problem. 93-109 - Peter Eades, Nicholas C. Wormald:
Fixed edge-length graph drawing is NP-hard. 111-134 - Michael A. Langston, Michael P. Morford:
Resource allocation under limited sharing. 135-147 - Charles T. Ryan, Kevin M. Ryan:
The minimum weight of the Grassmann codes C(k, n), . 149-156 - Zhuocheng Yang:
On optimal strategies for a betting game. 157-169 - Zoltán Füredi:
Perfect error-correcting databases. 171-176 - Zhixiong Wang:
The solution of a nonlinear partial difference equation. 177-181 - Toshimasa Watanabe, Akira Nakamura:
A smallest augmentation to 3-connect a graph. 183-186
Volume 28, Number 3, September 1990
- Douglas Bauer, S. Louis Hakimi, Edward F. Schmeichel:
Recognizing tough graphs is NP-hard. 191-195 - E. Andrew Boyd, Ulrich Faigle:
An algorithmic characterization of antimatroids. 197-205 - Jon Lee:
Canonical equation sets for classes of concordant polytopes. 207-221 - John W. Mamer, Kenneth Schilling:
On the growth of random knapsacks. 223-230 - Masahiro Miyakawa, Ivo G. Rosenberg, Ivan Stojmenovic:
Classification of three-valued logical functions preserving 0. 231-249 - Jennifer Ryan:
The structure of an integral monoid and integer programming feasibility. 251-263 - Suzanne M. Seager:
The double competition number of some triangle-free graphs. 265-269 - Marcelo J. Weinberger, Abraham Lempel:
Factorization of symmetric circulant matrices in finite fields. 271-285 - Heiko Wittenberg:
Local medians in chordal graphs. 287-296 - Adam Idzik:
Communication in m-connected graphs. 297-301 - Moni Naor:
Succinct representation of general unlabeled graphs. 303-307 - Gérald E. Séguin:
Low complexity normal bases for F2mn. 309-312
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-07 23:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
