George Osipov

Postdoc

Theoretical computer science.

Research in theoretical computer science

I am broadly interested in theoretical computer science, with a focus on constraint satisfaction problems and parameterized complexity.

My research is in computational complexity, an area that studies possibilities and limitations of efficient computation from a mathematical perspective. More specifically, I work on constraint satisfaction problems – a general class of problems where a global solution needs to satisfy many local constraints (think of solving the Zebra puzzle, or scheduling classes for a university while avoiding time conflicts).
More info about the Zebra puzzle.

Doctoral thesis

George Osipov (2024)

On Infinite-Domain CSPs Parameterized by Solution Cost

Short facts about George Osipov

I am a fourth-year PhD student at TCSLAB supervised by Peter Jonsson and co-supervised by Victor Lagerkvist.

Originally I'm from Georgia where I received a BSc in computer science at Free University of Tbilisi and studied towards a MSc in mathematics Ilia State University.

I spent a year at Uppsala University thanks to the Erasmus+ exchange programme. I am part of AIICS division at IDA and also AI/math track of WASP graduate school.

Publications

2026

Fredrik Präntare, Leif Eriksson, George Osipov, Fredrik Heintz, Peter Jonsson (2026)

Concise representations and complexity results for welfare-maximizing combinatorial assignment Autonomous Agents and Multi-Agent Systems, Vol. 40, Article 30 (Article in journal)

https://dx.doi.org/10.1007/s10458-026-09753-9

Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov (2026)

Algorithms and complexity of difference logic Journal of computer and system sciences (Print), Vol. 159, Article 103780 (Article in journal)

https://dx.doi.org/10.1016/j.jcss.2026.103780

2025

Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlstrom (2025)

Parameterized Approximability for Modular Linear Equations 33RD ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS, ESA 2025, Article 88 (Conference paper)

Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström (2025)

Parameterized Approximability for Modular Linear Equations Proc. 33rd Annual European Symposium on Algorithms (ESA-2025), Article 88 (Conference paper)

https://dx.doi.org/10.4230/LIPICS.ESA.2025.88

Konrad k. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlstrom (2025)

Almost Consistent Systems of Linear Equations ACM Transactions on Algorithms, Vol. 21, Article 44 (Article in journal)

https://dx.doi.org/10.1145/3733107

News

A new doctor in Computer Science: George Osipov

On the 3rd of June, George Osipov successfully defended his thesis in the intersection of theoretical computer science and artificial intelligence (AI), with a focus on parameterized complexity of constraint satisfaction problems (CSPs).

Adrian Lawson and PhD Student George Osipov at the award ceremony for the Lawson Scholarship.

George Osipov awarded the Lawson Scholarship for 2023

George Osipov, PhD student at the Department of Computer and Information Science (IDA), receives the Lawson Scholarship for 2023 for his excellent performance in computer and information science.

About the division

The robotdog Spot hands over a first aid kit to a kneeling man

Artificial Intelligence and Integrated Computer Systems (AIICS)

The AIICS division is part of the Department of Computer and Information Science. The division's main focus is research and teaching in artificial intelligence, its theoretical foundations and its applications.

Colleagues at AIICS