### On the packing densities of superballs and other bodies.

A.M. Odlyzko, J.A. Rush, N.D. Elies (1991)

Inventiones mathematicae

Similarity:

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

A.M. Odlyzko, J.A. Rush, N.D. Elies (1991)

Inventiones mathematicae

Similarity:

Doheny, Kevin R. (1995)

Beiträge zur Algebra und Geometrie

Similarity:

Oded Schramm (1992)

Inventiones mathematicae

Similarity:

B. Rodin (1987)

Inventiones mathematicae

Similarity:

Schürmann, Achill (2000)

Beiträge zur Algebra und Geometrie

Similarity:

I. Sahul Hamid, S. Saravanakumar (2015)

Discussiones Mathematicae Graph Theory

Similarity:

In a graph G = (V,E), a non-empty set S ⊆ V is said to be an open packing set if no two vertices of S have a common neighbour in G. An open packing set which is not a proper subset of any open packing set is called a maximal open packing set. The minimum and maximum cardinalities of a maximal open packing set are respectively called the lower open packing number and the open packing number and are denoted by ρoL and ρo. In this paper, we present some bounds on these parameters. ...

Alexander Vardy (1995)

Inventiones mathematicae

Similarity:

H. Groemer (1990)

Discrete & computational geometry

Similarity:

Kuperberg, Greg (2000)

Geometry & Topology

Similarity:

Stillinger, F.H., Torquato, S. (2006)

Experimental Mathematics

Similarity: