- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j14 |      | David Galvin: Maximizing H-Colorings of a Regular Graph. Journal of Graph Theory 73(1): 66-84 (2013) |
| 2012 | ||
| j13 | | David Galvin: The independent set sequence of regular bipartite graphs. Discrete Mathematics 312(19): 2881-2892 (2012) |
| j12 | | John Engbers, David Galvin: H-colouring bipartite graphs. J. Comb. Theory, Ser. B 102(3): 726-742 (2012) |
| j11 | | |
| j10 | | Peter Cholak, David Galvin, Reed Solomon: Reverse mathematics and infinite traceable graphs. Math. Log. Q. 58(1-2): 18-28 (2012) |
| i4 | | David Galvin, Prasad Tetali: Slow mixing of Glauber Dynamics for the hard-core model on regular bipartite graphs. CoRR abs/1206.3165 (2012) |
| i3 | | David Galvin, Dana Randall: Torpid Mixing of Local Markov Chains on 3-Colorings of the Discrete Torus. CoRR abs/1206.3193 (2012) |
| i2 | | |
| i1 | | Antonio Blanca, David Galvin, Dana Randall, Prasad Tetali: Phase Coexistence and Slow Mixing for the Hard-Core Model on Z^2. CoRR abs/1211.6182 (2012) |
| 2011 | ||
| j9 | | David Galvin: A Threshold Phenomenon for Random Independent Sets in the Discrete Hypercube. Combinatorics, Probability & Computing 20(1): 27-51 (2011) |
| j8 | | David Galvin: Two problems on independent sets in graphs. Discrete Mathematics 311(20): 2105-2112 (2011) |
| j7 | | David Galvin, Yufei Zhao: The Number of Independent Sets in a Graph with Small Maximum Degree. Graphs and Combinatorics 27(2): 177-186 (2011) |
| j6 | | David Galvin, Fabio Martinelli, Kavita Ramanan, Prasad Tetali: The Multistate Hard Core Model on a Regular Tree. SIAM J. Discrete Math. 25(2): 894-915 (2011) |
| 2009 | ||
| j5 | | David Galvin: An upper bound for the number of independent sets in regular graphs. Discrete Mathematics 309(23-24): 6635-6640 (2009) |
| j4 | | Teena Carroll, David Galvin, Prasad Tetali: Matchings and independent sets of a fixed size in regular graphs. J. Comb. Theory, Ser. A 116(7): 1219-1227 (2009) |
| 2008 | ||
| j3 | | David Galvin: Sampling independent sets in the discrete torus. Random Struct. Algorithms 33(3): 356-376 (2008) |
| 2007 | ||
| c3 | | David Galvin, Dana Randall: Torpid mixing of local Markov chains on 3-colorings of the discrete torus. SODA 2007: 376-384 |
| 2006 | ||
| j2 | | David Galvin, Prasad Tetali: Slow mixing of Glauber dynamics for the hard-core model on regular bipartite graphs. Random Struct. Algorithms 28(4): 427-443 (2006) |
| c2 | | Raissa D'Souza, David Galvin, Cristopher Moore, Dana Randall: Global connectivity from local geometric constraints for sensor networks with various wireless footprints. IPSN 2006: 19-26 |
| 2004 | ||
| j1 | | David Galvin, Jeff Kahn: On Phase Transition in the Hard-Core Model on Math. Combinatorics, Probability & Computing 13(2): 137-164 (2004) |
| c1 | | David Galvin, Prasad Tetali: Slow mixing of Glauber dynamics for the hard-core model on the hypercube. SODA 2004: 466-467 |
| 1 | Antonio Blanca | |
| 2 | Teena Carroll | |
| 3 | Peter Cholak | |
| 4 | Raissa D'Souza | |
| 5 | John Engbers | |
| 6 | Jeff Kahn | |
| 7 | Fabio Martinelli | |
| 8 | Cristopher Moore | |
| 9 | Kavita Ramanan | |
| 10 | Dana Randall | |
| 11 | Reed Solomon | |
| 12 | Prasad Tetali | |
| 13 | Yufei Zhao |
Colors in the list of coauthors
Last update Sun May 26 11:08:41 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page