| 2019 | MFCS | On the Strength of Uniqueness Quantification in Primitive Positive Formulas. | Victor Lagerkvist, Gustav Nordh |
| 2013 | CP | Blowing Holes in Various Aspects of Computational Problems, with Applications to Constraint Satisfaction. | Peter Jonsson, Victor Lagerkvist, Gustav Nordh |
| 2013 | SODA | Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis. | Peter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini |
| 2009 | LICS | Trichotomy in the Complexity of Minimal Inference. | Arnaud Durand, Miki Hermann, Gustav Nordh |
| 2007 | MFCS | The Maximum Solution Problem on Graphs. | Peter Jonsson, Gustav Nordh, Johan Thapper |
| 2006 | CP | Approximability of Integer Programming with Generalised Constraints. | Peter Jonsson, Fredrik Kuivinen, Gustav Nordh |
| 2006 | MFCS | Generalised Integer Programming Based on Logically Defined Relations. | Peter Jonsson, Gustav Nordh |
| 2005 | IJCAI | Propositional Abduction is Almost Always Hard. | Gustav Nordh, Bruno Zanuttini |
| 2004 | COCOON | The Complexity of Counting Solutions to Systems of Equations over Finite Semigroups. | Gustav Nordh, Peter Jonsson |
| 2004 | LICS | An Algebraic Approach to the Complexity of Propositional Circumscription. | Gustav Nordh, Peter Jonsson |
| 2004 | LPAR | A Trichotomy in the Complexity of Propositional Circumscription. | Gustav Nordh |
| 2004 | MFCS | The Complexity of Equivalence and Isomorphism of Systems of Equations over Finite Groups. | Gustav Nordh |