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
[1]
Hilfe
Suche: Author="Kleitman, D.J."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On a conjecture of Brualdi and Shen on block transitive tournaments
P. Acosta
,
A. Bassa
,
A. Chaikin
,
A. Riehl
,
A. Tingstad
,
L. Zhao
,
D.J. Kleitman
Journal of Graph Theory
44
(3), 2003, pp. 215-230
Asymptotic enumeration of fullgraphs
D.J. Kleitman
,
F.R. Lasaga
,
L.J. Cowen
Journal of Graph Theory
20
(1), 1995, pp. 59-69
Crossing families
B. Aronov
,
P. Erdös
,
W. Goddard
,
D.J. Kleitman
,
M. Klugerman
,
J. Pach
,
L.J. Schulman
Combinatorica
14
(2), 1994, pp. 127-134
The prison yard problem
Zoltán Füredi
,
D.J. Kleitman
Combinatorica
14
(2), 1994, pp. 287-300
Sharpening the LYM inequality
Péter L. Erdös
,
P. Frankl
,
D.J. Kleitman
,
M.E. Saks
,
L.A. Székely
Combinatorica
12
, 1992, pp. 287-293
On zero-trees
Zoltán Füredi
,
D.J. Kleitman
Journal of Graph Theory
16
(2), 1992, pp. 107-120
On the number of databases and closure operations
G. Burosch
,
J. Demetrovics
,
G.O.H. Katona
,
D.J. Kleitman
,
A.A. Sapozhenko
Theoretical Computer Science
78
, 1990, pp. 377-381
Pair labellings with given distance
Z. Furedi
,
J.R. Griggs
,
D.J. Kleitman
SIAM Journal on Discrete Mathematics
2
, 1989, pp. 491-499
Divisors without unit-congruent ratios
D.J. Kleitman
SIAM Journal on Discrete Mathematics
2
, 1989, pp. 344-349
Problem session
D.J. Kleitman
Applications of Discrete Mathematics - Proceedings of the 3rd Conference on Discrete Mathematics (Clemson, South Carolina, May 14-16, 1986), 1988, pp. 221-222
The smallest
n
-uniform hypergraph with positive discrepancy
N. Alon
,
D.J. Kleitman
,
C. Pomerance
,
M. Saks
,
P. Seymour
Combinatorica
7
(2), 1987, pp. 151-160
On a dual version of the one-dimensional bin packing problem
S.F. Assmann
,
D.S. Johnson
,
D.J. Kleitman
,
J.Y.-T. Leung
Journal of Algorithms
5
(4), 1984, December, pp. 502-525
Characterization of curve map graphs
S.F. Assmann
,
D.J. Kleitman
Discrete Applied Mathematics
8
, 1984, pp. 109-124
An algorithm for covering polygons with rectangles
D.S. Franzblau
,
D.J. Kleitman
Information and Control
63
(3), 1984, pp. 164-189
Inherent complexity trade-offs for range query problems
W.A. Burkhard
,
M.L. Fredman
,
D.J. Kleitman
Theoretical Computer Science
16
, 1981, pp. 279-290
Set orderings requiring costliest alphabetic binary trees
D.J. Kleitman
,
Michael E. Saks
SIAM Journal on Algebraic Discrete Methods
2
(2), 1981, June, pp. 142-146
Intersections of
k
-element sets
D.J. Kleitman
,
J. Shearer
,
D. Sturtevant
Combinatorica
1
, 1981, pp. 381-384
Further results on the Aanderaa-Rosenberg conjecture
D.J. Kleitman
,
D.J. Kwiatkowski
Journal of Combinatorial Theory Series B
28
, 1980, pp. 85-95
Coping with errors in binary search procedures
R.L. Rivest
,
A.R. Meyer
,
D.J. Kleitman
,
K. Winklmann
,
J. Spencer
Journal of Computer and System Sciences
20
(3), 1980, June, pp. 396-404
The number of meets between two subsets of a lattice
D.E. Daykin
,
D.J. Kleitman
,
D.B. West
Journal of Combinatorial Theory Series A
26
, 1979, pp. 135-156
Matrix tree theorems
S. Chaiken
,
D.J. Kleitman
Journal of Combinatorial Theory Series A
24
, 1978, pp. 377-381
Coping with errors in binary search procedures
D.J. Kleitman
,
A.R. Meyer
,
R.L. Rivest
,
J. Spencer
,
K. Winklmann
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, STOC'78 (San Diego, CA, May 1-3, 1978)
, 1978, pp. 227-232
A three part Sperner theorem
J.R. Griggs
,
D.J. Kleitman
Discrete Mathematics
17
, 1977, pp. 281-289
The degree sequences of self-complementary graphs
C.R.J. Clapham
,
D.J. Kleitman
Journal of Combinatorial Theory Series B
20
, 1976, pp. 67-74
A lower bound on the length of a sequence containing all permutations as subsequences
D.J. Kleitman
,
D.J. Kwiatkowski
Journal of Combinatorial Theory Series A
21
, 1976, pp. 129-136
Seiten 1
2
>