default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 2
Volume 2, Number 1, April 1980
- Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson:
Langages sur des alphabets infinis. 1-20 - Harold Greenberg, Israel Feldman:
A better step-off algorithm for the knapsack problem. 21-25 - Horst W. Hamacher:
Algebraic flows in regular matroids. 27-38 - Ellis L. Johnson, Uwe H. Suhl:
Experiments in integer programming. 39-55 - John S. Maybee:
Sign solvable graphs. 57-63 - David A. Plaisted, Samuel Zaks:
An NP-complete matching problem. 65-72 - Andrzej Ehrenfeucht, Grzegorz Rozenberg, R. Verraedt:
Many-to-one simulation in E0L forms is decidable. 73-76 - Satoru Fujishige
:
Principal structures of submodular systems. 77-79 - Jenö Lehel:
Deltahedra are realizable as simplicial convex polyhedra. 81-84
Volume 2, Number 2, July 1980
- Richard W. Cottle:
Observations on a class of nasty linear complementarity problems. 89-111 - Friedrich Esser, Frank Harary:
Digraphs with real and gaussian spectra. 113-124 - Masakazu Nasu:
An interconnection of local maps inducing onto global maps. 125-150 - Pierre Hansen:
An O(tm log D) Algorithm for shortest paths. 151-153 - Toshihide Ibaraki:
The number of additional variables required for the integer programming formulation. 155-158 - Aldo Aiello, Ernesto Burattini, A. Massarotti, Francesco Ventriglia:
"A posteriori" evaluation of bin packing approximation algorithms. 159-161 - C. Marrazzini:
Characterization of the inverse of a particular circulant matrix by means of a continued fraction. 163-165 - Arnon Rosenthal:
Optimal mass production. 167-170
Volume 2, Number 3, September 1980
- Charles E. Blair:
Facial disjunctive programs and sequence of cutting-planes. 173-179 - Charles J. Colbourn, Derek G. Corneil:
On deciding switching equivalence of graphs. 181-184 - Arthur M. Farley, Andrzej Proskurowski:
Computation of the center and diameter of outerplanar graphs. 185-191 - E. Ya. Gabovich, I. I. Melamed:
On constant discrete programming problems. 193-205 - M. Gordon, John A. Torkington:
Enumeration of coloured plane trees with a given type partition. 207-223 - Georg Gunther, Bert L. Hartnell:
Optimal K-secure graphs. 225-231 - Grzegorz Rozenberg, R. Verraedt:
Synchronized and desynchronized E0L forms. 233-247 - Samir K. Bhattacharya, A. K. Gupta:
Occupation times for two-state Markov chains. 249-250 - Fred W. Glover, Darwin Klingman, John Mote, David Whitman:
An extended abstract of an indepth algorithmic and computational study for maximum flow problems. 251-254 - Monique Hucher, Germain Sabatier, Jacques Grolier:
Effectifs des diverses sequences de polyedres 3-valents convexes ayant moins de 11 faces et de polyedres sans face triangulaire ayant de 11 a 14 faces. 255-257 - A. I. Riihonen:
A note on perfect Lee-codes. 259-260 - A. Volpentesta:
Equi-assignments and explicit solutions of a particular discrete optimization problem. 261-265
Volume 2, Number 4, December 1980
- Raymond A. Cuninghame-Green, P. F. J. Meijer:
An algebra for piecewise-linear minimax problems. 267-294 - Alan M. Frieze:
Probabilistic analysis of some euclidean clustering problems. 295-309 - András Recski, Masao Iri:
Network theory and transversal matroids. 311-326 - Dominique de Werra:
Geography, games and graphs. 327-337 - Maretsugu Yamasaki:
Quasiharmonic classification of infinite networks. 339-344 - Bal Kishan Dass, Sunil Kumar Muttoo:
A note on Reed-Muller codes. 345-348 - Shoji Shinoda:
On the characteristic polynomial of the adjacency matrix of the subdivision graph of a graph. 349-351 - Roberto Dvornicich:
On a problem of cyclic permutations of integers. 353-355 - Reinhardt Euler:
On a classification of independence systems. 357-360 - Tohru Kikuno, Noriyoshi Yoshida, Yoshiaki Kakuda:
NP-completeness of some type of p-center problem. 361-363
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-01-09 19:34 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:
