| 2008 |
|---|
| 7 | EE | Sergio Caracciolo,
Gregor Masbaum,
Alan D. Sokal,
Andrea Sportiello:
A randomized polynomial-time algorithm for the Spanning Hypertree Problem on 3-uniform hypergraphs
CoRR abs/0812.3593: (2008) |
| 2006 |
|---|
| 6 | EE | Alexander D. Scott,
Alan D. Sokal:
On Dependency Graphs and the Lattice Gas.
Combinatorics, Probability & Computing 15(1-2): 253-279 (2006) |
| 2005 |
|---|
| 5 | | Alan D. Sokal:
The multivariate Tutte polynomial (alias Potts model) for graphs and matroids.
Surveys in Combinatorics 2005: 173-226 |
| 2004 |
|---|
| 4 | | Alan D. Sokal:
Chromatic Roots are Dense in the Whole Complex Plane.
Combinatorics, Probability & Computing 13(2): 221-261 (2004) |
| 3 | EE | Gordon F. Royle,
Alan D. Sokal:
The Brown-Colbourn conjecture on zeros of reliability polynomials is false.
J. Comb. Theory, Ser. B 91(2): 345-360 (2004) |
| 2001 |
|---|
| 2 | | Alan D. Sokal:
Bounds On The Complex Zeros Of (Di)Chromatic Polynomials And Potts-Model Partition Functions.
Combinatorics, Probability & Computing 10(1): (2001) |
| 1 | EE | Jason I. Brown,
Carl A. Hickman,
Alan D. Sokal,
David G. Wagner:
On the Chromatic Roots of Generalized Theta Graphs.
J. Comb. Theory, Ser. B 83(2): 272-297 (2001) |
