Catherine Greenhill

Cited by

	All	Since 2019
Citations	3085	1312
h-index	31	20
i10-index	53	37

280

140

210

19971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320248 19 29 47 48 54 45 58 42 60 72 76 90 104 81 127 113 97 97 142 140 171 213 262 191 239 244 159

Public access

View all

29 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 WormaldMonash UniversityVerified email at monash.edu
Mikhail IsaevMonash UniversityVerified email at monash.edu
Andrzej RucinskiVerified email at amu.edu.pl
Amin Coja-OghlanTU DortmundVerified email at tu-dortmund.de
Tamás Róbert MezeiSabbaticalVerified email at trm.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
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	310	2000
The relative complexity of approximate counting problems M Dyer, LA Goldberg, C Greenhill, M Jerrum Algorithmica 38, 471-500, 2004	212	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	191	2007
On Markov chains for independent sets M Dyer, C Greenhill Journal of Algorithms 35 (1), 17-49, 2000	190	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	125	2005
The complexity of counting colourings and independent sets in sparse graphs and hypergraphs C Greenhill computational complexity 9, 52-72, 2000	112	2000
A more rapidly mixing Markov chain for graph colorings M Dyer, C Greenhill Random Structures & Algorithms 13 (3‐4), 285-317, 1998	89	1998
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	87	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	80	2015
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	78	2006
Criminal network vulnerabilities and adaptations D Bright, C Greenhill, T Britz, A Ritter, C Morselli Global Crime 18 (4), 424-441, 2017	71	2017
Random walks on combinatorial objects M Dyer, C Greenhill London Mathematical Society Lecture Note Series, 101-136, 1999	68	1999
The switch Markov chain for sampling irregular graphs C Greenhill Proceedings of the twenty-sixth annual acm-siam symposium on discrete …, 2014	64	2014
Polynomial-time counting and sampling of two-rowed contingency tables M Dyer, C Greenhill Theoretical Computer Science 246 (1-2), 265-278, 2000	64	2000
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	62	1999
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	58	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	57	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	54	2011
The switch Markov chain for sampling irregular graphs and digraphs C Greenhill, M Sfragara Theoretical Computer Science 719, 1-20, 2018	50	2018
Dismantling criminal networks: Can node attributes play a role? DA Bright, C Greenhill, N Levenkova Crime and networks, 148-162, 2013	50	2013

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