| 2008 |
|---|
| 8 | EE | Mathew D. Penrose,
Andrew R. Wade:
Limit theory for the random on-line nearest-neighbor graph.
Random Struct. Algorithms 32(2): 125-156 (2008) |
| 2006 |
|---|
| 7 | EE | T. Schreiber,
Mathew D. Penrose,
Joseph E. Yukich:
Gaussian limits for multidimensional random sequential packing at saturation (extended version)
CoRR abs/math/0610680: (2006) |
| 2001 |
|---|
| 6 | | Josep Díaz,
Mathew D. Penrose,
Jordi Petit,
Maria J. Serna:
Approximating Layout Problems on Random Geometric Graphs.
J. Algorithms 39(1): 78-116 (2001) |
| 2000 |
|---|
| 5 | | Josep Díaz,
Mathew D. Penrose,
Jordi Petit,
Maria J. Serna:
Convergence Theorems For Some Layout Measures On Random Lattice And Random Geometric Graphs.
Combinatorics, Probability & Computing 9(6): (2000) |
| 1999 |
|---|
| 4 | EE | Josep Díaz,
Mathew D. Penrose,
Jordi Petit,
Maria J. Serna:
Layout Problems on Lattice Graphs.
COCOON 1999: 103-112 |
| 3 | EE | Josep Díaz,
Mathew D. Penrose,
Jordi Petit,
Maria J. Serna:
Linear Orderings of Random Geometric Graphs.
WG 1999: 291-302 |
| 2 | | Mathew D. Penrose:
On k-connectivity for a geometric random graph.
Random Struct. Algorithms 15(2): 145-164 (1999) |
| 1998 |
|---|
| 1 | | Mathew D. Penrose:
Random minimal spanning tree and percolation on the N-cube.
Random Struct. Algorithms 12(1): 63-82 (1998) |
