![]() | ![]() |
| 2012 | ||
|---|---|---|
| 9 | Geoffrey R. Grimmett, K.-F. Oelbermann, Friedrich Pukelsheim: A power-weighted variant of the EU27 Cambridge Compromise. Mathematical Social Sciences 63(2): 136-140 (2012) | |
| 8 | Geoffrey R. Grimmett: European apportionment via the Cambridge Compromise. Mathematical Social Sciences 63(2): 68-73 (2012) | |
| 2010 | ||
| 7 | Geoffrey R. Grimmett, Thomas M. Liggett, Thomas Richthammer: Percolation of arbitrary words in one dimension. Random Struct. Algorithms 37(1): 85-99 (2010) | |
| 6 | Geoffrey R. Grimmett, Svante Janson: Random graphs with forbidden vertex degrees. Random Struct. Algorithms 37(2): 137-175 (2010) | |
| 2009 | ||
| 5 | Geoffrey R. Grimmett, Svante Janson: Random Even Graphs. Electr. J. Comb. 16(1): (2009) | |
| 2004 | ||
| 4 | Geoffrey R. Grimmett, S. N. Winkler: Negative association in uniform forests and connected graphs. Random Struct. Algorithms 24(4): 444-460 (2004) | |
| 2003 | ||
| 3 | Geoffrey R. Grimmett, Svante Janson: On smallest triangles. Random Struct. Algorithms 23(2): 206-223 (2003) | |
| 2001 | ||
| 2 | Geoffrey R. Grimmett: Infinite paths in randomly oriented lattices. Random Struct. Algorithms 18(3): 257-266 (2001) | |
| 1986 | ||
| 1 | Geoffrey R. Grimmett: An exact threshold theorem for random graphs and the node-packing problem. J. Comb. Theory, Ser. B 40(2): 187-195 (1986) | |
| 1 | Svante Janson | [3] [5] [6] |
| 2 | Thomas M. Liggett | [7] |
| 3 | K.-F. Oelbermann | [9] |
| 4 | Friedrich Pukelsheim | [9] |
| 5 | Thomas Richthammer | [7] |
| 6 | S. N. Winkler | [4] |
Colors in the list of coauthors
Last update Thu May 31 18:55:10 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page