George Osipov - RankMe

27 papers A* 6A 5B 1Journal 14

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Algorithms and complexity of difference logic. J. Comput. Syst. Sci. Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
2025	J	`jnl`	Almost Consistent Systems of Linear Equations. ACM Trans. Algorithms Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
2025	A	`conf`	Parameterized Approximability for Modular Linear Equations. ESA Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
2025	J	`jnl`	Parameterized Approximability for Modular Linear Equations. CoRR Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
2024	J	`jnl`	Algorithms and Complexity of Difference Logic. CoRR Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
2024	A	`conf`	CSPs with Few Alien Constraints. CP Peter Jonsson, Victor Lagerkvist, George Osipov
2024	J	`jnl`	CSPs with Few Alien Constraints. CoRR Peter Jonsson, Victor Lagerkvist, George Osipov
2024	—	`—`	On Infinite-Domain CSPs Parameterized by Solution Cost. George Osipov
2024	A	`conf`	Parameterized Complexity of MinCSP over the Point Algebra. ESA George Osipov, Marcin Pilipczuk, Magnus Wahlström
2024	A*	`conf`	Solving Quantified Boolean Formulas with Few Existential Variables. IJCAI Leif Eriksson, Victor Lagerkvist, Sebastian Ordyniak, George Osipov, Fahad Panolan, Mateusz Rychlicki
2024	J	`jnl`	Solving Quantified Boolean Formulas with Few Existential Variables. CoRR Leif Eriksson, Victor Lagerkvist, George Osipov, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki
2024	J	`jnl`	Towards a Parameterized Approximation Dichotomy of MinCSP for Linear Equations over Finite Commutative Rings. CoRR Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
2023	A*	`conf`	Almost Consistent Systems of Linear Equations. SODA Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
2023	J	`jnl`	Directed Symmetric Multicut is W[1]-hard. CoRR George Osipov, Marcin Pilipczuk
2023	B	`conf`	Parameterized Complexity Classification for Interval Constraints. IPEC Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma
2023	J	`jnl`	Parameterized Complexity Classification for Interval Constraints. CoRR Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma
2023	A	`conf`	Parameterized Complexity of Equality MinCSP. ESA George Osipov, Magnus Wahlström
2023	J	`jnl`	Parameterized Complexity of Equality MinCSP. CoRR George Osipov, Magnus Wahlström
2023	J	`jnl`	Solving infinite-domain CSPs using the patchwork property. Artif. Intell. Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
2022	J	`jnl`	Almost Consistent Systems of Linear Equations. CoRR Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
2022	A	`conf`	Concise Representations and Complexity of Combinatorial Assignment Problems. AAMAS Fredrik Präntare, George Osipov, Leif Eriksson
2022	A*	`conf`	Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach. AAAI Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
2021	J	`jnl`	Acyclic orders, partition schemes and CSPs: Unified hardness proofs and improved algorithms. Artif. Intell. Peter Jonsson, Victor Lagerkvist, George Osipov
2021	A*	`conf`	Disjunctive Temporal Problems under Structural Restrictions. AAAI Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
2021	A*	`conf`	Solving Infinite-Domain CSPs Using the Patchwork Property. AAAI Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
2021	J	`jnl`	Solving Infinite-Domain CSPs Using the Patchwork Property. CoRR Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
2020	A*	`conf`	Fine-Grained Complexity of Temporal Problems. KR Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov