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 Volume=3
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Comment on ``A note on perfect Lee-codes''
D.B. Holdridge
,
J.A. Davis
Discrete Applied Mathematics
3
, 1981, pp. 221
`Integer-making' theorems
József Beck
,
Tibor Fiala
Discrete Applied Mathematics
3
, 1981, pp. 1-8
Realizability of
p
-point graphs with prescribed minimum degree, maximum degree, and point-connectivity
F.T. Boesch
,
C.L. Suffel
Discrete Applied Mathematics
3
, 1981, pp. 9-18
Integer programming by long division
R.A. Cuninghame-Greene
Discrete Applied Mathematics
3
, 1981, pp. 19-25
Inverted orders for monotone scoring rules
Peter C. Fishburn
Discrete Applied Mathematics
3
, 1981, pp. 27-36
Parametric shortest path algorithms with an application to cyclic staffing
Richard M. Karp
,
James B. Orlin
Discrete Applied Mathematics
3
, 1981, pp. 37-45
Mathematical crystal growth I
D.A. Klarner
Discrete Applied Mathematics
3
, 1981, pp. 47-52
Universal algorithms for evaluating Boolean functions
A. Thayse
Discrete Applied Mathematics
3
, 1981, pp. 53-65
Optimal key for taxons ordered in accordance with their frequencies
R.E. Krichevskii
,
B.Ya. Ryabko
,
A.Yu. Haritonov
Discrete Applied Mathematics
3
, 1981, pp. 67-72
A note on perfect Lee-codes over small alphabets
Timo Lepistö
Discrete Applied Mathematics
3
, 1981, pp. 73-74
Combinatorial problems on series-parallel graphs
K. Takamizawa
,
T. Nishizeki
,
N. Saito
Discrete Applied Mathematics
3
, 1981, pp. 75-76
Graph theory and molecular distribution. Part I: Copolycondensation of polyfunctional monomers bearing identical reactive groups
Dominique Durand
,
Claude-Marcel Bruneau
Discrete Applied Mathematics
3
, 1981, pp. 79-91
Comportement périodique des fonctions à seuil binaires et applications
E. Goles
,
J. Olivos
Discrete Applied Mathematics
3
, 1981, pp. 93-105
Continuous
L
-cluster methods
M.F. Janowitz
Discrete Applied Mathematics
3
, 1981, pp. 107-112
Mathematical crystal growth II
D.A. Klarner
Discrete Applied Mathematics
3
, 1981, pp. 113-117
Colorings and interpretations: A connection between graphs and grammar forms
H.A. Maurer
,
A. Salomaa
,
D. Wood
Discrete Applied Mathematics
3
, 1981, pp. 119-135
Sequencing with general precedence constraints
C.L. Monma
Discrete Applied Mathematics
3
, 1981, pp. 137-150
On the removal of forbidden graphs by edge-deletion or by edge-contraction
Toshimasa Watanabe
,
Tadashi Ae
,
Akira Nakamura
Discrete Applied Mathematics
3
, 1981, pp. 151-153
Concerning the complexity of deciding isomorphism of block designs
Marlene J. Colbourn
,
Charles J. Colbourn
Discrete Applied Mathematics
3
, 1981, pp. 155-162
Complement reducible graphs
D.G. Corneil
,
H. Lerchs
,
L. Stewart Burlingham
Discrete Applied Mathematics
3
, 1981, pp. 163-174
Substitutes and complements in network flow problems
David Gale
,
Themistocles Politof
Discrete Applied Mathematics
3
, 1981, pp. 175-186
Accretion centers: A generalization of branch weight centroids
Peter J. Slater
Discrete Applied Mathematics
3
, 1981, pp. 187-192
The
b
-hull of an integer program
L.A. Wolsey
Discrete Applied Mathematics
3
, 1981, pp. 193-201
Minimization of maximum absolute deviation in integers
Zeev Zeitlin
Discrete Applied Mathematics
3
, 1981, pp. 203-220
Balancing signed graphs
J. Akiyama
,
D. Avis
,
V. Chvátal
,
H. Era
Discrete Applied Mathematics
3
, 1981, pp. 227-233
Seiten 1
2
>