Catherine S. Greenhill

Orcid: 0000-0001-6998-2282

Affiliations:
  • UNSW Australia, Sydney, Australia


According to our database1, Catherine S. Greenhill authored at least 69 papers between 1995 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Balanced allocation on hypergraphs.
J. Comput. Syst. Sci., December, 2023

Degree sequences of sufficiently dense random uniform hypergraphs.
Comb. Probab. Comput., March, 2023

A triangle process on graphs with given degree sequence.
CoRR, 2023

2022
The mixing time of switch Markov chains: A unified approach.
Eur. J. Comb., 2022

Spanning trees in random regular uniform hypergraphs.
Comb. Probab. Comput., 2022

Lower Bounds on the Chromatic Number of Random Graphs.
Comb., 2022

2021
Counting independent sets in graphs with bounded bipartite pathwidth.
Random Struct. Algorithms, 2021

Sampling hypergraphs with given degrees.
Discret. Math., 2021

The average number of spanning hypertrees in sparse uniform hypergraphs.
Discret. Math., 2021

Mixing time of the switch Markov chain and stable degree sequences.
Discret. Appl. Math., 2021

Subgraph counts for dense random graphs with specified degrees.
Comb. Probab. Comput., 2021

A Triangle Process on Regular Graphs.
Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

Generating graphs randomly.
Proceedings of the Surveys in Combinatorics, 2021

2020
A threshold result for loose Hamiltonicity in random regular uniform hypergraphs.
J. Comb. Theory, Ser. B, 2020

On the Parameterised Complexity of Induced Multipartite Graph Parameters.
CoRR, 2020

Balanced Allocation on Dynamic Hypergraphs.
Proceedings of the Approximation, 2020

2019
Rigid Colorings of Hypergraphs and Contiguity.
SIAM J. Discret. Math., 2019

Hypergraph coloring up to condensation.
Random Struct. Algorithms, 2019

Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges.
Eur. J. Comb., 2019

The flip Markov chain for connected regular graphs.
Discret. Appl. Math., 2019

Triangle-creation processes on cubic graphs.
CoRR, 2019

The mixing time of the swap (switch) Markov chains: a unified approach.
CoRR, 2019

Uniform Generation of Spanning Regular Subgraphs of a Dense Graph.
Electron. J. Comb., 2019

2018
The switch Markov chain for sampling irregular graphs and digraphs.
Theor. Comput. Sci., 2018

2017
The average number of spanning trees in sparse graphs with given degrees.
Eur. J. Comb., 2017

2016
Mixing of the Glauber dynamics for the ferromagnetic Potts model.
Random Struct. Algorithms, 2016

Asymptotic enumeration of sparse uniform hypergraphs with given degrees.
Eur. J. Comb., 2016

Asymptotic Enumeration of Sparse Uniform Linear Hypergraphs with Given Degrees.
Electron. J. Comb., 2016

2015
On the chromatic number of a random hypergraph.
J. Comb. Theory, Ser. B, 2015

The switch Markov chain for sampling irregular graphs (Extended Abstract).
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014
The switch Markov chain for sampling irregular graphs.
CoRR, 2014

On the Number of Spanning Trees in Random Regular Graphs.
Electron. J. Comb., 2014

2013
Asymptotic Enumeration of Sparse Multigraphs with Given Degrees.
SIAM J. Discret. Math., 2013

Heat-bath Markov chains have no negative eigenvalues
CoRR, 2013

2012
Making Markov chains less lazy
CoRR, 2012

2011
A Polynomial Bound on the Mixing Time of a Markov Chain for Sampling Regular Directed Graphs.
Electron. J. Comb., 2011

2010
On the Number of Perfect Matchings in Random Lifts.
Comb. Probab. Comput., 2010

Asymptotic enumeration of correlation-immune boolean functions.
Cryptogr. Commun., 2010

2009
Random dense bipartite graphs and directed graphs with specified degrees.
Random Struct. Algorithms, 2009

2008
The cycle structure of two rows in a random Latin square.
Random Struct. Algorithms, 2008

Asymptotic enumeration of dense 0-1 matrices with specified line sums.
J. Comb. Theory, Ser. A, 2008

Expansion properties of a random regular graph after random vertex deletions.
Eur. J. Comb., 2008

Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums.
Adv. Appl. Math., 2008

2007
Sampling Regular Graphs and a Peer-to-Peer Network.
Comb. Probab. Comput., 2007

2006
The generalized acyclic edge chromatic number of random regular graphs.
J. Graph Theory, 2006

Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums.
J. Comb. Theory, Ser. A, 2006

Neighbour-Distinguishing Edge Colourings of Random Regular Graphs.
Electron. J. Comb., 2006

2005
Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs.
Graphs Comb., 2005

Generation of simple quadrangulations of the sphere.
Discret. Math., 2005

2004
Corrigendum: The complexity of counting graph homomorphisms.
Random Struct. Algorithms, 2004

Hamiltonian decompositions of random bipartite regular graphs.
J. Comb. Theory, Ser. B, 2004

Random Hypergraph Processes with Degree Restrictions.
Graphs Comb., 2004

The Relative Complexity of Approximate Counting Problems.
Algorithmica, 2004

2003
Connectedness Of The Degree Bounded Star Process.
Comb. Probab. Comput., 2003

2002
Very rapid mixing of the Glauber dynamics for proper colorings on bounded-degree graphs.
Random Struct. Algorithms, 2002

Permutation Pseudographs And Contiguity.
Comb. Probab. Comput., 2002

Convergence Of The Iterated Prisoner's Dilemma Game.
Comb. Probab. Comput., 2002

2000
Polynomial-time counting and sampling of two-rowed contingency tables.
Theor. Comput. Sci., 2000

An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings.
SIAM J. Comput., 2000

The complexity of counting graph homomorphisms.
Random Struct. Algorithms, 2000

On Markov Chains for Independent Sets.
J. Algorithms, 2000

The complexity of counting colourings and independent sets in sparse graphs and hypergraphs.
Comput. Complex., 2000

An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract).
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

The complexity of counting graph homomorphisms (extended abstract).
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999
On Approximately Counting Colorings of Small Degree Graphs.
SIAM J. Comput., 1999

1998
A more rapidly mixing Markov chain for graph colorings.
Random Struct. Algorithms, 1998

Beating the 2 Delta Bound for Approximately Counting Colourings: A Computer-Assisted Proof of Rapid Mixing.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

A Genuinely Polynomial-Time Algorithms for Sampling Two-Rowed Contingency Tables.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1995
Theoretical and Experimental Comparison of Efficiency of Finite Field Extensions.
J. Symb. Comput., 1995


  Loading...