Catherine Greenhill

Cited by

	All	Since 2017
Citations	2624	1167
h-index	29	19
i10-index	49	32

280

140

210

199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202211 29 44 41 47 42 71 45 60 68 78 90 108 81 125 110 101 105 143 134 177 201 273 211 167

Public access

View all

32 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Martin DyerUniversity of LeedsVerified email at leeds.ac.uk
Brendan McKayProfessor of Computer Science, Australian National UniversityVerified email at anu.edu.au
Leslie Ann GoldbergProfessor of Computer Science, University of OxfordVerified email at cs.ox.ac.uk
Nicholas WormaldProfessor of Mathematics, Monash UniversityVerified email at monash.edu
Mikhail IsaevMonash UniversityVerified email at monash.edu
Amin Coja-OghlanTU DortmundVerified email at tu-dortmund.de
Tamás Róbert MezeiAlfréd Rényi Institute of MathematicsVerified email at renyi.hu
Péter L. ErdősResearch Professor, A. Renyi Institue of Mathematics, HASVerified email at renyi.mta.hu
Dániel SoltészMTA Rényi InstituteVerified email at renyi.hu
Istvan MiklosRenyi InstituteVerified email at ramet.elte.hu
Lajos SoukupAlfréd Rényi Institute of Mathematics, Eötvös Loránd Research NetworkVerified email at renyi.mta.hu
Thomas BritzUNSW SydneyVerified email at unsw.edu.au
Matthew KwanIST AustriaVerified email at ist.ac.at
Alan FriezeCarnegie Mellon UniversityVerified email at random.math.cmu.edu
Mario UllrichJohannes Kepler University LinzVerified email at jku.at
Pu (Jane) GaoUniversity of WaterlooVerified email at uwaterloo.ca
Oleg PikhurkoUniversity of WarwickVerified email at warwick.ac.uk
Nicholas CavenaghWaikato UniversityVerified email at waikato.ac.nz
Ian WanlessMonash UniversityVerified email at monash.edu
Magnus BordewichProfessor of Computer Science, Durham UniversityVerified email at durham.ac.uk

Catherine Greenhill

School of Mathematics and Statistics, UNSW Sydney

Verified email at unsw.edu.au

random structures asymptotic enumeration randomized algorithms


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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	184	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	178	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	72	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	65	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	53	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	49	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	49	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	44	2017

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors