| The complexity of counting graph homomorphisms M Dyer, C Greenhill Random Structures & Algorithms 17 (3‐4), 260-289, 2000 | 282 | 2000 |
| The relative complexity of approximate counting problems M Dyer, LA Goldberg, C Greenhill, M Jerrum Algorithmica 38 (3), 471-500, 2004 | 183 | 2004 |
| Sampling regular graphs and a peer-to-peer network C Cooper, M Dyer, C Greenhill Combinatorics Probability and Computing 16 (4), 557-593, 2007 | 175 | 2007 |
| On Markov chains for independent sets M Dyer, C Greenhill Journal of Algorithms 35 (1), 17-49, 2000 | 170 | 2000 |
| Generation of simple quadrangulations of the sphere G Brinkmann, S Greenberg, C Greenhill, BD McKay, R Thomas, P Wollan Discrete mathematics 305 (1-3), 33-54, 2005 | 106 | 2005 |
| The complexity of counting colourings and independent sets in sparse graphs and hypergraphs C Greenhill computational complexity 9 (1), 52-72, 2000 | 96 | 2000 |
| A more rapidly mixing Markov chain for graph colorings M Dyer, C Greenhill Random Structures & Algorithms 13 (3‐4), 285-317, 1998 | 81 | 1998 |
| Asymptotic enumeration of sparse 0–1 matrices with irregular row and column sums C Greenhill, BD McKay, X Wang Journal of Combinatorial Theory, Series A 113 (2), 291-324, 2006 | 71 | 2006 |
| Networks within networks: using multiple link types to examine network structure and identify key actors in a drug trafficking operation DA Bright, C Greenhill, A Ritter, C Morselli Global Crime 16 (3), 219-237, 2015 | 64 | 2015 |
| Polynomial-time counting and sampling of two-rowed contingency tables M Dyer, C Greenhill Theoretical Computer Science 246 (1-2), 265-278, 2000 | 61 | 2000 |
| Random walks on combinatorial objects M Dyer, C Greenhill London Mathematical Society Lecture Note Series, 101-136, 1999 | 60 | 1999 |
| The use of actor-level attributes and centrality measures to identify key actors: A case study of an Australian drug trafficking network DA Bright, C Greenhill, M Reynolds, A Ritter, C Morselli Journal of Contemporary Criminal Justice 31 (3), 262-278, 2015 | 56 | 2015 |
| On approximately counting colorings of small degree graphs R Bubley, M Dyer, C Greenhill, M Jerrum SIAM Journal on Computing 29 (2), 387-400, 1999 | 56 | 1999 |
| The switch Markov chain for sampling irregular graphs C Greenhill Proceedings of the twenty-sixth annual acm-siam symposium on discrete …, 2014 | 52 | 2014 |
| Asymptotic enumeration of dense 0–1 matrices with specified line sums ER Canfield, C Greenhill, BD McKay Journal of Combinatorial Theory, Series A 115 (1), 32-66, 2008 | 51 | 2008 |
| On the chromatic number of a random hypergraph M Dyer, A Frieze, C Greenhill Journal of Combinatorial Theory, Series B 113, 68-122, 2015 | 48 | 2015 |
| A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs C Greenhill Electronic Journal of Combinatorics 18 (1), #P234, 2011 | 48 | 2011 |
| An extension of path coupling and its application to the Glauber dynamics for graph colorings M Dyer, LA Goldberg, C Greenhill, M Jerrum, M Mitzenmacher SIAM Journal on Computing 30 (6), 1962-1975, 2001 | 47 | 2001 |
| Beating the 2∆ bound for approximately counting colourings: a computer-assisted proof of rapid mixing R Bubley, M Dyer, C Greenhill Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms …, 1998 | 47 | 1998 |
| Criminal network vulnerabilities and adaptations D Bright, C Greenhill, T Britz, A Ritter, C Morselli Global Crime 18 (4), 424-441, 2017 | 43 | 2017 |
Martin DyerUniversity of Leeds確認したメール アドレス: leeds.ac.uk
