Professor Catherine   Greenhill
Professor

Professor Catherine Greenhill

  • D.Phil., University of Oxford, 1996.
  • M.Sc. (Research) in Combinatorics, University of Queensland, 1992.
  • B.Sc. (Hons) in Pure Mathematics, University of Queensland, 1991.
Science
Sch of Mathematics & Statistic

I started my academic career as an undergraduate at the University of Queensland, before obtaining my doctorate from the University of Oxford (1992). I held postdoctoral positions at the University of Leeds and at the University of Melbourne, before joining UNSW in 2002.  Today I am a Professor and head of the Combinatorics group in the School of Mathematics and Statistics, UNSW Sydney. My research interests lie in asymptotic, probabilistic and algorithmic combinatorics.  I was awarded the Christopher Heyde Medal by the Australian Academy of Science in 2015 and was promoted to Professor in 2019. My work lies at the interface between discrete mathematics, theoretical computer science and probability, and has been applied by researchers in various areas including physics, computer science and criminology.

Phone
9385 7105
Location
School of Mathematics and Statistics UNSW Sydney NSW 2052, AUSTRALIA The Red Centre Room 5105

Publications

  • Book Chapters | 2013
    Professor Catherine Greenhill
    Bright DA; Greenhill C; Levenkova N, 2013, 'Dismantling criminal networks: can node attributes play a role?', in Morselli C (ed.), Crime and Networks, Routledge, pp. 148 - 162, http://dx.doi.org/10.4324/9781315885018
    Book Chapters | 2013
    Professor Catherine Greenhill
    Bright DA; Greenhill C; Levenkova N, 2013, 'Dismantling criminal networks: Can node attributes play a role?', in Crime and Networks, pp. 148 - 162, http://dx.doi.org/10.4324/9781315885018-16
    Books | 2002
    Professor Catherine Greenhill
    Greenhill CS, 2002, Proceedings of FPSAC 2002, Brak R; Foda O; Greenhill C; Guttmann T; Owczarek A, (eds.), The University of Melbourne, Melbourne
    Book Chapters | 1999
    Professor Catherine Greenhill
    Dyer M; Greenhill C, 1999, 'Random walks on combinatorial objects', in Lamb JD; Preece DA; Preece DA (ed.), Surveys in Combinatorics, Cambridge University Press, Cambridge, pp. 101 - 136
  • Journal articles | 2021
    Professor Catherine Greenhill
    Cooper C; Dyer M; Greenhill C, 2021, 'A Triangle Process on Regular Graphs', , pp. 310 - 323, http://dx.doi.org/10.1007/978-3-030-79987-8_22
    Journal articles | 2021
    Professor Catherine Greenhill
    Gao P; Greenhill C, 2021, 'Mixing time of the switch Markov chain and stable degree sequences', Discrete Applied Mathematics, vol. 291, pp. 143 - 162, http://dx.doi.org/10.1016/j.dam.2020.12.004
    Journal articles | 2021
    Professor Catherine Greenhill
    Dyer M; Greenhill C; Müller H, 2021, 'Counting independent sets in graphs with bounded bipartite pathwidth', Random Structures and Algorithms, http://dx.doi.org/10.1002/rsa.21003
    Journal articles | 2021
    Professor Catherine Greenhill
    Greenhill C; Isaev M; Liang G, 2021, 'Spanning trees in random regular uniform hypergraphs', Combinatorics Probability and Computing, http://dx.doi.org/10.1017/S0963548321000158
    Journal articles | 2021
    Professor Catherine Greenhill
    Aldosari HS; Greenhill C, 2021, 'The average number of spanning hypertrees in sparse uniform hypergraphs', Discrete Mathematics, vol. 344, http://dx.doi.org/10.1016/j.disc.2020.112192
    Journal articles | 2021
    Professor Catherine Greenhill
    Chen C; Greenhill C, 2021, 'Threshold functions for substructures in random subsets of finite vector spaces', JOURNAL OF COMBINATORICS, vol. 12, pp. 157 - 183, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000605448000006&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1
    Journal articles | 2020
    Professor Catherine Greenhill
    Greenhill C; Isaev M; Mckay BD, 2020, 'Subgraph counts for dense random graphs with specified degrees', Combinatorics Probability and Computing, http://dx.doi.org/10.1017/S0963548320000498
    Journal articles | 2020
    Professor Catherine Greenhill
    Altman D; Greenhill C; Isaev M; Ramadurai R, 2020, 'A threshold result for loose Hamiltonicity in random regular uniform hypergraphs', Journal of Combinatorial Theory. Series B, vol. 142, pp. 307 - 373, http://dx.doi.org/10.1016/j.jctb.2019.11.001
    Journal articles | 2019
    Professor Catherine Greenhill
    Ayre P; Greenhill C, 2019, 'Rigid colorings of hypergraphs and contiguity', SIAM Journal on Discrete Mathematics, vol. 33, pp. 1575 - 1606, http://dx.doi.org/10.1137/18M1207211
    Journal articles | 2019
    Professor Catherine Greenhill
    Ayre P; Coja-Oghlan A; Greenhill C, 2019, 'Hypergraph coloring up to condensation', Random Structures and Algorithms, vol. 54, pp. 615 - 652, http://dx.doi.org/10.1002/rsa.20824
    Journal articles | 2019
    Professor Catherine Greenhill
    Aldosari HS; Greenhill C, 2019, 'Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges', European Journal of Combinatorics, vol. 77, pp. 68 - 77, http://dx.doi.org/10.1016/j.ejc.2018.11.002
    Journal articles | 2019
    Professor Catherine Greenhill
    Cooper C; Dyer M; Greenhill C; Handley A, 2019, 'The flip Markov chain for connected regular graphs', Discrete Applied Mathematics, vol. 254, pp. 56 - 79, http://dx.doi.org/10.1016/j.dam.2018.06.019
    Journal articles | 2019
    Professor Catherine Greenhill
    Dyer M; Greenhill C; Müller H, 2019, 'Counting Independent Sets in Graphs with Bounded Bipartite Pathwidth', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11789 LNCS, pp. 298 - 310, http://dx.doi.org/10.1007/978-3-030-30786-8_23
    Journal articles | 2019
    Professor Catherine Greenhill
    Gao P; Greenhill C, 2019, 'Uniform generation of spanning regular subgraphs of a dense graph', Electronic Journal of Combinatorics, vol. 26, http://dx.doi.org/10.37236/8251
    Journal articles | 2019
    Professor Catherine Greenhill
    Erdős PL; Greenhill CS; Mezei TR; Miklós I; Soltész D; Soukup L, 2019, 'Mixing time of the swap Markov chain and P-stability', Acta Mathematica Universitatis Comenianae, vol. 88, pp. 659 - 665, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000484349000047&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1
    Journal articles | 2018
    Professor Catherine Greenhill
    Greenhill C; Sfragara M, 2018, 'The switch Markov chain for sampling irregular graphs and digraphs', Theoretical Computer Science, vol. 719, pp. 1 - 20, http://dx.doi.org/10.1016/j.tcs.2017.11.010
    Journal articles | 2017
    Professor Catherine Greenhill
    Bright D; Greenhill C; Britz T; Ritter A; Morselli C, 2017, 'Criminal network vulnerabilities and adaptations', Global Crime, vol. 18, pp. 424 - 441, http://dx.doi.org/10.1080/17440572.2017.1377614
    Journal articles | 2017
    Professor Catherine Greenhill
    Greenhill C; Isaev M; Kwan M; McKay BD, 2017, 'The average number of spanning trees in sparse graphs with given degrees', European Journal of Combinatorics, vol. 63, pp. 6 - 25, http://dx.doi.org/10.1016/j.ejc.2017.02.003
    Journal articles | 2016
    Professor Catherine Greenhill
    Blinovsky V; Greenhill C, 2016, 'Asymptotic enumeration of sparse uniform hypergraphs with given degrees', European Journal of Combinatorics, vol. 51, pp. 287 - 296, http://dx.doi.org/10.1016/j.ejc.2015.06.004
    Journal articles | 2016
    Professor Catherine Greenhill
    Blinovsky V; Greenhill C, 2016, 'Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees', ELECTRONIC JOURNAL OF COMBINATORICS, vol. 23, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000385228300003&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1
    Journal articles | 2015
    Professor Catherine Greenhill
    Bright DA; Greenhill C; Ritter A; Morselli C, 2015, 'Networks within networks: using multiple link types to examine network structure and identify key actors in a drug trafficking operation', Global Crime, vol. 16, pp. 219 - 237, http://dx.doi.org/10.1080/17440572.2015.1039164
    Journal articles | 2015
    Professor Catherine Greenhill
    Bright DA; Greenhill C; Reynolds M; Ritter A; Morselli C, 2015, 'The Use of Actor-Level Attributes and Centrality Measures to Identify Key Actors: A Case Study of an Australian Drug Trafficking Network', Journal of Contemporary Criminal Justice, vol. 31, pp. 262 - 278, http://dx.doi.org/10.1177/1043986214553378
    Journal articles | 2015
    Professor Catherine Greenhill
    Dyer M; Frieze A; Greenhill C, 2015, 'On the chromatic number of a random hypergraph', Journal of Combinatorial Theory. Series B, vol. 113, pp. 68 - 122, http://dx.doi.org/10.1016/j.jctb.2015.01.002
    Journal articles | 2014
    Professor Catherine Greenhill
    Greenhill C; Kwan M; Wind D, 2014, 'On the number of spanning trees in random regular graphs', Electronic Journal of Combinatorics, vol. 21, http://dx.doi.org/10.37236/3752
    Journal articles | 2014
    Professor Catherine Greenhill
    Bordewich M; Greenhill C; Patel V, 2014, 'Mixing of the Glauber dynamics for the ferromagnetic Potts model', Random Structures & Algorithms, vol. 48, pp. n/a - n/a, http://dx.doi.org/10.1002/rsa.20569
    Journal articles | 2014
    Professor Catherine Greenhill
    Dyer M; Greenhill C; Ullrich M, 2014, 'Structure and eigenvalues of heat-bath Markov chains', Linear Algebra and Its Applications, vol. 454, pp. 57 - 71, http://dx.doi.org/10.1016/j.laa.2014.04.018
    Journal articles | 2013
    Professor Catherine Greenhill
    Greenhill C; Mckay BD, 2013, 'Asymptotic enumeration of sparse multigraphs with given degrees', SIAM Journal on Discrete Mathematics, vol. 27, pp. 2064 - 2089, http://dx.doi.org/10.1137/130913419
    Journal articles | 2012
    Professor Catherine Greenhill
    Greenhill CS; McKay BD, 2012, 'Counting loopy graphs with given degrees', Linear Algebra and its Applications, vol. 436, pp. 901 - 926, http://dx.doi.org/10.1016/j.laa.2011.03.052
    Journal articles | 2011
    Professor Catherine Greenhill
    Greenhill CS, 2011, 'A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs', Electronic Journal of Combinatorics, vol. 18, pp. #234 (49pp)
    Journal articles | 2010
    Professor Catherine Greenhill
    Greenhill CS; Janson S; Rucinski A, 2010, 'On the number of perfect matchings in random lifts', Combinatorics Probability and Computing, vol. 19, pp. 791 - 817, http://dx.doi.org/10.1017/S0963548309990654
    Journal articles | 2010
    Professor Catherine Greenhill
    Canfield ER; Gao Z; Greenhill CS; McKay BD; Robinson RW, 2010, 'Asymptotic enumeration of correlation-immune boolean functions', Cryptography and Communications, vol. 2, pp. 111 - 126, http://dx.doi.org/10.1007/s12095-010-0019-x
    Journal articles | 2009
    Professor Catherine Greenhill
    Greenhill CS; McKay BD, 2009, 'Random dense bipartite graphs and directed graphs with specified degrees', Random Structures and Algorithms, vol. 35, pp. 222 - 249, http://dx.doi.org/10.1002/rsa.20273
    Journal articles | 2008
    Professor Catherine Greenhill
    Canfield E; Greenhill CS; McKay BD, 2008, 'Asymptoic enumeration of dense 0-1 matrices with specified line sums', Journal of Combinatorial Theory Series A, vol. 115, pp. 32 - 66, http://dx.doi.org/10.1016/j.jcta.2007.03.009
    Journal articles | 2008
    Professor Catherine Greenhill
    Cavenagh N; Greenhill CS; Wanless IM, 2008, 'The cycle structure of two rows in a random Latin square', Random Structures and Algorithms, vol. 33, pp. 286 - 309, http://dx.doi.org/10.1002/rsa.20216
    Journal articles | 2008
    Professor Catherine Greenhill
    Greenhill CS; McKay BD, 2008, 'Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums', Advances in Applied Mathematics, vol. 41, pp. 459 - 481, http://dx.doi.org/10.1016/j.aam.2008.01.002
    Journal articles | 2008
    Professor Catherine Greenhill
    Greenhill CS; Holt F; Wormald NC, 2008, 'Expansion properties of a random regular graph after random vertex deletions', European Journal of Combinatorics, vol. 29, pp. 1139 - 1150, http://dx.doi.org/10.1016/j.ejc.2007.06.021
    Journal articles | 2007
    Professor Catherine Greenhill
    Cooper C; Dyer M; Greenhill CS, 2007, 'Sampling regular graphs and a peer-to-peer network', Combinatorics Probability and Computing, vol. 16, pp. 557 - 593, http://dx.doi.org/10.1017/S0963548306007978
    Journal articles | 2006
    Professor Catherine Greenhill
    Greenhill CS; McKay BD; Wang XJ, 2006, 'Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums', Journal of Combinatorial Theory Series A, vol. 113, pp. 291 - 324, http://dx.doi.org/10.1016/j.jcta.2005.03.005
    Journal articles | 2006
    Professor Catherine Greenhill
    Gerke S; Greenhill CS; Wormald NC, 2006, 'The generalized acyclic edge chromatic number of random regular graphs', Journal of Graph Theory, vol. 53, pp. 101 - 125, http://dx.doi.org/10.1002/jgt.20167
    Journal articles | 2006
    Professor Catherine Greenhill
    Greenhill CS; Rucinski A, 2006, 'Neighbour-distinguishing edge colourings of random regular graphs', Electronic Journal of Combinatorics, vol. 13, pp. 1 - 12
    Journal articles | 2005
    Professor Catherine Greenhill
    Greenhill CS; Pikhurko O, 2005, 'Bounds on the generalised acyclic chronatic numbers of bounded degree graphs', Graphs and Combinatorics, vol. 21, pp. 407 - 419, http://dx.doi.org/10.1007/s00373-005-0635-y
    Journal articles | 2005
    Professor Catherine Greenhill
    Brinkmann G; Greenberg S; Greenhill CS; McKay BD; Thomas R; Wollan P, 2005, 'Generation of simple quadrangulations of the sphere', Discrete Mathematics, vol. 305, pp. 33 - 54, http://dx.doi.org/10.1016/j.disc.2005.10.005
    Journal articles | 2005
    Professor Catherine Greenhill
    Cooper C; Dyer M; Greenhill C, 2005, 'Sampling regular graphs and a peer-to-peer network', Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 980 - 988
    Journal articles | 2004
    Professor Catherine Greenhill
    Greenhill CS; Dyer M, 2004, 'Corrigendum: The complexity of counting graph homomorphisms (Vol 17, pg 260, 2000)', Random Structures and Algorithms, vol. 25, pp. 346 - 352, http://dx.doi.org/10.1002/rsa.20036
    Journal articles | 2004
    Professor Catherine Greenhill
    Greenhill C; Kim JH; Wormald NC, 2004, 'Hamiltonian decompositions of random bipartite regular graphs', Journal of Combinatorial Theory. Series B, vol. 90, pp. 195 - 222, http://dx.doi.org/10.1016/j.jctb.2003.07.001
    Journal articles | 2004
    Professor Catherine Greenhill
    Greenhill CS; Rucinski A; Wormald NC, 2004, 'Random hypergraph processes with degree restrictions', Graphs and Combinatorics, vol. 20, pp. 319 - 332, http://dx.doi.org/10.1007/s00373-004-0571-2
    Journal articles | 2003
    Professor Catherine Greenhill
    Dyer M; Goldberg LA; Greenhill C; Jerrum M, 2003, 'The relative complexity of approximate counting problems', Algorithmica (New York), vol. 38, pp. 471 - 500, http://dx.doi.org/10.1007/s00453-003-1073-y
    Journal articles | 2003
    Professor Catherine Greenhill
    Greenhill C; Ruciski A; Wormald N, 2003, 'Connectedness of the Degree Bounded Star Process', Combinatorics, Probability and Computing, vol. 12, pp. 269 - 283, http://dx.doi.org/10.1017/S0963548302005357
    Journal articles | 2002
    Professor Catherine Greenhill
    Dyer M; Greenhill C; Molloy M, 2002, 'Very Rapid Mixing of the Glauber Dynamics for Proper Colorings on Bounded-Degree Graphs', Random Structures and Algorithms, vol. 20, pp. 98 - 114, http://dx.doi.org/10.1002/rsa.10020
    Journal articles | 2002
    Professor Catherine Greenhill
    Dyer M; Goldberg LA; Greenhill C; Istrate G; Jerrum M, 2002, 'Convergence of the iterated prisoner's dilemma game', Combinatorics Probability and Computing, vol. 11, pp. 135 - 147, http://dx.doi.org/10.1017/S096354830100503X
    Journal articles | 2002
    Professor Catherine Greenhill
    Greenhill C; Janson S; Kim J; Wormald N, 2002, 'Permutation Pseudographs and Contiguity', Combinatorics, Probability and Computing, vol. 11, pp. 273 - 298, http://dx.doi.org/10.1017/S0963548301005065
    Journal articles | 2000
    Professor Catherine Greenhill
    Greenhill C, 2000, 'The complexity of counting colourings and independent sets in sparse graphs and hypergraphs', Computational Complexity, vol. 9, pp. 52 - 72, http://dx.doi.org/10.1007/PL00001601
    Journal articles | 2000
    Professor Catherine Greenhill
    Dyer M; Greenhill C, 2000, 'Polynomial-time counting and sampling of two-rowed contingency tables', Theoretical Computer Science, vol. 246, pp. 265 - 278, http://dx.doi.org/10.1016/S0304-3975(99)00136-X
    Journal articles | 2000
    Professor Catherine Greenhill
    Dyer M; Leslie Goldberg A; Greenhill C; Jerrum M; Mitzenmacheru M, 2000, 'An extension of path coupling and its application to the glauber dynamics for graph colorings', SIAM Journal on Computing, vol. 30, pp. 1962 - 1975, http://dx.doi.org/10.1137/s0097539700372708
    Journal articles | 2000
    Professor Catherine Greenhill
    Dyer M; Greenhill C, 2000, 'The complexity of counting graph homomorphisms', Random Structures and Algorithms, vol. 17, pp. 260 - 289, http://dx.doi.org/10.1002/1098-2418(200010/12)17:3/4<260::aid-rsa5>3.0.co;2-w
    Journal articles | 2000
    Professor Catherine Greenhill
    Dyer M; Greenhill C, 2000, 'On Markov Chains for Independent Sets', Journal of Algorithms, vol. 35, pp. 17 - 49, http://dx.doi.org/10.1006/jagm.1999.1071
    Journal articles | 2000
    Professor Catherine Greenhill
    Dyer M; Goldberg LA; Greenhill C; Jerrum M; Mitzenmacher M, 2000, 'Extension of path coupling and its application to the Glauber dynamics for graph colourings', Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 616 - 624
    Journal articles | 2000
    Professor Catherine Greenhill
    Dyer M; Greenhill C, 2000, 'Complexity of counting graph homomorphisms', Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 246 - 255
    Journal articles | 1999
    Professor Catherine Greenhill
    Greenhill C, 1999, 'An algorithm for recognising the exterior square of a matrix', Linear and Multilinear Algebra, vol. 46, pp. 213 - 244, http://dx.doi.org/10.1080/03081089908818615
    Journal articles | 1999
    Professor Catherine Greenhill
    Bubley R; Dyer M; Greenhill C; Jerrum M, 1999, 'On approximately counting colorings of small degree graphs', SIAM Journal on Computing, vol. 29, pp. 387 - 400, http://dx.doi.org/10.1137/S0097539798338175
    Journal articles | 1998
    Professor Catherine Greenhill
    Dyer M; Greenhill C, 1998, 'A genuinely polynomial-time algorithm for sampling two-rowed contingency tables', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1443 LNCS, pp. 339 - 350, http://dx.doi.org/10.1007/BFb0055065
    Journal articles | 1998
    Professor Catherine Greenhill
    Dyer M; Greenhill C, 1998, 'A more rapidly mixing Markov chain for graph colorings', Random Structures and Algorithms, vol. 13, pp. 285 - 317, http://dx.doi.org/10.1002/(sici)1098-2418(199810/12)13:3/4<285::aid-rsa6>3.0.co;2-r
    Journal articles | 1995
    Professor Catherine Greenhill
    Greenhill CS, 1995, 'Theoretical and Experimental Comparison of Efficiency of Finite Field Extensions', Journal of Symbolic Computation, vol. 20, pp. 419 - 429, http://dx.doi.org/10.1006/jsco.1995.1057
    Journal articles | 1995
    Professor Catherine Greenhill
    Greenhill CS; Street AP, 1995, 'Smallest defining sets of some small t-designs and relations to the Petersen graph', Utilitas Mathematica, vol. 48, pp. 5 - 31
    Journal articles | 1993
    Professor Catherine Greenhill
    Greenhill CS, 1993, 'An algorithm for finding smallest defining sets of t-designs', Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 14, pp. 39 - 60
    Journal articles |
    Professor Catherine Greenhill
    Dyer M; Greenhill C; Kleer P; Ross J; Stougie L, 'Sampling hypergraphs with given degrees', , http://arxiv.org/abs/2006.12021v2
    Journal articles |
    Professor Catherine Greenhill
    Greenhill C; Isaev M; Makai T; McKay BD, 'Degree sequences of sufficiently dense random uniform hypergraphs', , http://arxiv.org/abs/2106.08100v1
    Journal articles |
    Professor Catherine Greenhill
    Cooper C; Dyer M; Greenhill C, 'Triangle-creation processes on cubic graphs', , http://arxiv.org/abs/1905.04490v1
    Journal articles |
    Professor Catherine Greenhill
    Ayre P; Coja-Oghlan A; Greenhill C, 'Lower bounds on the chromatic number of random graphs', , http://arxiv.org/abs/1812.09691v3
    Journal articles |
    Professor Catherine Greenhill
    Cooper C; Dyer M; Greenhill C, 'Corrigendum: Sampling regular graphs and a peer-to-peer network', Corrigendum: Sampling regular graphs and a peer-to-peer network, http://arxiv.org/abs/1203.6111v1
    Journal articles |
    Professor Catherine Greenhill
    Mann RL; Mathieson L; Greenhill C, 'On the Parameterised Complexity of Induced Multipartite Graph Parameters', , http://arxiv.org/abs/2004.09938v1
  • Conference Papers | 2020
    Professor Catherine Greenhill
    Greenhill C; Mans B; Pourmiri A, 2020, 'Balanced allocation on dynamic hypergraphs', in Leibniz International Proceedings in Informatics, LIPIcs, http://dx.doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.11
    Conference Papers | 2015
    Professor Catherine Greenhill
    Greenhill CS, 2015, 'The switch Markov chain for sampling irregular graphs', in The 26th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM-SIAM, San Diego, CA, USA, pp. 1565 - 1572, presented at 26th annual ACM-SIAM Symposium on Discrete Algorithms, San Diego, CA, USA, 04 January 2015 - 06 January 2015, http://dx.doi.org/10.1137/1.9781611973730.103
    Conference Papers | 2000
    Professor Catherine Greenhill
    Dyer M; Goldberg LA; Greenhill C; Jerrum M, 2000, 'On the relative complexity of approximate counting problems', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 108 - 119, http://dx.doi.org/10.1007/3-540-44436-x_12
    Conference Papers | 2000
    Professor Catherine Greenhill
    Dyer M; Greenhill CS, 2000, 'An extension of path coupling and its application to the Glauber dynamics for graph colourings (Extended abstract)', in PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SIAM, New York-Philadelphia, pp. 616 - 624, presented at 11th Annual ACM-SIAM Symposium on Discrete Algorithms, SAN FRANCISCO, CA, 09 January 2000 - 11 January 2000, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000085602800082&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a
    Conference Papers | 2000
    Professor Catherine Greenhill
    Dyer M; Greenhill C, 2000, 'The complexity of counting graph homomorphisms (extended abstract)', in PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SIAM, SAN FRANCISCO, CA, pp. 246 - 255, presented at 11th Annual ACM/SIAM Symposium on Discrete Algorithms, SAN FRANCISCO, CA, 09 January 2000 - 11 January 2000, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000085602800035&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1
    Conference Papers | 1998
    Professor Catherine Greenhill
    Bubley R; Dyer M; Greenhill CS, 1998, 'Beating the $2\Delta$ bound for approximately counting colourings: a computer-assisted proof of rapid mixing', in The 9th Annual ACM-SIAM Symposium on Discrete Algorithms, New York-Philidelphia, pp. 355 - 363, 25 January 1998 - 27 January 1998

Awards

  • The Australian Academy of Science awarded the 2015 Christopher Heyde Medal in Pure Mathematics.
  • In 2013 I held the June Griffith Fellowship for Academic Women in Leadership, awarded by the Faculty of Science, UNSW.
  • I was awarded the 2010 Hall Medal by the Institute of Combinatorics and its Applications. This is an international mid-career medal for research in combinatorics.

Grants

  • ARC Discovery Grant 2019 - 2021, C.S. Greenhill, B.D. McKay (ANU) and M. Isaev (Monash), Hypergraph models for complex discrete systems.
  • ARC Discovery Grant 2014 – 2016, C.S. Greenhill and B.D. McKay (ANU), A new model for random discrete structures: distributions, sampling and counting.
  • ARC Discovery Grant 2012 – 2014, I.M. Wanless (Monash), C.S. Greenhill and R. Aharoni (Technion), Extremal problems in hypergraph matchings.
  • ARC Discovery Grant 2012 – 2013, D.A. Bright, C.S. Greenhill, A. Ritter and C. Morselli (Montreal), Illicit drug trafficking: the structure of illicit networks and implications for resilience and vulnerability.

Media