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="Snevily, Hunter"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A sharp bound for the number of sets that pairwise intersect at
k
-positive values
Hunter S. Snevily
Combinatorica
23
(3), 2003, pp. 527-533
The 2-pebbling property and a conjecture of Graham's
Hunter S. Snevily
,
James A. Foster
Graphs and Combinatorics
16
(2), 2000, pp. 231-244
A generalization of Fisher's inequality
Hunter S. Snevily
Journal of Combinatorial Theory Series A
85
(1), 1999, pp. 120-125
On extensions of a conjecture of Gallai
André E. Kézdy
,
Hunter S. Snevily
Journal of Combinatorial Theory Series B
70
(2), 1997, pp. 317-324
Partitioning permutations into increasing and decreasing subsequences
André E. Kézdy
,
Hunter S. Snevily
,
Chi Wang
Journal of Combinatorial Theory Series A
73
(2), 1996, pp. 353-359
Disjoint cycles in star-free graphs
Lisa R. Markus
,
Hunter S. Snevily
Journal of Graph Theory
21
(4), 1996, pp. 425-430
A new proof of several inequalities on codes and sets
Laszlo Babai
,
Hunter Snevily
,
Richard M. Wilson
Journal of Combinatorial Theory Series A
71
(1), 1995, pp. 146-153
On generalizations of the deBruijn-Erdŏs theorem
Hunter S. Snevily
Journal of Combinatorial Theory Series A
68
(1), 1994, pp. 232-238
A new result on Chvátal's conjecture
Hunter Snevily
Journal of Combinatorial Theory Series A
61
, 1992, pp. 137-141