Polynomial-Time Approximation Algorithms for the Ising Model
Embedding k-Outerplanar Graphs into l1
Cuts, Trees and ?1-Embeddings of Graphs*
Approximate counting, uniform generation and rapidly mixing Markov chains
Approximating the Permanent
COMBINATORICA
SIAM Journal on Discrete Mathematics
SIAM Journal on Computing
Information and Computation
Mark Jerrum
Ilan Newman
Anupam Gupta
Yuri Rabinovich
Chandra Chekuri
Load balancing of unit size tokens and expansion properties of graphs
Diffusive load balancing schemes on heterogeneous networks
Metric embedding via shortest path decompositions
Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region