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=1983
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A nonfactorial algorithm for testing isomorphism of two graphs
Mark K. Goldberg
Discrete Applied Mathematics
6
, 1983, pp. 229-236
Recognizing sign solvable graphs
Pierre Hansen
Discrete Applied Mathematics
6
, 1983, pp. 237-241
Efficient bounds for the stable set, vertex cover and set packing problems
Dorit S. Hochbaum
Discrete Applied Mathematics
6
, 1983, pp. 243-254
Intersection-union systems
George Markowsky
,
Andrew Wohlgemuth
Discrete Applied Mathematics
6
, 1983, pp. 255-262
The goodness of
\{S,a\}
-E0L forms is decidable
G. Rozenberg
,
R. Verraedt
Discrete Applied Mathematics
6
, 1983, pp. 263-299
Approximations to clustering and subgraph problems on trees
Rainer Schrader
Discrete Applied Mathematics
6
, 1983, pp. 301-309
Linear orders and semiorders close to an interval order
Marc Roubens
,
Philippe Vincke
Discrete Applied Mathematics
6
, 1983, pp. 311-314
A characterization of competition graphs
R.D. Dutton
,
R.C. Brigham
Discrete Applied Mathematics
6
, 1983, pp. 315-317
A characterization of graphs of competition number
m
J. Richard Lundgren
,
John S. Maybee
Discrete Applied Mathematics
6
, 1983, pp. 319-322
A characterization of competition graphs of arbitrary digraphs
Fred S. Roberts
,
Jeffrey E. Steif
Discrete Applied Mathematics
6
, 1983, pp. 323-326
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
Seiten
<
1
2
3
>