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

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

2024

George Osipov (2024) On Infinite-Domain CSPs Parameterized by Solution Cost

2023

George Osipov, Magnus Wahlström (2023) Parameterized Complexity of Equality MinCSP 31st Annual European Symposium on Algorithms (ESA 2023), p. 86:1-86:17 (Conference paper) Continue to DOI
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma (2023) Parameterized Complexity Classification for Interval Constraints 18th International Symposium on Parameterized and Exact Computation (IPEC 2023), p. 11:1-11:19 (Conference paper) Continue to DOI
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström (2023) Almost Consistent Systems of Linear Equations Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), p. 3179-3217 (Conference paper) Continue to DOI
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov (2023) Solving infinite-domain CSPs using the patchwork property Artificial Intelligence, Vol. 317, Article 103880 (Article in journal) Continue to DOI

News

About the division

Colleagues at AIICS

About the department