The Swendsen-Wang process does not always mix rapidly
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The computational complexity of knot and link problems
Journal of the ACM (JACM)
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
The Tutte Polynomial as a Growth Function
Journal of Algebraic Combinatorics: An International Journal
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The complexity of counting graph homomorphisms (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Colored Tutte polynomials and Kaufman brackets for graphs of bounded tree width
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Polynomials associated with nowhere-zero flows
Journal of Combinatorial Theory Series B
On the parity of colourings and flows
Journal of Combinatorial Theory Series B
On the number of 3-edge colorings of cubic graphs
European Journal of Combinatorics
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
New Key Agreement Protocols in Braid Group Cryptography
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Farrell polynomials on graphs of bounded tree width
Advances in Applied Mathematics - Special issue on: Formal power series and algebraic combinatorics in memory of Rodica Simion, 1955-2000
Locally grid graphs: classification and Tutte uniqueness
Discrete Mathematics - Special issue: The 18th British combinatorial conference
Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes
Theoretical Computer Science
SIGACT News complexity theory column 41
ACM SIGACT News
Theoretical Computer Science
Graphs determined by polynomial invariants
Theoretical Computer Science - Random generation of combinatorial objects and bijective combinatorics
Lattice path matroids: enumerative aspects and Tutte polynomials
Journal of Combinatorial Theory Series A
The parametrized complexity of knot polynomials
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Chromatic, Flow and Reliability Polynomials: The Complexity of their Coefficients
Combinatorics, Probability and Computing
Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
Combinatorics, Probability and Computing
A Tutte Polynomial for Coloured Graphs
Combinatorics, Probability and Computing
Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth
Combinatorics, Probability and Computing
Chromatic Roots are Dense in the Whole Complex Plane
Combinatorics, Probability and Computing
A Subset Expansion of the Coloured Tutte Polynomial
Combinatorics, Probability and Computing
Tilings of rectangles with T-tetrominoes
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
The interlace polynomial of a graph
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Evaluating the Rank Generating Function of a Graphic 2-Polymatroid
Combinatorics, Probability and Computing
On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids
Combinatorics, Probability and Computing
The Complexity of Counting Colourings of Subgraphs of the Grid
Combinatorics, Probability and Computing
A solution to the tennis ball problem
Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
On the colored Tutte polynomial of a graph of bounded treewidth
Discrete Applied Mathematics
Parametrized Tutte Polynomials of Graphs and Matroids
Combinatorics, Probability and Computing
The Complexity of Ferromagnetic Ising with Local Fields
Combinatorics, Probability and Computing
Combinatorics, Probability and Computing
On the Ashkin–Teller Model and Tutte–Whitney Functions
Combinatorics, Probability and Computing
Fast algorithms for computing Jones polynomials of certain links
Theoretical Computer Science
Inapproximability of the Tutte polynomial
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
Some new evaluations of the Tutte polynomial
Journal of Combinatorial Theory Series B
On the number of Go positions on lattice graphs
Information Processing Letters
The Jones polynomial and graphs on surfaces
Journal of Combinatorial Theory Series B
Parity, eulerian subgraphs and the Tutte polynomial
Journal of Combinatorial Theory Series B
Holographic algorithms: guest column
ACM SIGACT News
A new connection between quantum circuits, graphs and the Ising partition function
Quantum Information Processing
Evaluations of Graph Polynomials
Graph-Theoretic Concepts in Computer Science
Connection Matrices for MSOL-Definable Structural Invariants
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
Enumerating spanning trees of graphs with an involution
Journal of Combinatorial Theory Series A
The bivariate Ising polynomial of a graph
Discrete Applied Mathematics
The equivalence of two graph polynomials and a symmetric function
Combinatorics, Probability and Computing
The complexity of weighted Boolean #CSP with mixed signs
Theoretical Computer Science
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Note: On the colored Tutte polynomial of a graph of bounded treewidth
Discrete Applied Mathematics
A Most General Edge Elimination Polynomial - Thickening of Edges
Fundamenta Informaticae - Bridging Logic and Computer Science: to Johann A. Makowsky for his 60th birthday
Tutte polynomials of bracelets
Journal of Algebraic Combinatorics: An International Journal
Approximating the partition function of the ferromagnetic Potts model
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Some inequalities for the Tutte polynomial
European Journal of Combinatorics
Enumeration of spanning trees of graphs with rotational symmetry
Journal of Combinatorial Theory Series A
Quantum Computation and the Evaluation of Tensor Networks
SIAM Journal on Computing
A Complexity Dichotomy for Partition Functions with Mixed Signs
SIAM Journal on Computing
New graph polynomials from the bethe approximation of the ising partition function
Combinatorics, Probability and Computing
A recipe theorem for the topological Tutte polynomial of Bollobás and Riordan
European Journal of Combinatorics
The Jones polynomial: quantum algorithms and applications in quantum complexity theory
Quantum Information & Computation
Rapid mixing of subset Glauber dynamics on graphs of bounded tree-width
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Efficient Monte Carlo simulation via the generalized splitting method
Statistics and Computing
Computing graph polynomials on graphs of bounded clique-width
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
From a zoo to a zoology: descriptive complexity for graph polynomials
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Dichotomy for Holant problems of Boolean domain
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On some Tutte polynomial sequences in the square lattice
Journal of Combinatorial Theory Series B
Efficient rank aggregation using partial data
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
A dichotomy theorem for homomorphism polynomials
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Approximating the partition function of the ferromagnetic Potts model
Journal of the ACM (JACM)
Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials
Journal of Computer and System Sciences
The complexity of approximating bounded-degree Boolean #CSP
Information and Computation
Self-Avoiding Random Dynamics on Integer Complex Systems
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special Issue on Monte Carlo Methods in Statistics
The complexity of planar boolean #CSP with complex weights
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Computing HOMFLY polynomials of 2-bridge links from 4-plat representation
Discrete Applied Mathematics
| Hi-index | 0.01 |