| 2026 | AAAI | Towards Single Exponential Time for Temporal and Spatial Reasoning: A Study via Redundancy and Dynamic Programming. | Victor Lagerkvist, Johanna Groven, Leif Eriksson |
| 2026 | ICALP | Going Beyond Twin-Width? CSPs with Unbounded Domain and Few Variables. | Peter Jonsson, Victor Lagerkvist, Jorke M. de Vlas, Magnus Wahlstrm |
| 2026 | KR | Clausal Deletion Backdoors for QBF: a Parameterized Complexity Approach. | Leif Eriksson, Victor Lagerkvist, Sebastian Ordyniak, George Osipov, Fahad Panolan, Mateusz Rychlicki |
| 2025 | IJCAI | Facets in Argumentation: A Formal Approach to Argument Significance. | Johannes Klaus Fichte, Nicolas Frhlich, Markus Hecher, Victor Lagerkvist, Yasir Mahmood, Arne Meier, Jonathan Persson |
| 2025 | IJCAI | A Fine-Grained Complexity View on Propositional Abduction - Algorithms and Lower Bounds. | Victor Lagerkvist, Mohamed Maizia, Johannes Schmidt |
| 2024 | CP | CSPs with Few Alien Constraints. | Peter Jonsson, Victor Lagerkvist, George Osipov |
| 2024 | IJCAI | Solving Quantified Boolean Formulas with Few Existential Variables. | Leif Eriksson, Victor Lagerkvist, Sebastian Ordyniak, George Osipov, Fahad Panolan, Mateusz Rychlicki |
| 2023 | IJCAI | A Fast Algorithm for Consistency Checking Partially Ordered Time. | Leif Eriksson, Victor Lagerkvist |
| 2023 | IJCAI | Improved Algorithms for Allen's Interval Algebra by Dynamic Programming with Sublinear Partitioning. | Leif Eriksson, Victor Lagerkvist |
| 2022 | IJCAI | A Multivariate Complexity Analysis of Qualitative Reasoning Problems. | Leif Eriksson, Victor Lagerkvist |
| 2021 | CP | Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors. | Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak |
| 2021 | IJCAI | Improved Algorithms for Allen's Interval Algebra: a Dynamic Programming Approach. | Leif Eriksson, Victor Lagerkvist |
| 2020 | IJCAI | Lower Bounds and Faster Algorithms for Equality Constraints. | Peter Jonsson, Victor Lagerkvist |
| 2019 | MFCS | On the Strength of Uniqueness Quantification in Primitive Positive Formulas. | Victor Lagerkvist, Gustav Nordh |
| 2018 | MFCS | Why are CSPs Based on Partition Schemes Computationally Hard?. | Peter Jonsson, Victor Lagerkvist |
| 2017 | CP | Kernelization of Constraint Satisfaction Problems: A Study Through Universal Algebra. | Victor Lagerkvist, Magnus Wahlstrm |
| 2017 | MFCS | Time Complexity of Constraint Satisfaction via Universal Algebra. | Peter Jonsson, Victor Lagerkvist, Biman Roy |
| 2016 | MFCS | A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT. | Victor Lagerkvist, Biman Roy |
| 2015 | CP | Upper and Lower Bounds on the Time Complexity of Infinite-Domain CSPs. | Peter Jonsson, Victor Lagerkvist |
| 2015 | MFCS | Precise Upper and Lower Bounds for the Monotone Constraint Satisfaction Problem. | Victor Lagerkvist |
| 2014 | MFCS | Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis. | Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman |
| 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 |