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
Counting and Sampling H-Colourings
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs
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
The Complexity of Restrictive H-Coloring
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Greedy algorithms, H-colourings and a complexity-theoretic dichotomy
Theoretical Computer Science
Counting and sampling H-colourings
Information and Computation
Dichotomies for classes of homomorphism problems involving unary functions
Theoretical Computer Science
Corrigendum: the complexity of counting graph homomorphisms
Random Structures & Algorithms
The restrictive H-coloring problem
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
The complexity of counting homomorphisms seen from the other side
Theoretical Computer Science
The complexity of partition functions
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Towards a dichotomy theorem for the counting constraint satisfaction problem
Information and Computation
Inapproximability of the Tutte polynomial
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On counting homomorphisms to directed acyclic graphs
Journal of the ACM (JACM)
Path coupling using stopping times and counting independent sets and colorings in hypergraphs
Random Structures & Algorithms
Efficient algorithms for counting parameterized list H-colorings
Journal of Computer and System Sciences
Inapproximability of the Tutte polynomial
Information and Computation
Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
A Computational Proof of Complexity of Some Restricted Counting Problems
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Counting Subgraphs via Homomorphisms
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
The complexity of weighted Boolean #CSP with mixed signs
Theoretical Computer Science
Classification of a Class of Counting Problems Using Holographic Reductions
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
The restrictive H-coloring problem
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
An approximation trichotomy for Boolean #CSP
Journal of Computer and System Sciences
Graph homomorphisms with complex values: a dichotomy theorem
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Holographic reduction: a domain changed application and its partial converse theorems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
On the approximation complexity hierarchy
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
A Complexity Dichotomy for Partition Functions with Mixed Signs
SIAM Journal on Computing
A computational proof of complexity of some restricted counting problems
Theoretical Computer Science
Complexity of conservative constraint satisfaction problems
ACM Transactions on Computational Logic (TOCL)
The enumeration of vertex induced subgraphs with respect to the number of components
European Journal of Combinatorics
Distinguishing graphs by their left and right homomorphism profiles
European Journal of Combinatorics
Spin systems on graphs with complex edge functions and specified degree regularities
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Guest column: complexity dichotomies of counting problems
ACM SIGACT News
Gadgets and anti-gadgets leading to a complexity dichotomy
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Approximate counting via correlation decay in spin systems
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The complexity of weighted and unweighted #CSP
Journal of Computer and System Sciences
On counting homomorphisms to directed acyclic graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Complexity of counting CSP with complex weights
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
A dichotomy theorem for homomorphism polynomials
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Spin systems on k-regular graphs with complex edge functions
Theoretical Computer Science
The complexity of approximating bounded-degree Boolean #CSP
Information and Computation
Lee-Yang theorems and the complexity of computing averages
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A complete dichotomy rises from the capture of vanishing signatures: extended abstract
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Partition functions on k-regular graphs with {0,1}-vertex assignments and real edge functions
Theoretical Computer Science
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
The complexity of the counting constraint satisfaction problem
Journal of the ACM (JACM)
The complexity of complex weighted Boolean #CSP
Journal of Computer and System Sciences
| Hi-index | 0.01 |