Catherine S. Greenhill

88 papers A* 6B 1C 1Journal 77Unranked 3

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Decomposing random regular graphs into stars. Eur. J. Comb. Michelle Delcourt, Catherine S. Greenhill, Mikhail Isaev, Bernard Lidický, Luke Postle
2025	J	`jnl`	The random CoRR Arnab Chatterjee, Amin Coja-Oghlan, Catherine S. Greenhill, Vincent Pfenninger, Maurice Rolvien, Pavel Zakharov, Kostas Zampetakis
2025	J	`jnl`	Triangle Processes on Graphs With Given Degree Sequence. Random Struct. Algorithms Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
2023	J	`jnl`	A triangle process on graphs with given degree sequence. CoRR Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
2023	J	`jnl`	Balanced allocation on hypergraphs. J. Comput. Syst. Sci. Catherine S. Greenhill, Bernard Mans, Ali Pourmiri
2023	J	`jnl`	Degree sequences of sufficiently dense random uniform hypergraphs. Comb. Probab. Comput. Catherine S. Greenhill, Mikhail Isaev, Tamás Makai, Brendan D. McKay
2022	J	`jnl`	Lower Bounds on the Chromatic Number of Random Graphs. Comb. Peter J. Ayre, Amin Coja-Oghlan, Catherine S. Greenhill
2022	J	`jnl`	Spanning trees in random regular uniform hypergraphs. Comb. Probab. Comput. Catherine S. Greenhill, Mikhail Isaev, Gary Liang
2022	J	`jnl`	The mixing time of switch Markov chains: A unified approach. Eur. J. Comb. Péter L. Erdös, Catherine S. Greenhill, Tamás Róbert Mezei, István Miklós, Daniel Soltész, Lajos Soukup
2021	C	`conf`	A Triangle Process on Regular Graphs. IWOCA Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
2021	J	`jnl`	Counting independent sets in graphs with bounded bipartite pathwidth. Random Struct. Algorithms Martin E. Dyer, Catherine S. Greenhill, Haiko Müller
2021	—	`conf`	Generating graphs randomly. BCC Catherine S. Greenhill
2021	J	`jnl`	Mixing time of the switch Markov chain and stable degree sequences. Discret. Appl. Math. Pu Gao, Catherine S. Greenhill
2021	J	`jnl`	Sampling hypergraphs with given degrees. Discret. Math. Martin E. Dyer, Catherine S. Greenhill, Pieter Kleer, James Ross, Leen Stougie
2021	J	`jnl`	Subgraph counts for dense random graphs with specified degrees. Comb. Probab. Comput. Catherine S. Greenhill, Mikhail Isaev, Brendan D. McKay
2021	J	`jnl`	The average number of spanning hypertrees in sparse uniform hypergraphs. Discret. Math. Haya S. Aldosari, Catherine S. Greenhill
2020	J	`jnl`	A threshold result for loose Hamiltonicity in random regular uniform hypergraphs. J. Comb. Theory B Daniel Altman, Catherine S. Greenhill, Mikhail Isaev, Reshma Ramadurai
2020	J	`jnl`	A triangle process on regular graphs. CoRR Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
2020	—	`conf`	Balanced Allocation on Dynamic Hypergraphs. APPROX-RANDOM Catherine S. Greenhill, Bernard Mans, Ali Pourmiri
2020	J	`jnl`	Balanced Allocation on Dynamic Hypergraphs. CoRR Catherine S. Greenhill, Bernard Mans, Ali Pourmiri
2020	J	`jnl`	On the Parameterised Complexity of Induced Multipartite Graph Parameters. CoRR Ryan L. Mann, Luke Mathieson, Catherine S. Greenhill
2020	J	`jnl`	Sampling hypergraphs with given degrees. CoRR Martin E. Dyer, Catherine S. Greenhill, Pieter Kleer, James Ross, Leen Stougie
2019	B	`conf`	Counting Independent Sets in Graphs with Bounded Bipartite Pathwidth. WG Martin E. Dyer, Catherine S. Greenhill, Haiko Müller
2019	J	`jnl`	Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges. Eur. J. Comb. Haya S. Aldosari, Catherine S. Greenhill
2019	J	`jnl`	Hypergraph coloring up to condensation. Random Struct. Algorithms Peter J. Ayre, Amin Coja-Oghlan, Catherine S. Greenhill
2019	J	`jnl`	Rigid Colorings of Hypergraphs and Contiguity. SIAM J. Discret. Math. Peter J. Ayre, Catherine S. Greenhill
2019	J	`jnl`	The flip Markov chain for connected regular graphs. Discret. Appl. Math. Colin Cooper, Martin E. Dyer, Catherine S. Greenhill, Andrew J. Handley
2019	J	`jnl`	The mixing time of the swap (switch) Markov chains: a unified approach. CoRR Péter L. Erdös, Catherine S. Greenhill, Tamás Róbert Mezei, István Miklós, Daniel Soltész, Lajos Soukup
2019	J	`jnl`	Triangle-creation processes on cubic graphs. CoRR Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
2019	J	`jnl`	Uniform Generation of Spanning Regular Subgraphs of a Dense Graph. Electron. J. Comb. Pu Gao, Catherine S. Greenhill
2018	J	`jnl`	Counting independent sets in graphs with bounded bipartite pathwidth. CoRR Martin E. Dyer, Catherine S. Greenhill, Haiko Müller
2018	J	`jnl`	Lower bounds on the chromatic number of random graphs. CoRR Peter J. Ayre, Amin Coja-Oghlan, Catherine S. Greenhill
2018	J	`jnl`	The switch Markov chain for sampling irregular graphs and digraphs. Theor. Comput. Sci. Catherine S. Greenhill, Matteo Sfragara
2018	J	`jnl`	Uniform generation of spanning regular subgraphs of a dense graph. CoRR Pu Gao, Catherine S. Greenhill
2017	J	`jnl`	The average number of spanning trees in sparse graphs with given degrees. Eur. J. Comb. Catherine S. Greenhill, Mikhail Isaev, Matthew Kwan, Brendan D. McKay
2017	J	`jnl`	The flip Markov chain for connected regular graphs. CoRR Colin Cooper, Martin E. Dyer, Catherine S. Greenhill, Andrew J. Handley
2017	J	`jnl`	The switch Markov chain for sampling irregular graphs and digraphs. CoRR Catherine S. Greenhill, Matteo Sfragara
2016	J	`jnl`	Asymptotic Enumeration of Sparse Uniform Linear Hypergraphs with Given Degrees. Electron. J. Comb. Vladimir M. Blinovsky, Catherine S. Greenhill
2016	J	`jnl`	Asymptotic enumeration of sparse uniform hypergraphs with given degrees. Eur. J. Comb. Vladimir M. Blinovsky, Catherine S. Greenhill
2016	J	`jnl`	Mixing of the Glauber dynamics for the ferromagnetic Potts model. Random Struct. Algorithms Magnus Bordewich, Catherine S. Greenhill, Viresh Patel
2015	J	`jnl`	Hypergraph coloring up to condensation. CoRR Peter J. Ayre, Amin Coja-Oghlan, Catherine S. Greenhill
2015	J	`jnl`	On the chromatic number of a random hypergraph. J. Comb. Theory B Martin E. Dyer, Alan M. Frieze, Catherine S. Greenhill
2015	A*	`conf`	The switch Markov chain for sampling irregular graphs (Extended Abstract). SODA Catherine S. Greenhill
2014	J	`jnl`	On the Number of Spanning Trees in Random Regular Graphs. Electron. J. Comb. Catherine S. Greenhill, Matthew Kwan, David Wind
2014	J	`jnl`	The switch Markov chain for sampling irregular graphs. CoRR Catherine S. Greenhill
2013	J	`jnl`	Asymptotic Enumeration of Sparse Multigraphs with Given Degrees. SIAM J. Discret. Math. Catherine S. Greenhill, Brendan D. McKay
2013	J	`jnl`	Heat-bath Markov chains have no negative eigenvalues CoRR Catherine S. Greenhill, Mario Ullrich
2013	J	`jnl`	Mixing of the Glauber dynamics for the ferromagnetic Potts model CoRR Magnus Bordewich, Catherine S. Greenhill, Viresh Patel
2012	J	`jnl`	Making Markov chains less lazy CoRR Catherine S. Greenhill
2012	J	`jnl`	On the chromatic number of a random hypergraph CoRR Martin E. Dyer, Alan M. Frieze, Catherine S. Greenhill
2011	J	`jnl`	A Polynomial Bound on the Mixing Time of a Markov Chain for Sampling Regular Directed Graphs. Electron. J. Comb. Catherine S. Greenhill
2010	J	`jnl`	Asymptotic enumeration of correlation-immune boolean functions. Cryptogr. Commun. E. Rodney Canfield, Zhicheng Gao, Catherine S. Greenhill, Brendan D. McKay, Robert W. Robinson
2010	J	`jnl`	On the Number of Perfect Matchings in Random Lifts. Comb. Probab. Comput. Catherine S. Greenhill, Svante Janson, Andrzej Rucinski
2009	J	`jnl`	Asymptotic enumeration of correlation-immune boolean functions. IACR Cryptol. ePrint Arch. E. Rodney Canfield, Zhicheng Gao, Catherine S. Greenhill, Brendan D. McKay, Robert W. Robinson
2009	J	`jnl`	Random dense bipartite graphs and directed graphs with specified degrees. Random Struct. Algorithms Catherine S. Greenhill, Brendan D. McKay
2008	J	`jnl`	Asymptotic enumeration of dense 0-1 matrices with specified line sums. J. Comb. Theory A E. Rodney Canfield, Catherine S. Greenhill, Brendan D. McKay
2008	J	`jnl`	Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums. Adv. Appl. Math. Catherine S. Greenhill, Brendan D. McKay
2008	J	`jnl`	Expansion properties of a random regular graph after random vertex deletions. Eur. J. Comb. Catherine S. Greenhill, Fred B. Holt, Nicholas C. Wormald
2008	J	`jnl`	The cycle structure of two rows in a random Latin square. Random Struct. Algorithms Nicholas J. Cavenagh, Catherine S. Greenhill, Ian M. Wanless
2007	J	`jnl`	Sampling Regular Graphs and a Peer-to-Peer Network. Comb. Probab. Comput. Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
2006	J	`jnl`	Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums. J. Comb. Theory A Catherine S. Greenhill, Brendan D. McKay, Xiaoji Wang
2006	J	`jnl`	Neighbour-Distinguishing Edge Colourings of Random Regular Graphs. Electron. J. Comb. Catherine S. Greenhill, Andrzej Rucinski
2006	J	`jnl`	The generalized acyclic edge chromatic number of random regular graphs. J. Graph Theory Stefanie Gerke, Catherine S. Greenhill, Nicholas C. Wormald
2005	J	`jnl`	Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs. Graphs Comb. Catherine S. Greenhill, Oleg Pikhurko
2005	J	`jnl`	Generation of simple quadrangulations of the sphere. Discret. Math. Gunnar Brinkmann, Sam Greenberg, Catherine S. Greenhill, Brendan D. McKay, Robin Thomas, Paul Wollan
2005	A*	`conf`	Sampling regular graphs and a peer-to-peer network. SODA Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
2004	J	`jnl`	Corrigendum: The complexity of counting graph homomorphisms. Random Struct. Algorithms Martin E. Dyer, Catherine S. Greenhill
2004	J	`jnl`	Hamiltonian decompositions of random bipartite regular graphs. J. Comb. Theory B Catherine S. Greenhill, Jeong Han Kim, Nicholas C. Wormald
2004	J	`jnl`	Random Hypergraph Processes with Degree Restrictions. Graphs Comb. Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald
2004	J	`jnl`	The Relative Complexity of Approximate Counting Problems. Algorithmica Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum
2003	J	`jnl`	Connectedness Of The Degree Bounded Star Process. Comb. Probab. Comput. Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald
2002	J	`jnl`	Convergence Of The Iterated Prisoner's Dilemma Game. Comb. Probab. Comput. Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Gabriel Istrate, Mark Jerrum
2002	J	`jnl`	Permutation Pseudographs And Contiguity. Comb. Probab. Comput. Catherine S. Greenhill, Svante Janson, Jeong Han Kim, Nicholas C. Wormald
2002	J	`jnl`	Very rapid mixing of the Glauber dynamics for proper colorings on bounded-degree graphs. Random Struct. Algorithms Martin E. Dyer, Catherine S. Greenhill, Michael Molloy
2000	J	`jnl`	An Algorithm for Recognising the Exterior Square of a Multiset. LMS J. Comput. Math. Catherine S. Greenhill
2000	J	`jnl`	An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings. SIAM J. Comput. Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher
2000	A*	`conf`	An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract). SODA Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher
2000	J	`jnl`	On Markov Chains for Independent Sets. J. Algorithms Martin E. Dyer, Catherine S. Greenhill
2000	—	`conf`	On the relative complexity of approximate counting problems. APPROX Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum
2000	J	`jnl`	Polynomial-time counting and sampling of two-rowed contingency tables. Theor. Comput. Sci. Martin E. Dyer, Catherine S. Greenhill
2000	J	`jnl`	The complexity of counting colourings and independent sets in sparse graphs and hypergraphs. Comput. Complex. Catherine S. Greenhill
2000	A*	`conf`	The complexity of counting graph homomorphisms (extended abstract). SODA Martin E. Dyer, Catherine S. Greenhill
2000	J	`jnl`	The complexity of counting graph homomorphisms. Random Struct. Algorithms Martin E. Dyer, Catherine S. Greenhill
1999	J	`jnl`	On Approximately Counting Colorings of Small Degree Graphs. SIAM J. Comput. Russ Bubley, Martin E. Dyer, Catherine S. Greenhill, Mark Jerrum
1998	A*	`conf`	A Genuinely Polynomial-Time Algorithms for Sampling Two-Rowed Contingency Tables. ICALP Martin E. Dyer, Catherine S. Greenhill
1998	J	`jnl`	A more rapidly mixing Markov chain for graph colorings. Random Struct. Algorithms Martin E. Dyer, Catherine S. Greenhill
1998	A*	`conf`	Beating the 2 Delta Bound for Approximately Counting Colourings: A Computer-Assisted Proof of Rapid Mixing. SODA Russ Bubley, Martin E. Dyer, Catherine S. Greenhill
1995	J	`jnl`	Theoretical and Experimental Comparison of Efficiency of Finite Field Extensions. J. Symb. Comput. Catherine S. Greenhill