default search action
George Osipov
Person information
- affiliation: Linköping University, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [b1]George Osipov
:
On Infinite-Domain CSPs Parameterized by Solution Cost. Linköping University, Sweden, 2024 - [c11]Peter Jonsson, Victor Lagerkvist, George Osipov:
CSPs with Few Alien Constraints. CP 2024: 15:1-15:17 - [c10]George Osipov, Marcin Pilipczuk, Magnus Wahlström:
Parameterized Complexity of MinCSP over the Point Algebra. ESA 2024: 93:1-93:15 - [c9]Leif Eriksson, Victor Lagerkvist, Sebastian Ordyniak, George Osipov, Fahad Panolan, Mateusz Rychlicki:
Solving Quantified Boolean Formulas with Few Existential Variables. IJCAI 2024: 1889-1897 - [i9]Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov:
Algorithms and Complexity of Difference Logic. CoRR abs/2402.03273 (2024) - [i8]Leif Eriksson, Victor Lagerkvist, George Osipov, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki:
Solving Quantified Boolean Formulas with Few Existential Variables. CoRR abs/2405.06485 (2024) - [i7]Peter Jonsson, Victor Lagerkvist, George Osipov:
CSPs with Few Alien Constraints. CoRR abs/2408.12909 (2024) - [i6]Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström:
Towards a Parameterized Approximation Dichotomy of MinCSP for Linear Equations over Finite Commutative Rings. CoRR abs/2410.09932 (2024) - 2023
- [j2]Konrad K. Dabrowski
Solving infinite-domain CSPs using the patchwork property. Artif. Intell. 317: 103880 (2023) - [c8]George Osipov, Magnus Wahlström:
Parameterized Complexity of Equality MinCSP. ESA 2023: 86:1-86:17 - [c7]Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma:
Parameterized Complexity Classification for Interval Constraints. IPEC 2023: 11:1-11:19 - [c6]Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström:
Almost Consistent Systems of Linear Equations. SODA 2023: 3179-3217 - [i5]George Osipov, Magnus Wahlström:
Parameterized Complexity of Equality MinCSP. CoRR abs/2305.11131 (2023) - [i4]Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma:
Parameterized Complexity Classification for Interval Constraints. CoRR abs/2305.13889 (2023) - [i3]George Osipov, Marcin Pilipczuk:
Directed Symmetric Multicut is W[1]-hard. CoRR abs/2310.05839 (2023) - 2022
- [c5]Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov:
Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach. AAAI 2022: 3724-3732 - [c4]Fredrik Präntare, George Osipov, Leif Eriksson:
Concise Representations and Complexity of Combinatorial Assignment Problems. AAMAS 2022: 1714-1716 - [i2]Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström:
Almost Consistent Systems of Linear Equations. CoRR abs/2208.02732 (2022) - 2021
- [j1]Peter Jonsson, Victor Lagerkvist, George Osipov
Acyclic orders, partition schemes and CSPs: Unified hardness proofs and improved algorithms. Artif. Intell. 296: 103505 (2021) - [c3]Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak
Solving Infinite-Domain CSPs Using the Patchwork Property. AAAI 2021: 3715-3723 - [c2]Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak
Disjunctive Temporal Problems under Structural Restrictions. AAAI 2021: 3724-3732 - [i1]Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov:
Solving Infinite-Domain CSPs Using the Patchwork Property. CoRR abs/2107.01428 (2021) - 2020
- [c1]Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak
Fine-Grained Complexity of Temporal Problems. KR 2020: 284-293
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-25 22:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: