default search action
Catherine S. Greenhill
Person information
- affiliation: UNSW Australia, Sydney, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
- [j55]Catherine S. Greenhill
, Mikhail Isaev
Degree sequences of sufficiently dense random uniform hypergraphs. Comb. Probab. Comput. 32(2): 183-224 (2023) - [j54]Catherine S. Greenhill, Bernard Mans
Balanced allocation on hypergraphs. J. Comput. Syst. Sci. 138: 103459 (2023) - [i19]Colin Cooper, Martin E. Dyer, Catherine S. Greenhill:
A triangle process on graphs with given degree sequence. CoRR abs/2301.08499 (2023) - 2022
- [j53]Peter J. Ayre, Amin Coja-Oghlan, Catherine S. Greenhill:
Lower Bounds on the Chromatic Number of Random Graphs. Comb. 42(5): 617-658 (2022) - [j52]Catherine S. Greenhill, Mikhail Isaev, Gary Liang:
Spanning trees in random regular uniform hypergraphs. Comb. Probab. Comput. 31(1): 29-53 (2022) - [j51]Péter L. Erdös, Catherine S. Greenhill, Tamás Róbert Mezei, István Miklós, Daniel Soltész, Lajos Soukup:
The mixing time of switch Markov chains: A unified approach. Eur. J. Comb. 99: 103421 (2022) - 2021
- [j50]Catherine S. Greenhill, Mikhail Isaev, Brendan D. McKay
Subgraph counts for dense random graphs with specified degrees. Comb. Probab. Comput. 30(3): 460-497 (2021) - [j49]Pu Gao, Catherine S. Greenhill
Mixing time of the switch Markov chain and stable degree sequences. Discret. Appl. Math. 291: 143-162 (2021) - [j48]Haya S. Aldosari, Catherine S. Greenhill:
The average number of spanning hypertrees in sparse uniform hypergraphs. Discret. Math. 344(1): 112192 (2021) - [j47]Martin E. Dyer
Sampling hypergraphs with given degrees. Discret. Math. 344(11): 112566 (2021) - [j46]Martin E. Dyer
Counting independent sets in graphs with bounded bipartite pathwidth. Random Struct. Algorithms 59(2): 204-237 (2021) - [c11]Catherine S. Greenhill:
Generating graphs randomly. BCC 2021: 133-186 - [c10]Colin Cooper, Martin E. Dyer
A Triangle Process on Regular Graphs. IWOCA 2021: 310-323 - 2020
- [j45]Daniel Altman, Catherine S. Greenhill, Mikhail Isaev
A threshold result for loose Hamiltonicity in random regular uniform hypergraphs. J. Comb. Theory B 142: 307-373 (2020) - [c9]Catherine S. Greenhill, Bernard Mans
Balanced Allocation on Dynamic Hypergraphs. APPROX-RANDOM 2020: 11:1-11:22 - [i18]Ryan L. Mann
On the Parameterised Complexity of Induced Multipartite Graph Parameters. CoRR abs/2004.09938 (2020) - [i17]Catherine S. Greenhill, Bernard Mans, Ali Pourmiri:
Balanced Allocation on Dynamic Hypergraphs. CoRR abs/2006.07588 (2020) - [i16]Martin E. Dyer, Catherine S. Greenhill, Pieter Kleer, James Ross, Leen Stougie:
Sampling hypergraphs with given degrees. CoRR abs/2006.12021 (2020) - [i15]Colin Cooper, Martin E. Dyer, Catherine S. Greenhill:
A triangle process on regular graphs. CoRR abs/2012.12972 (2020)
2010 – 2019
- 2019
- [j44]Pu Gao, Catherine S. Greenhill:
Uniform Generation of Spanning Regular Subgraphs of a Dense Graph. Electron. J. Comb. 26(4): 4 (2019) - [j43]Colin Cooper, Martin E. Dyer
The flip Markov chain for connected regular graphs. Discret. Appl. Math. 254: 56-79 (2019) - [j42]Haya S. Aldosari, Catherine S. Greenhill:
Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges. Eur. J. Comb. 77: 68-77 (2019) - [j41]Peter J. Ayre, Amin Coja-Oghlan, Catherine S. Greenhill:
Hypergraph coloring up to condensation. Random Struct. Algorithms 54(4): 615-652 (2019) - [j40]Peter J. Ayre, Catherine S. Greenhill:
Rigid Colorings of Hypergraphs and Contiguity. SIAM J. Discret. Math. 33(3): 1575-1606 (2019) - [c8]Martin E. Dyer
Counting Independent Sets in Graphs with Bounded Bipartite Pathwidth. WG 2019: 298-310 - [i14]Péter L. Erdös, Catherine S. Greenhill, Tamás Róbert Mezei, István Miklós, Daniel Soltész, Lajos Soukup:
The mixing time of the swap (switch) Markov chains: a unified approach. CoRR abs/1903.06600 (2019) - [i13]Colin Cooper, Martin E. Dyer, Catherine S. Greenhill:
Triangle-creation processes on cubic graphs. CoRR abs/1905.04490 (2019) - 2018
- [j39]Catherine S. Greenhill, Matteo Sfragara
The switch Markov chain for sampling irregular graphs and digraphs. Theor. Comput. Sci. 719: 1-20 (2018) - [i12]Pu Gao, Catherine S. Greenhill:
Uniform generation of spanning regular subgraphs of a dense graph. CoRR abs/1807.00964 (2018) - [i11]Martin E. Dyer, Catherine S. Greenhill, Haiko Müller:
Counting independent sets in graphs with bounded bipartite pathwidth. CoRR abs/1812.03195 (2018) - [i10]Peter J. Ayre, Amin Coja-Oghlan, Catherine S. Greenhill:
Lower bounds on the chromatic number of random graphs. CoRR abs/1812.09691 (2018) - 2017
- [j38]Catherine S. Greenhill, Mikhail Isaev
The average number of spanning trees in sparse graphs with given degrees. Eur. J. Comb. 63: 6-25 (2017) - [i9]Colin Cooper, Martin E. Dyer, Catherine S. Greenhill, Andrew J. Handley:
The flip Markov chain for connected regular graphs. CoRR abs/1701.03856 (2017) - [i8]Catherine S. Greenhill, Matteo Sfragara:
The switch Markov chain for sampling irregular graphs and digraphs. CoRR abs/1701.07101 (2017) - 2016
- [j37]Vladimir M. Blinovsky, Catherine S. Greenhill:
Asymptotic Enumeration of Sparse Uniform Linear Hypergraphs with Given Degrees. Electron. J. Comb. 23(3): 3 (2016) - [j36]Vladimir M. Blinovsky, Catherine S. Greenhill:
Asymptotic enumeration of sparse uniform hypergraphs with given degrees. Eur. J. Comb. 51: 287-296 (2016) - [j35]Magnus Bordewich
Mixing of the Glauber dynamics for the ferromagnetic Potts model. Random Struct. Algorithms 48(1): 21-52 (2016) - 2015
- [j34]Martin E. Dyer
On the chromatic number of a random hypergraph. J. Comb. Theory B 113: 68-122 (2015) - [c7]Catherine S. Greenhill:
The switch Markov chain for sampling irregular graphs (Extended Abstract). SODA 2015: 1564-1572 - [i7]Peter J. Ayre, Amin Coja-Oghlan, Catherine S. Greenhill:
Hypergraph coloring up to condensation. CoRR abs/1508.01841 (2015) - 2014
- [j33]Catherine S. Greenhill, Matthew Kwan
On the Number of Spanning Trees in Random Regular Graphs. Electron. J. Comb. 21(1): 1 (2014) - [i6]Catherine S. Greenhill:
The switch Markov chain for sampling irregular graphs. CoRR abs/1412.5249 (2014) - 2013
- [j32]Catherine S. Greenhill, Brendan D. McKay
Asymptotic Enumeration of Sparse Multigraphs with Given Degrees. SIAM J. Discret. Math. 27(4): 2064-2089 (2013) - [i5]Catherine S. Greenhill, Mario Ullrich:
Heat-bath Markov chains have no negative eigenvalues. CoRR abs/1301.4055 (2013) - [i4]Magnus Bordewich, Catherine S. Greenhill, Viresh Patel:
Mixing of the Glauber dynamics for the ferromagnetic Potts model. CoRR abs/1305.0776 (2013) - 2012
- [i3]Catherine S. Greenhill:
Making Markov chains less lazy. CoRR abs/1203.6668 (2012) - [i2]Martin E. Dyer, Alan M. Frieze, Catherine S. Greenhill:
On the chromatic number of a random hypergraph. CoRR abs/1208.0812 (2012) - 2011
- [j31]Catherine S. Greenhill:
A Polynomial Bound on the Mixing Time of a Markov Chain for Sampling Regular Directed Graphs. Electron. J. Comb. 18(1) (2011) - 2010
- [j30]E. Rodney Canfield, Zhicheng Gao, Catherine S. Greenhill, Brendan D. McKay
Asymptotic enumeration of correlation-immune boolean functions. Cryptogr. Commun. 2(1): 111-126 (2010) - [j29]Catherine S. Greenhill, Svante Janson, Andrzej Rucinski
On the Number of Perfect Matchings in Random Lifts. Comb. Probab. Comput. 19(5-6): 791-817 (2010)
2000 – 2009
- 2009
- [j28]Catherine S. Greenhill, Brendan D. McKay
Random dense bipartite graphs and directed graphs with specified degrees. Random Struct. Algorithms 35(2): 222-249 (2009) - [i1]E. Rodney Canfield, Zhicheng Gao, Catherine S. Greenhill, Brendan D. McKay, Robert W. Robinson:
Asymptotic enumeration of correlation-immune boolean functions. IACR Cryptol. ePrint Arch. 2009: 460 (2009) - 2008
- [j27]Catherine S. Greenhill, Brendan D. McKay
Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums. Adv. Appl. Math. 41(4): 459-481 (2008) - [j26]Catherine S. Greenhill, Fred B. Holt, Nicholas C. Wormald:
Expansion properties of a random regular graph after random vertex deletions. Eur. J. Comb. 29(5): 1139-1150 (2008) - [j25]E. Rodney Canfield, Catherine S. Greenhill, Brendan D. McKay
Asymptotic enumeration of dense 0-1 matrices with specified line sums. J. Comb. Theory A 115(1): 32-66 (2008) - [j24]Nicholas J. Cavenagh, Catherine S. Greenhill, Ian M. Wanless:
The cycle structure of two rows in a random Latin square. Random Struct. Algorithms 33(3): 286-309 (2008) - 2007
- [j23]Colin Cooper, Martin E. Dyer
Sampling Regular Graphs and a Peer-to-Peer Network. Comb. Probab. Comput. 16(4): 557-593 (2007) - 2006
- [j22]Catherine S. Greenhill, Andrzej Rucinski:
Neighbour-Distinguishing Edge Colourings of Random Regular Graphs. Electron. J. Comb. 13(1) (2006) - [j21]Catherine S. Greenhill, Brendan D. McKay
Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums. J. Comb. Theory A 113(2): 291-324 (2006) - [j20]Stefanie Gerke, Catherine S. Greenhill, Nicholas C. Wormald:
The generalized acyclic edge chromatic number of random regular graphs. J. Graph Theory 53(2): 101-125 (2006) - 2005
- [j19]Gunnar Brinkmann, Sam Greenberg, Catherine S. Greenhill, Brendan D. McKay
Generation of simple quadrangulations of the sphere. Discret. Math. 305(1-3): 33-54 (2005) - [j18]Catherine S. Greenhill, Oleg Pikhurko:
Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs. Graphs Comb. 21(4): 407-419 (2005) - [c6]Colin Cooper, Martin E. Dyer, Catherine S. Greenhill:
Sampling regular graphs and a peer-to-peer network. SODA 2005: 980-988 - 2004
- [j17]Martin E. Dyer
The Relative Complexity of Approximate Counting Problems. Algorithmica 38(3): 471-500 (2004) - [j16]Catherine S. Greenhill, Andrzej Rucinski
Random Hypergraph Processes with Degree Restrictions. Graphs Comb. 20(3): 319-332 (2004) - [j15]Catherine S. Greenhill, Jeong Han Kim, Nicholas C. Wormald:
Hamiltonian decompositions of random bipartite regular graphs. J. Comb. Theory B 90(2): 195-222 (2004) - [j14]Martin E. Dyer
Corrigendum: The complexity of counting graph homomorphisms. Random Struct. Algorithms 25(3): 346-352 (2004) - 2003
- [j13]Catherine S. Greenhill, Andrzej Rucinski
Connectedness Of The Degree Bounded Star Process. Comb. Probab. Comput. 12(3): 269-283 (2003) - 2002
- [j12]Martin E. Dyer
Convergence Of The Iterated Prisoner's Dilemma Game. Comb. Probab. Comput. 11(2): 135-147 (2002) - [j11]Catherine S. Greenhill, Svante Janson, Jeong Han Kim, Nicholas C. Wormald:
Permutation Pseudographs And Contiguity. Comb. Probab. Comput. 11(3): 273-298 (2002) - [j10]Martin E. Dyer
Very rapid mixing of the Glauber dynamics for proper colorings on bounded-degree graphs. Random Struct. Algorithms 20(1): 98-114 (2002) - 2000
- [j9]Catherine S. Greenhill:
The complexity of counting colourings and independent sets in sparse graphs and hypergraphs. Comput. Complex. 9(1): 52-72 (2000) - [j8]Martin E. Dyer
On Markov Chains for Independent Sets. J. Algorithms 35(1): 17-49 (2000) - [j7]Catherine S. Greenhill:
An Algorithm for Recognising the Exterior Square of a Multiset. LMS J. Comput. Math. 3: 96-116 (2000) - [j6]Martin E. Dyer, Catherine S. Greenhill:
The complexity of counting graph homomorphisms. Random Struct. Algorithms 17(3-4): 260-289 (2000) - [j5]Martin E. Dyer
An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings. SIAM J. Comput. 30(6): 1962-1975 (2000) - [j4]Martin E. Dyer
Polynomial-time counting and sampling of two-rowed contingency tables. Theor. Comput. Sci. 246(1-2): 265-278 (2000) - [c5]Martin E. Dyer
On the relative complexity of approximate counting problems. APPROX 2000: 108-119 - [c4]Martin E. Dyer, Catherine S. Greenhill:
The complexity of counting graph homomorphisms (extended abstract). SODA 2000: 246-255 - [c3]Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher:
An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract). SODA 2000: 616-624
1990 – 1999
- 1999
- [j3]Russ Bubley
On Approximately Counting Colorings of Small Degree Graphs. SIAM J. Comput. 29(2): 387-400 (1999) - 1998
- [j2]Martin E. Dyer, Catherine S. Greenhill:
A more rapidly mixing Markov chain for graph colorings. Random Struct. Algorithms 13(3-4): 285-317 (1998) - [c2]Martin E. Dyer
A Genuinely Polynomial-Time Algorithms for Sampling Two-Rowed Contingency Tables. ICALP 1998: 339-350 - [c1]Russ Bubley, Martin E. Dyer, Catherine S. Greenhill:
Beating the 2 Delta Bound for Approximately Counting Colourings: A Computer-Assisted Proof of Rapid Mixing. SODA 1998: 355-363 - 1995
- [j1]Catherine S. Greenhill:
Theoretical and Experimental Comparison of Efficiency of Finite Field Extensions. J. Symb. Comput. 20(4): 419-429 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: