The complexity of the fermionant, and immanants of constant width
The complexity of the list homomorphism problem for graphs
The Complexity Of The NP-Class
The Complexity of the Puzzles of Final Fantasy XIII-2
The complexity of weighted and unweighted #CSP
The Complexity of Weighted Boolean #CSP
The Complexity of Weighted Boolean #CSP with Mixed Signs
The Complexity of Weighted Counting for Acyclic Conjunctive Queries
The Computational Complexity of Computing the Permanent of a Matrix
The Computational Complexity of Disconnected Cut and 2K2-Partition
The computational complexity of Minesweeper
The Computational Complexity of the Traveling Salesman Problem
The Computational Power of Benenson Automata
The computational power of population protocols
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
The Consequences of Eliminating NP Solutions
The descriptive complexity approach to LOGCFL
The descriptive set-theoretic complexity of the set of points of continuity of a multi-valued function (Extended Abstract)
The DFAs of Finitely Different Languages
The Dichotomy of List Homomorphisms for Digraphs