George Osipov
PhD student in theoretical computer science
Email: george dot osipov at pm dot me
   
   
I am a fifth-year PhD student at
TCSLAB,
Linköping University,
Sweden
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.
I am part of
AIICS division at IDA, Linköping University and
also AI/math track of
WASP graduate school.
Research Interests
I am broadly interested in theoretical computer science, with a focus on
constraint satisfaction problems and parameterized complexity.
Publications
-
Directed Symmetric Multicut is W[1]-hard
with M. Pilipczuk.
arXiv
-
Parameterized Complexity Classification for Interval Constraints
with K. K. Dabrowski, P. Jonsson, S. Ordyniak, M. Pilipczuk and R. Sharma.
to appear in 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