George Osipov

According to our database, George Osipov authored at least 17 papers between 2020 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Parameterized Approximability for Modular Linear Equations.

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

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

2024

On Infinite-Domain CSPs Parameterized by Solution Cost.

George Osipov

PhD thesis, 2024

Towards a Parameterized Approximation Dichotomy of MinCSP for Linear Equations over Finite Commutative Rings.

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

CoRR, 2024

Algorithms and Complexity of Difference Logic.

Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov

CoRR, 2024

Solving Quantified Boolean Formulas with Few Existential Variables.

Leif Eriksson, Victor Lagerkvist, Sebastian Ordyniak, George Osipov, Fahad Panolan, Mateusz Rychlicki

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Parameterized Complexity of MinCSP over the Point Algebra.

George Osipov, Marcin Pilipczuk, Magnus Wahlström

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

CSPs with Few Alien Constraints.

Peter Jonsson, Victor Lagerkvist, George Osipov

Proceedings of the 30th International Conference on Principles and Practice of Constraint Programming, 2024

2023

Directed Symmetric Multicut is W[1]-hard.

George Osipov, Marcin Pilipczuk

CoRR, 2023

Almost Consistent Systems of Linear Equations.

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

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Parameterized Complexity Classification for Interval Constraints.

Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Parameterized Complexity of Equality MinCSP.

George Osipov, Magnus Wahlström

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Concise Representations and Complexity of Combinatorial Assignment Problems.

Fredrik Präntare, George Osipov, Leif Eriksson

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach.

Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Acyclic orders, partition schemes and CSPs: Unified hardness proofs and improved algorithms.

Peter Jonsson, Victor Lagerkvist, George Osipov

Artif. Intell., 2021

Disjunctive Temporal Problems under Structural Restrictions.

Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Solving Infinite-Domain CSPs Using the Patchwork Property.

Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Fine-Grained Complexity of Temporal Problems.

Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov

Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020