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="Hanson, D."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimization of argument evaluation order
C.W. Fraser
,
D.R. Hanson
Information Processing Letters
24
(6), 1987, April, pp. 391-395
Edge-colored saturated graphs
D. Hanson
,
B. Toft
Journal of Graph Theory
11
(2), 1987, pp. 191-196
Minimal
k
-saturated and color critical graphs of prescribed minimum degree
D.A. Duffus
,
D. Hanson
Journal of Graph Theory
10
(1), 1986, pp. 55-67
Printing common words
D.R. Hanson
Technical Report (TR 86-18), 1986, May
Code improvement via lazy evaluation
D.R. Hanson
Information Processing Letters
11
(4-5), 1980, December, pp. 163-167
On finite
\Delta
-systems II
H.L. Abbott
,
D. Hanson
Discrete Mathematics
17
, 1977, pp. 121-126
Degrees and matchings
V. Chvátal
,
D. Hanson
Journal of Combinatorial Theory Series B
20
, 1976, pp. 128-138
Sum-free sets and Ramsey numbers
D. Hanson
Discrete Mathematics
14
(1), 1976, pp. 57-61
On a combinatorial problem in geometry
H.L. Abbott
,
D. Hanson
Discrete Mathematics
12
, 1975, pp. 389-392
On finite
\Delta
-systems
H.L. Abbott
,
D. Hanson
Discrete Mathematics
8
(1), 1974, pp. 1-12
Intersection theorems for systems of sets
H.L. Abbott
,
D. Hanson
,
N. Sauer
Journal of Combinatorial Theory Series A
12
, 1972, pp. 381-389
Lower bounds for certain types of van der Waerden numbers
H.L. Abbott
,
D. Hanson
Journal of Combinatorial Theory Series A
12
, 1972, pp. 143-146