gosip.github.io/index.html at main · gosip/gosip.github.io · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
<!DOCTYPE html>
<html>
<head>
<title>George Osipov</title>

<link rel="icon" href="images/abacus.ico">

<style>
@import url(https://fonts.googleapis.com/css?family=Open+Sans);

a:link {
  color: green;
  text-decoration: none;
}

a:visited {
  color: darkgreen;
  text-decoration: none;
}

a:hover {
  color: darkgreen;
  text-decoration: underline;
}

a:active {
  color: seagreen;
  text-decoration: underline;
}

body {
    background-color: #dddddd;
    font-family: 'Open Sans', sans-serif;
    padding: 0px;
    margin: 0px;
}

#frame {
	margin: auto;
    margin-top: 50px;
    margin-bottom: 50px;
    border: 1px solid;
    background-color: #ffffff;
    max-width: 800px;
}
#textbox {
    padding: 5%;
    border: medium none;
    background-color: #ffffff;
}
li {
    padding: 8px;
}
</style>
<meta name="google-site-verification" content="__QuNHQqymyKg33qEFblrRFQyTfiJYuqR6gaJt13bEc" />
</head>

<body>

<div id="frame">
<div id="textbox">

<div style="height:auto; overflow: hidden;">
<div style="float:left" width=45%>
<h1>George Osipov</h1>

<p>Postdoc in theoretical computer science<br>
Email: george dot osipov at pm dot me </p>
<p>
<a href="https://dblp.uni-trier.de/pid/278/2442.html"><img src="images/dblp.png" title="DBLP" width="32" height="32"></a> &nbsp &nbsp
<a href="https://scholar.google.com/citations?user=MUFgTs0AAAAJ&hl=en"><img src="images/scholar.png" title="Google Scholar" width="32" height="32"></a> &nbsp &nbsp
<a href="https://github.com/gosip"><img src="images/github.png" title="Github" width="32" height="32"></a>
</p>
</div>

<div style="float:right" width=45%>
<a href="https://youtu.be/RH9zNz9L_VA"><img src="images/mugshot_200x150.jpg" width=200px></a>
</div>

</div>

<p>
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 2026 I am at the Royal Holloway working with
<a href="https://pure.royalholloway.ac.uk/en/persons/magnus-wahlstr%C3%B6m">Magnus Wahlström</a>.

In 2025 I was working with
<a href="https://www.cs.ox.ac.uk/standa.zivny/">Standa Živný</a>
at the University of Oxford.
I did my PhD at Linköping University supervised by
<a href="https://www.ida.liu.se/~petjo00/">Peter Jonsson</a>
and
<a href="https://victorlagerkvist.github.io/">Victor Lagerkvist</a>.
My PhD was part of the
<a href="https://wasp-sweden.org/graduate-school/">WASP Graduate School</a>.
Originally, I'm from
<a href="https://duckduckgo.com/?q=georgia+caucasus&t=h_&iax=images&ia=images">Georgia</a>
where I did my BSc in computer science at
<a href="https://freeuni.edu.ge/en">Free University of Tbilisi</a>.
</p>

<!-- <h2>Research Interests</h2>
<p>I am broadly interested in theoretical computer science, with a focus on
constraint satisfaction problems and parameterized complexity.</p> -->

<h2>Publications</h2>
<ul  style="list-style-type:square;">
<li>
    Optimal FPT-Approximability for Modular Linear Equations <br>
    with K. K. Dabrowski, P. Jonsson, S. Ordyniak, and M. Wahlström. <br>
    <a href="https://arxiv.org/abs/2604.10369">arXiv</a>
</li>
<li>
    Parameterized Approximability for Modular Linear Equations <br>
    with K. K. Dabrowski, P. Jonsson, S. Ordyniak, and M. Wahlström. <br>
	<a href="https://doi.org/10.4230/LIPIcs.ESA.2025.88">ESA'25</a> |
    <a href="https://arxiv.org/abs/2509.04976">arXiv</a> |
	<a href="slides/minlin-mod-talk-esa2025.pdf">slides</a>
</li>
<li>
    Towards a Parameterized Approximation Dichotomy of MinCSP for Linear Equations over Finite Commutative Rings <br>
    with K. K. Dabrowski, P. Jonsson, S. Ordyniak, and M. Wahlström. <br>
    <a href="https://arxiv.org/abs/2410.09932">arXiv</a>
</li>
<li>
    CSPs with Few Alien Constraints <br>
    with P. Jonsson and V. Lagerkvist <br>
    <a href="https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.15">CP'24</a> |
    <a href="https://arxiv.org/abs/2408.12909">arXiv</a></li>
</li>
<li>
    Solving Quantified Boolean Formulas with Few Existential Variables <br>
    with L. Eriksson, V. Lagerkvist, S. Ordyniak, F. Panolan and M. Rychlicki <br>
    <a href="https://www.ijcai.org/proceedings/2024/0209">IJCAI'24</a> |
    <a href="https://arxiv.org/abs/2405.06485">arXiv</a>
</li>
<li>
    Algorithms and Complexity of Difference Logic <br>
    with K. K. Dabrowski, P. Jonsson, and S. Ordyniak. <br>
	<a href="https://doi.org/10.1016/j.jcss.2026.103780">JCSS</a> |
    <a href="https://arxiv.org/abs/2402.03273">arXiv</a>
</li>
<li>
    Parameterized Complexity of MinCSP over the Point Algebra <br>
    with M. Pilipczuk and M. Wahlström. <br>
    <a href="https://doi.org/10.4230/LIPIcs.ESA.2024.93">ESA'24</a> |
    <a href="https://arxiv.org/abs/2310.05839">arXiv</a> |
    <a href="slides/point-algebra-esa24.pdf">slides</a>

</li>
<li>
    Parameterized Complexity Classification for Interval Constraints <br>
    with K. K. Dabrowski, P. Jonsson, S. Ordyniak, M. Pilipczuk and R. Sharma. <br>
    <a href="https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.11">IPEC'23</a> |
    <a href="https://arxiv.org/abs/2305.13889">arXiv</a>
</li>
<li>
    Parameterized Complexity of Equality MinCSP <br>
    with M. Wahlström. <br>
    <a href="https://drops.dagstuhl.de/opus/volltexte/2023/18739">ESA'23</a> |
    <a href="https://arxiv.org/abs/2305.11131">arXiv</a> |
    <a href="slides/equality-mincsp-mpii.pdf">slides</a>
</li>
<li>
    Almost Consistent Systems of Linear Equations <br>
    with K. K. Dabrowski, P. Jonsson, S. Ordyniak, and M. Wahlström. <br>
    <a href="https://dl.acm.org/doi/10.1145/3733107">TALG</a> |
    <a href="https://epubs.siam.org/doi/abs/10.1137/1.9781611977554.ch121">SODA'23</a> |
    <a href="https://arxiv.org/abs/2208.02732">arXiv</a> |
    <a href="slides/minlin-pccr22.pdf">slides</a>
</li>
<li>
    Concise Representations and Complexity of Combinatorial Assignment Problems <em>(extended abstract)</em> <br>
    with F. Präntare and L. Eriksson. <br>
    <a href="https://www.ifaamas.org/Proceedings/aamas2022/pdfs/p1714.pdf">AAMAS'22</a>
</li>
<li>
    Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach <br>
    with K. K. Dabrowski, P. Jonsson, and S. Ordyniak. <br>
    <a href="https://doi.org/10.1609/aaai.v36i4.20286">AAAI'22</a> |
    <a href="slides/almostp-aaai22.pdf">slides</a>
</li>
<li>

    Acyclic Orders, Partition Schemes and CSPs: Unified Hardness Proofs and Improved Algorithms <br>
    with P. Jonsson and V. Lagerkvist. <br>
    <a href="https://doi.org/10.1016/j.artint.2021.103505">Artif. Intell.</a> |
    <a href="papers/ai2021.pdf">article</a> |
    <a href="slides/acyclic-ijcai21.pdf">slides</a>
</li>
<li>
    Solving Infinite-Domain CSPs Using the Patchwork Property <br>
    with K. K. Dabrowski, P. Jonsson, and S. Ordyniak. <br>
    <a href="https://www.sciencedirect.com/science/article/pii/S0004370223000267">Artif. Intell.</a> |
    <a href="papers/artint23.pdf">article</a> |
    <a href="slides/patchwork-aaai21.pdf">slides</a>

</li>
<li>
    Disjunctive Temporal Problems under Structural Restrictions</a> <br>
    with K. K. Dabrowski, P. Jonsson, and S. Ordyniak. <br>
    <a href="https://ojs.aaai.org/index.php/AAAI/article/view/16489">AAAI'21</a>
</li>
<li>
    Fine-Grained Complexity of Temporal Problems <br>
    with K. K. Dabrowski, P. Jonsson, and S. Ordyniak. <br>
    <a href="https://proceedings.kr.org/2020/29/">KR'20</a> |
    <a href="slides/temporal-kr20.pdf">slides</a>
</li>
</ul>

<h2>PhD Thesis</h2>

On Infinite-Domain CSPs Parameterized by Solution Cost &nbsp &nbsp
<a href=papers/phd-thesis.pdf>[PDF]</a> | <a href="https://doi.org/10.3384/9789180754972">[DOI]</a>

</div>
</div>

</body>
</html>