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=5
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A mathematical programming model for the long-term development of an off-shore gas field
E.M.L. Beale
Discrete Applied Mathematics
5
, 1983, pp. 1-9
Scheduling subject to resource constraints: Classification and complexity
J. Bƚażewicz
,
J.K. Lenstra
,
A.H.G. Rinnooy Kan
Discrete Applied Mathematics
5
, 1983, pp. 11-24
Design of electricity supply networks
T.B. Boffey
,
J.R. Green
Discrete Applied Mathematics
5
, 1983, pp. 25-38
On the complexity of finding multi-constrained spanning trees
P.M. Camerini
,
G. Galbiati
,
F. Maffioli
Discrete Applied Mathematics
5
, 1983, pp. 39-50
Lower bounds for the clique and the chromatic numbers of a graph
C.S. Edwards
,
C.H. Elphick
Discrete Applied Mathematics
5
, 1983, pp. 51-64
Surrogate duality relaxation for job shop scheduling
M.L. Fisher
,
B.J. Lageweg
,
J.K. Lenstra
,
A.H.G. Rinnooy Kan
Discrete Applied Mathematics
5
, 1983, pp. 65-75
Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
John Franco
,
Marvin Paull
Discrete Applied Mathematics
5
, 1983, pp. 77-87
On the quadratic assignment problem
A.M. Frieze
,
J. Yadegar
Discrete Applied Mathematics
5
, 1983, pp. 89-98
An algorithm for single machine sequencing with release dates to minimize total weighted completion time
A.M.A. Hariri
,
C.N. Potts
Discrete Applied Mathematics
5
, 1983, pp. 99-109
NP-completeness of a family of graph-colouring problems
Robert W. Irving
Discrete Applied Mathematics
5
, 1983, pp. 111-117
On the computational complexity of a merge recognition problem
Anthony Mansfield
Discrete Applied Mathematics
5
, 1983, pp. 119-122
On the chromatic forcing number of a random graph
Colin McDiarmid
Discrete Applied Mathematics
5
, 1983, pp. 123-132
Randomised algorithms
D.J.A. Welsh
Discrete Applied Mathematics
5
, 1983, pp. 133-145
A characterisation of all feasible solutions to an integer program
H.P. Williams
Discrete Applied Mathematics
5
, 1983, pp. 147-155
Points by degree and orbit size in chemical trees, II
C.K. Bailey
,
J.W. Kennedy
,
E.M. Palmer
Discrete Applied Mathematics
5
, 1983, pp. 157-164
On the bicycle problem
V. Chvátal
Discrete Applied Mathematics
5
, 1983, pp. 165-173
Canonical decompositions of symmetric submodular systems
Satoru Fujishige
Discrete Applied Mathematics
5
, 1983, pp. 175-190
Extremal
f
-trees and embedding spaces for molecular graphs
John W. Kennedy
,
Louis V. Quintas
Discrete Applied Mathematics
5
, 1983, pp. 191-209
An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs
Takao Nishizeki
,
Takao Asano
,
Takahiro Watanabe
Discrete Applied Mathematics
5
, 1983, pp. 211-222
On monotone functions of tree structures
Helmut Prodinger
,
Friedrich J. Urbanek
Discrete Applied Mathematics
5
, 1983, pp. 223-239
A convex polytope of diameter one
Arun K. Pujari
,
Ashok K. Mittal
,
S.K. Gupta
Discrete Applied Mathematics
5
, 1983, pp. 241-242
A note on morphic characterization of languages
Juhani Karhumäki
,
Matti Linna
Discrete Applied Mathematics
5
, 1983, pp. 243-246
Erratum to ''Disjunctive programming''
E. Balas
Discrete Applied Mathematics
5
, 1983, pp. 247-248
Rotator design
M. Davio
,
C. Ronse
Discrete Applied Mathematics
5
, 1983, pp. 253-277
On cube-free
\omega
-words generated by binary morphisms
Juhani Karhumäki
Discrete Applied Mathematics
5
, 1983, pp. 279-297
Seiten 1
2
>