On Weighted Graph Homomorphisms. - David J. Galvin; Prasad Tetali (Graphs, Morphisms and Statistical Physics, 2001)

Slow mixing of Glauber dynamics for the hard-core model on the hypercube. - David J. Galvin; Prasad Tetali (SODA, 2004)

On Phase Transition in the Hard-Core Model on Math. - David J. Galvin; Jeff Kahn 001 (Comb. Probab. Comput., 2004)

Global connectivity from local geometric constraints for sensor networks with various wireless footprints. - Raissa M. D'Souza; David J. Galvin; Cristopher Moore; Dana Randall (IPSN, 2006)

Bounding the Partition Function of Spin-Systems. - David J. Galvin (Electron. J. Comb., 2006)

Slow mixing of Glauber dynamics for the hard-core model on regular bipartite graphs. - David J. Galvin; Prasad Tetali (Random Struct. Algorithms, 2006)

Torpid mixing of local Markov chains on 3-colorings of the discrete torus. - David J. Galvin; Dana Randall (SODA, 2007)

Sampling independent sets in the discrete torus. - David J. Galvin (Random Struct. Algorithms, 2008)

An upper bound for the number of independent sets in regular graphs. - David J. Galvin (Discret. Math., 2009)

Matchings and independent sets of a fixed size in regular graphs. - Teena Carroll; David J. Galvin; Prasad Tetali (J. Comb. Theory A, 2009)

A Threshold Phenomenon for Random Independent Sets in the Discrete Hypercube. - David J. Galvin (Comb. Probab. Comput., 2011)

Two problems on independent sets in graphs. - David J. Galvin (Discret. Math., 2011)

The Number of Independent Sets in a Graph with Small Maximum Degree. - David J. Galvin; Yufei Zhao (Graphs Comb., 2011)

The Multistate Hard Core Model on a Regular Tree. - David J. Galvin; Fabio Martinelli; Kavita Ramanan; Prasad Tetali (SIAM J. Discret. Math., 2011)

Sampling 3-colourings of regular bipartite graphs - David J. Galvin (CoRR, 2012)

Phase Coexistence and Slow Mixing for the Hard-Core Model on Z^2 - Antonio Blanca; David J. Galvin; Dana Randall; Prasad Tetali (CoRR, 2012)

The independent set sequence of regular bipartite graphs. - David J. Galvin (Discret. Math., 2012)

H-colouring bipartite graphs. - John Engbers; David J. Galvin (J. Comb. Theory B, 2012)

H-coloring tori. - John Engbers; David J. Galvin (J. Comb. Theory B, 2012)

Reverse mathematics and infinite traceable graphs. - Peter Cholak; David J. Galvin; Reed Solomon (Math. Log. Q., 2012)

Phase Coexistence and Slow Mixing for the Hard-Core Model on ℤ2. - Antonio Blanca; David J. Galvin; Dana Randall; Prasad Tetali (APPROX-RANDOM, 2013)

Stirling Numbers of Forests and Cycles. - David J. Galvin; Do Trong Thanh (Electron. J. Comb., 2013)

Maximizing H-Colorings of a Regular Graph. - David J. Galvin (J. Graph Theory, 2013)

Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree. - John Engbers; David J. Galvin (J. Graph Theory, 2014)

Combinatorially interpreting generalized Stirling numbers. - John Engbers; David J. Galvin; Justin Hilyard (Eur. J. Comb., 2015)

Counting Colorings of a Regular Graph. - David J. Galvin (Graphs Comb., 2015)

Phase coexistence and torpid mixing in the 3-coloring model on ℤd. - David J. Galvin; Jeff Kahn 001; Dana Randall; Gregory B. Sorkin (SIAM J. Discret. Math., 2015)

Phase Coexistence for the Hard-Core Model on ${ mathbb Z}^2$. - Antonio Blanca; Yuxuan Chen; David J. Galvin; Dana Randall; Prasad Tetali (CoRR, 2016)

Cutting lemma and Zarankiewicz's problem in distal structures. - Artem Chernikov; David J. Galvin; Sergei Starchenko (CoRR, 2016)

On the independence ratio of distance graphs. - James M. Carraher; David J. Galvin; Stephen G. Hartke; A. J. Radcliffe; Derrick Stolee (Discret. Math., 2016)

Asymptotic Normality of Some Graph Sequences. - David J. Galvin (Graphs Comb., 2016)

Special Issue: APPROX-RANDOM 2014: Guest Editors' Foreword. - Deeparnab Chakrabarty; David J. Galvin (Theory Comput., 2016)

Extremal H-colorings of trees and 2-connected graphs. - John Engbers; David J. Galvin (J. Comb. Theory B, 2017)

The Game of Plates and Olives. - Teena Carroll; David J. Galvin (Electron. J. Comb., 2019)

Phase Coexistence for the Hard-Core Model on ℤ2. - Antonio Blanca; Yuxuan Chen; David J. Galvin; Dana Randall; Prasad Tetali (Comb. Probab. Comput., 2019)

Restricted Stirling and Lah number matrices and their inverses. - John Engbers; David J. Galvin; Cliff Smyth 001 (J. Comb. Theory A, 2019)

Total non-negativity of some combinatorial matrices. - David J. Galvin; Adrian Pacurar (J. Comb. Theory A, 2020)

A risk calculator to inform the need for a prostate biopsy: a rapid access clinic cohort. - Amirhossein Jalali; Robert W. Foley; Robert M. Maweni; Keefe Murphy; Dara J. Lundon; Thomas Lynch; Richard Power; Frank O'Brien; Kieran J. O'Malley; David J. Galvin; Garrett C. Durkan; Thomas Brendan Murphy; et al. (BMC Medical Informatics Decis. Mak., 2020)

On the Independent Set Sequence of a Tree. - Abdul Basit 001; David J. Galvin (Electron. J. Comb., 2021)

Independent set and matching permutations. - Taylor Ball; David J. Galvin; Catherine Hyry; Kyle Weingartner (J. Graph Theory, 2022)

Generalized Tuza's Conjecture for Random Hypergraphs. - Abdul Basit 001; David J. Galvin (SIAM J. Discret. Math., 2024)

On the zeroes of hypergraph independence polynomials. - David J. Galvin; Gwen McKinley; Will Perkins 001; Michail Sarantis; Prasad Tetali (Comb. Probab. Comput., 2024)

Reciprocals of thinned exponential series. - John Engbers; David J. Galvin; Cliff Smyth 001 (Australas. J Comb., 2024)