Catherine Greenhill

Cited by

	All	Since 2018
Citations	2869	1281
h-index	31	19
i10-index	52	38

260

130

195

1998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202311 29 47 47 56 46 57 42 59 70 73 91 101 80 127 113 97 103 140 138 176 205 253 195 257 190

Public access

View all

27 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
Colin CooperProfessor in Computer Science, King's College LondonVerified email at kcl.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
Matteo SfragaraStockholm UniversityVerified email at math.su.se
Zhicheng Gaoprofessor at carleton universityVerified email at math.carleton.ca
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	290	2000
The relative complexity of approximate counting problems M Dyer, LA Goldberg, C Greenhill, M Jerrum Algorithmica 38, 471-500, 2004	198	2004
On Markov chains for independent sets M Dyer, C Greenhill Journal of Algorithms 35 (1), 17-49, 2000	181	2000
Sampling regular graphs and a peer-to-peer network C Cooper, M Dyer, C Greenhill Combinatorics Probability and Computing 16 (4), 557-593, 2007	180	2007
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	117	2005
The complexity of counting colourings and independent sets in sparse graphs and hypergraphs C Greenhill computational complexity 9, 52-72, 2000	109	2000
A more rapidly mixing Markov chain for graph colorings M Dyer, C Greenhill Random Structures & Algorithms 13 (3‐4), 285-317, 1998	85	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	76	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	74	2015
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	73	2015
Random walks on combinatorial objects M Dyer, C Greenhill London Mathematical Society Lecture Note Series, 101-136, 1999	67	1999
Polynomial-time counting and sampling of two-rowed contingency tables M Dyer, C Greenhill Theoretical Computer Science 246 (1-2), 265-278, 2000	63	2000
The switch Markov chain for sampling irregular graphs C Greenhill Proceedings of the twenty-sixth annual acm-siam symposium on discrete …, 2014	61	2014
Criminal network vulnerabilities and adaptations D Bright, C Greenhill, T Britz, A Ritter, C Morselli Global Crime 18 (4), 424-441, 2017	59	2017
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	59	1999
On the chromatic number of a random hypergraph M Dyer, A Frieze, C Greenhill Journal of Combinatorial Theory, Series B 113, 68-122, 2015	54	2015
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	53	2008
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	51	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	48	2001
Beating the 2∆ bound for approximately counting colourings: a computer-assisted proof of rapid mixing R Bubley, M Dyer, C Greenhill 9th Annual Symposium on Discrete Algorithms, ACM–SIAM, New York–Philadelphia …, 1998	48	1998

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