Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Discrete Appl.~Math. AND YEAR=1980
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Langages sur des alphabets infinis
Jean-Michel Autebert
,
Joffroy Beauquier
,
Luc Boasson
Discrete Applied Mathematics
2
, 1980, pp. 1-20
A better step-off algorithm for the knapsack problem
Israel Feldman
,
Harold Greenberg
Discrete Applied Mathematics
2
, 1980, pp. 21-25
Algebraic flows in regular matroids
Horst Hamacher
Discrete Applied Mathematics
2
, 1980, pp. 27-38
Experiments in integer programming
Ellis L. Johnson
,
Uwe H. Suhl
Discrete Applied Mathematics
2
, 1980, pp. 39-55
Sign solvable graphs
John S. Maybee
Discrete Applied Mathematics
2
, 1980, pp. 57-63
An NP-complete matching problem
David A. Plaisted
,
Shmuel Zaks
Discrete Applied Mathematics
2
, 1980, pp. 65-72
Many-to-one simulation in E0L forms is decidable
A. Ehrenfeucht
,
G. Rozenberg
,
R. Verraedt
Discrete Applied Mathematics
2
, 1980, pp. 73-76
Principal structures of submodular systems
Satoru Fujishige
Discrete Applied Mathematics
2
, 1980, pp. 77-79
Deltahedra are realizable as simplicial convex polyhedra
J. Lehel
Discrete Applied Mathematics
2
, 1980, pp. 81-84
Observations on a class of nasty linear complementarity problems
Richard W. Cottle
Discrete Applied Mathematics
2
, 1980, pp. 89-111
Digraphs with real and Gaussian spectra
Friedrich Esser
,
Frank Harary
Discrete Applied Mathematics
2
, 1980, pp. 113-124
An interconnection of local maps inducing onto global maps
Masakazu Nasu
Discrete Applied Mathematics
2
, 1980, pp. 125-150
An
O(m \log D)
algorithm for shortest paths
Pierre Hansen
Discrete Applied Mathematics
2
, 1980, pp. 151-153
The number of additional variables required for the integer programming formulation
Toshihide Ibaraki
Discrete Applied Mathematics
2
, 1980, pp. 155-158
`A posteriori' evaluation of bin packing approximation algorithms
A. Aiello
,
E. Burattini
,
A. Massarotti
,
F. Ventriglia
Discrete Applied Mathematics
2
, 1980, pp. 159-161
Characterization of the inverse of a particular circulant matrix by means of a continued fraction
C. Marrazzini
Discrete Applied Mathematics
2
, 1980, pp. 163-165
Optimal mass production
Arnon Rosenthal
Discrete Applied Mathematics
2
, 1980, pp. 167-170
Facial disjunctive programs and sequences of cutting-planes
Charles E. Blair
Discrete Applied Mathematics
2
, 1980, pp. 173-179
On deciding switching equivalence of graphs
Charles J. Colbourn
,
Derek G. Corneil
Discrete Applied Mathematics
2
, 1980, pp. 181-184
Computation of the center and diameter of outerplanar graphs
Arthur M. Farley
,
Andrzej Proskurowski
Discrete Applied Mathematics
2
, 1980, pp. 185-191
On constant discrete programming problems
E.Ya. Gabovich
,
I.I. Melamed
Discrete Applied Mathematics
2
, 1980, pp. 193-205
Enumeration of coloured plane trees with a given type partition
M. Gordon
,
John A. Torkington
Discrete Applied Mathematics
2
, 1980, pp. 207-223
Optimal
k
-secure graphs
G. Gunther
,
B.L. Hartnell
Discrete Applied Mathematics
2
, 1980, pp. 225-231
Synchronized and desynchronized E0L forms
G. Rozenberg
,
R. Verraedt
Discrete Applied Mathematics
2
, 1980, pp. 233-247
Occupation times for two-state Markov chains
Samir K. Bhattacharya
,
A.K. Gupta
Discrete Applied Mathematics
2
, 1980, pp. 249-250
Seiten 1
2
>