The Complexity of Counting Solutions to Systems of Equations over Finite Semigroups. - Gustav Nordh; Peter Jonsson (COCOON, 2004)

An Algebraic Approach to the Complexity of Propositional Circumscription. - Gustav Nordh; Peter Jonsson (LICS, 2004)

A Trichotomy in the Complexity of Propositional Circumscription. - Gustav Nordh (LPAR, 2004)

Propositional Abduction is Almost Always Hard. - Gustav Nordh; Bruno Zanuttini (IJCAI, 2005)

The complexity of equivalence and isomorphism of systems of equations over finite groups. - Gustav Nordh (Theor. Comput. Sci., 2005)

Approximability of Integer Programming with Generalised Constraints. - Peter Jonsson; Fredrik Kuivinen; Gustav Nordh (CP, 2006)

Generalised Integer Programming Based on Logically Defined Relations. - Peter Jonsson; Gustav Nordh (MFCS, 2006)

The Maximum Solution Problem on Graphs. - Peter Jonsson; Gustav Nordh; Johan Thapper (MFCS, 2007)

NP-completeness of generalized multi-Skolem sequences. - Gustav Nordh (Discret. Appl. Math., 2007)

Complexity Dichotomies for CSP-related Problems. - Gustav Nordh (2007)

Introduction to the Maximum SolutionProblem. - Peter Jonsson; Gustav Nordh (Complexity of Constraints, 2008)

What makes propositional abduction tractable. - Gustav Nordh; Bruno Zanuttini (Artif. Intell., 2008)

Perfect Skolem sets. - Gustav Nordh (Discret. Math., 2008)

MAX ONES Generalized to Larger Domains. - Peter Jonsson; Fredrik Kuivinen; Gustav Nordh (SIAM J. Comput., 2008)

Frozen Boolean Partial Co-clones. - Gustav Nordh; Bruno Zanuttini (ISMVL, 2009)

Trichotomy in the Complexity of Minimal Inference. - Arnaud Durand 001; Miki Hermann; Gustav Nordh (LICS, 2009)

Integer programming with 2-variable equations and 1-variable inequalities. - Manuel Bodirsky; Gustav Nordh; Timo von Oertzen (Inf. Process. Lett., 2009)

A note on the hardness of Skolem-type sequences. - Gustav Nordh (Discret. Appl. Math., 2010)

Approximability of Clausal Constraints. - Peter Jonsson; Gustav Nordh (Theory Comput. Syst., 2010)

Retractions to Pseudoforests. - Tomás Feder; Pavol Hell; Peter Jonsson; Andrei A. Krokhin; Gustav Nordh (SIAM J. Discret. Math., 2010)

Trichotomies in the Complexity of Minimal Inference. - Arnaud Durand 001; Miki Hermann; Gustav Nordh (Theory Comput. Syst., 2012)

Blowing Holes in Various Aspects of Computational Problems, with Applications to Constraint Satisfaction. - Peter Jonsson; Victor Lagerkvist; Gustav Nordh (CP, 2013)

Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis. - Peter Jonsson; Victor Lagerkvist; Gustav Nordh; Bruno Zanuttini (SODA, 2013)

Constructing NP-intermediate problems by blowing holes with parameters of various properties. - Peter Jonsson; Victor Lagerkvist; Gustav Nordh (Theor. Comput. Sci., 2015)

Polymorphisms and Circuit Complexity. - Gustav Nordh (CoRR, 2016)

A Note on the Power of Non-Deterministic Circuits with Gate Restrictions. - Gustav Nordh (CoRR, 2017)

A note on X-rays of permutations and a problem of Brualdi and Fritscher. - Gustav Nordh (CoRR, 2017)

Strong partial clones and the time complexity of SAT problems. - Peter Jonsson; Victor Lagerkvist; Gustav Nordh; Bruno Zanuttini (J. Comput. Syst. Sci., 2017)

On the Strength of Uniqueness Quantification in Primitive Positive Formulas. - Victor Lagerkvist; Gustav Nordh (MFCS, 2019)