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="Hartfiel, D.J."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On a definition of connected sets of a matroid
D.J. Hartfiel
,
C.J. Maxson
Journal of Combinatorial Theory Series B
25
(2), 1978, October, pp. 130-134
A semigroup characterization of a linearly realisable automaton over GF(p)
D.J. Hartfiel
,
C.J. Maxson
Journal of Computer and System Sciences
14
(1), 1977, February, pp. 150-155
Algebraic models for two-edge-connected graphs
D.J. Hartfiel
,
C.J. Maxson
Discrete Mathematics
15
(2), 1976, pp. 141-150
A note on two conjectures of Geller
D.J. Hartfiel
,
C.J. Maxson
Discrete Mathematics
16
, 1976, pp. 325-328
The chainable matrix, a special combinatorial matrix
D.J. Hartfiel
,
C.J. Maxson
Discrete Mathematics
12
, 1975, pp. 245-256
A lower bound for the permanent
U_n(k, k)
D.J. Hartfiel
,
J.W. Crosby
Journal of Combinatorial Theory Series A
12
, 1972, pp. 283-288