I am a postdoc in theoretical computer science and pricipal investigator of the international postdoctoral project "Parameterized Complexity of Constraint Satisfaction Problems" funded by the Swedish Research Council (VR). Throughout 2025 I am working with Standa Živný at the University of Oxford. In 2026 I will be at the Royal Holloway, University of London working with Magnus Wahlström. Then I will return to TCSLAB Linköping University, Sweden,
I did my PhD at Linköping University supervised by Peter Jonsson and Victor Lagerkvist. My PhD was part of the WASP Graduate School. Originally, I'm from Georgia where I did my BSc in computer science at Free University of Tbilisi.
Publications
-
Towards a Parameterized Approximation Dichotomy of MinCSP for Linear Equations over Finite Commutative Rings
with K. K. Dabrowski, P. Jonsson, S. Ordyniak, and M. Wahlström.
arXiv -
CSPs with Few Alien Constraints
with P. Jonsson and V. Lagerkvist
CP'24 | arXiv -
Solving Quantified Boolean Formulas with Few Existential Variables
with L. Eriksson, V. Lagerkvist, S. Ordyniak, F. Panolan and M. Rychlicki
IJCAI'24 | arXiv -
Algorithms and Complexity of Difference Logic
with K. K. Dabrowski, P. Jonsson, and S. Ordyniak.
arXiv -
Parameterized Complexity of MinCSP over the Point Algebra
with M. Pilipczuk and M. Wahlström.
ESA'24 | arXiv | slides -
Parameterized Complexity Classification for Interval Constraints
with K. K. Dabrowski, P. Jonsson, S. Ordyniak, M. Pilipczuk and R. Sharma.
IPEC'23 | arXiv -
Parameterized Complexity of Equality MinCSP
with M. Wahlström.
ESA'23 | arXiv | slides -
Almost Consistent Systems of Linear Equations
with K. K. Dabrowski, P. Jonsson, S. Ordyniak, and M. Wahlström.
SODA'23 | arXiv | slides -
Concise Representations and Complexity of Combinatorial Assignment Problems (extended abstract)
with F. Präntare and L. Eriksson.
AAMAS'22 -
Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach
with K. K. Dabrowski, P. Jonsson, and S. Ordyniak.
AAAI'22 | slides -
Acyclic Orders, Partition Schemes and CSPs: Unified Hardness Proofs and Improved Algorithms
with P. Jonsson and V. Lagerkvist.
Artif. Intell. | article | slides -
Solving Infinite-Domain CSPs Using the Patchwork Property
with K. K. Dabrowski, P. Jonsson, and S. Ordyniak.
Artif. Intell. | article | slides -
Disjunctive Temporal Problems under Structural Restrictions
with K. K. Dabrowski, P. Jonsson, and S. Ordyniak.
AAAI'21 -
Fine-Grained Complexity of Temporal Problems
with K. K. Dabrowski, P. Jonsson, and S. Ordyniak.
KR'20 | slides