The Swendsen-Wang process does not always mix rapidly
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximately counting up to four (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Random generation of embedded graphs and an extension to Dobrushin uniqueness (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Graph orientations with no sink and an approximation for a hard case of #SAT
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The complexity of choosing an H-colouring (nearly) uniformly at random
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The Glauber dynamics on colourings of a graph with high girth and maximum degree
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Counting H-colorings of partial k-trees
Theoretical Computer Science
Very rapid mixing of the Glauber dynamics for proper colorings on bounded-degree graphs
Random Structures & Algorithms
NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Counting H-Colorings of Partial k-Trees
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Counting and Sampling H-Colourings
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Determining the Number of Solutions to Binary CSP Instances
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Randomly coloring graphs of girth at least five
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Improved Bounds for Sampling Coloring
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Counting and sampling H-colourings
Information and Computation
ON THE CONVERGENCE OF METROPOLIS-TYPE RELAXATION AND ANNEALING WITH CONSTRAINTS
Probability in the Engineering and Informational Sciences
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Coupling with the stationary distribution and improved sampling for colorings and independent sets
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
ACM Transactions on Algorithms (TALG)
A general lower bound for mixing of single-site dynamics on graphs
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Accelerating simulated annealing for the permanent and combinatorial counting problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Randomly coloring sparse random graphs with fewer colors than the maximum degree
Random Structures & Algorithms
Radiocoloring in planar graphs: complexity and approximations
Theoretical Computer Science - Mathematical foundations of computer science 2000
Path coupling without contraction
Journal of Discrete Algorithms
Randomly coloring planar graphs with fewer colors than the maximum degree
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Torpid mixing of local Markov chains on 3-colorings of the discrete torus
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Correlation decay and deterministic FPTAS for counting list-colorings of a graph
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Random Structures & Algorithms
Path coupling using stopping times and counting independent sets and colorings in hypergraphs
Random Structures & Algorithms
Random sampling of colourings of sparse random graphs with a constant number of colours
Theoretical Computer Science
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Adaptive simulated annealing: A near-optimal connection between sampling and counting
Journal of the ACM (JACM)
Mixing 3-colourings in bipartite graphs
European Journal of Combinatorics
The Glauber Dynamics for Colourings of Bounded Degree Trees
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Mixing 3-colourings in bipartite graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Phase transition for the mixing time of the Glauber dynamics for coloring regular trees
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |