D. G. Larman

发表

Use of Floyd's Algorithm to Find Shortest Restricted Paths.

Victor Klee, V. Klee, D. Larman, 1979 .

Dark clouds on spheres and totally non-spherical bodies of constant breadth

René Brandenberg, D. G. Larman, 2003 .

Random Bipartite Graphs: Connectedness, Isolated Nodes, Diameters.

Victor Klee, V. Klee, D. Larman, 1979 .

On the Realization of Distances within Decompositions of Sets in Rn

D. G. Larman, 1967 .

Rich cells in an arrangement of hyperplanes

János Pach, Imre Bárány, J. Pach, 1995 .

On the exponent of convergence of a packing of spheres

D. Larman, D. G. Larman, 1966 .

The Proportion of Labelled Bipartite Graphs which are Connected

E. M. Wright, D. G. Larman, V. L. Klee, 1981 .

CONVEX-BODIES, ECONOMIC CAP COVERINGS, RANDOM POLYTOPES

Imre Bárány, I. Bárány, D. Larman, 1988 .

Diameters of Random Graphs

Victor Klee, V. Klee, D. Larman, 1981, Canadian Journal of Mathematics.

The Diameter of Almost All Bipartite Graphs.

E. M. Wright, D. G. Larman, V. L. Klee, 1980 .

The convex hull of the integer points in a large ball

Imre Bárány, I. Bárány, D. Larman, 1998 .

A note on the realization of distances within sets in euclidean space

D. G. Larman, 1978 .