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: Author="Brand, Neal"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Generalized Steinhaus graphs
Neal Brand
,
Margaret Morton
Journal of Graph Theory
20
(1), 1995, pp. 47-58
Probability of diameter two for Steinhaus graphs
Neal Brand
,
Stephen Curran
,
Sajal Das
,
Tom Jacob
Discrete Applied Mathematics
41
, 1993, pp. 165-171
One-factors and the existence of affine designs
Neal Brand
,
Somporn Sutinuntopas
Discrete Mathematics
120
(1-3), 1993, pp. 25-35
Almost all Steinhaus graphs have diameter 2
Neal Brand
Journal of Graph Theory
16
(3), 1992, pp. 213-219
Polynomial isomorphisms of combinatorial objects
Neal Brand
Graphs and Combinatorics
7
, 1991, pp. 7-14
Mendelsohn designs admitting the affine group
Neal Brand
,
W. Cary Huffman
Graphs and Combinatorics
3
, 1987, pp. 313-324
Topological invariants of 2-designs arising from difference families
Neal Brand
,
W. Cary Huffman
Journal of Combinatorial Theory Series A
36
, 1984, pp. 253-278