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 new van der Waerden number
Michael D. Beeler
Discrete Applied Mathematics
6
, 1983, pp. 207
Parallel sorting
Béla Bollobás
,
Andrew Thomason
Discrete Applied Mathematics
6
, 1983, pp. 1-11
Equivalence among optimization problems on matrix sets
M.S. Burgin
,
E.Ya. Gabovich
Discrete Applied Mathematics
6
, 1983, pp. 13-24
Denumerations of rooted trees and multisets
N.G. de Bruijn
Discrete Applied Mathematics
6
, 1983, pp. 25-33
Some generalized type functional dependencies formalized as equality set on matrices
J. Demetrovics
,
Gy. Gyepesi
Discrete Applied Mathematics
6
, 1983, pp. 35-47
An algorithm for collapsing sign alternating sequences of real numbers
Daniel J. Kleitman
,
Robert A. Lew
Discrete Applied Mathematics
6
, 1983, pp. 49-53
Multicommodity flows in graphs
Haruko Okamura
Discrete Applied Mathematics
6
, 1983, pp. 55-62
On the NP-hardness of edge-deletion and -contraction problems
Toshimasa Watanabe
,
Tadashi Ae
,
Akira Nakamura
Discrete Applied Mathematics
6
, 1983, pp. 63-78
An extension of Christofides heuristic to the
k
-person travelling salesman problem
A.M. Frieze
Discrete Applied Mathematics
6
, 1983, pp. 79-83
Two routing problems with the limitation of fuel
Tetsuo Ichimori
,
Hiroaki Ishii
,
Toshio Nishida
Discrete Applied Mathematics
6
, 1983, pp. 85-89
An
O(m\log\log D)
algorithm for shortest paths
Rolf G. Karlsson
,
Patricio V. Poblete
Discrete Applied Mathematics
6
, 1983, pp. 91-93
Transient length in sequential iteration of threshold functions
F. Fogelman
,
E. Goles
,
G. Weisbuch
Discrete Applied Mathematics
6
, 1983, pp. 95-98
Some results about the interval number of a graph
Christoph Maas
Discrete Applied Mathematics
6
, 1983, pp. 99-102
A lower-bound for the number of productions required for a certain class of languages
Brian Alspach
,
Peter Eades
,
Gordon Rose
Discrete Applied Mathematics
6
, 1983, pp. 109-115
The number of rounds needed to exchange information within a graph
Susan F. Assmann
,
Daniel J. Kleitman
Discrete Applied Mathematics
6
, 1983, pp. 117-125
An effective formula for the number of solutions of a system of two
0,1
-equations
P.L. Buzytsky
,
G.A. Freiman
Discrete Applied Mathematics
6
, 1983, pp. 127-133
The vertices of the knapsack polytope
A.C. Hayes
,
D.G. Larman
Discrete Applied Mathematics
6
, 1983, pp. 135-138
On powers and centers of chordal graphs
Renu Laskar
,
Douglas Shier
Discrete Applied Mathematics
6
, 1983, pp. 139-147
An efficient algorithm for the complete set partitioning problem
Chien-Hua M. Lin
,
Harvey M. Salkin
Discrete Applied Mathematics
6
, 1983, pp. 149-156
Bivalent trees and forests or upper bounds for the probability of a union revisited
Willi Maurer
Discrete Applied Mathematics
6
, 1983, pp. 157-171
Bin packing and multiprocessor scheduling problems with side constraint on job types
I. Morihara
,
T. Ibaraki
,
T. Hasegawa
Discrete Applied Mathematics
6
, 1983, pp. 173-191
On qualitatively independent partitions and related problems
Savtopluk Poljak
,
Ales̑ Pultr
,
Voljtȇch Rödl
Discrete Applied Mathematics
6
, 1983, pp. 193-205
An explicit formula for the solution of the Fisher-Wright selection model in population genetics
Dietmar Dorninger
,
Helmut Länger
Discrete Applied Mathematics
6
, 1983, pp. 209-211
Comments on `` A note on Reed-Muller codes''
Manohar Lal Kaushik
Discrete Applied Mathematics
6
, 1983, pp. 213-214
Computing the boxicity of a graph by covering its complement by cointerval graphs
Margaret B. Cozzens
,
Fred S. Roberts
Discrete Applied Mathematics
6
, 1983, pp. 217-228
Seiten 1
2
3
>