| Solving Infinite-Domain CSPs Using the Patchwork Property KK Dabrowski, P Jonsson, S Ordyniak, G Osipov Proc. 35th AAAI Conference on Artificial Intelligence (AAAI-2021), 2021 | 8 | 2021 |
| Fine-grained complexity of temporal problems KK Dabrowski, P Jonsson, S Ordyniak, G Osipov Proceedings of the 17th International Conference on Principles of Knowledge …, 2020 | 6 | 2020 |
| Almost consistent systems of linear equations KK Dabrowski, P Jonsson, S Ordyniak, G Osipov, M Wahlström Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 5 | 2023 |
| Acyclic orders, partition schemes and CSPs: Unified hardness proofs and improved algorithms P Jonsson, V Lagerkvist, G Osipov Artificial Intelligence 296, 103505, 2021 | 5 | 2021 |
| Parameterized complexity classification for interval constraints KK Dabrowski, P Jonsson, S Ordyniak, G Osipov, M Pilipczuk, R Sharma arXiv preprint arXiv:2305.13889, 2023 | 3 | 2023 |
| Parameterized Complexity of Equality MinCSP G Osipov, M Wahlström arXiv preprint arXiv:2305.11131, 2023 | 2 | 2023 |
| Resolving inconsistencies in simple temporal problems: A parameterized approach KK Dabrowski, P Jonsson, S Ordyniak, G Osipov Proceedings of the AAAI Conference on Artificial Intelligence 36 (4), 3724-3732, 2022 | 2 | 2022 |
| Disjunctive Temporal Problems under Structural Restrictions KK Dabrowski, P Jonsson, S Ordyniak, G Osipov Proc. 35th AAAI Conference on Artificial Intelligence (AAAI-2021), 2021 | 2 | 2021 |
| Solving Quantified Boolean Formulas with Few Existential Variables L Eriksson, V Lagerkvist, G Osipov, S Ordyniak, F Panolan, M Rychlicki arXiv preprint arXiv:2405.06485, 2024 | | 2024 |
| On Infinite-Domain CSPs Parameterized by Solution Cost G Osipov Linköping University Electronic Press, 2024 | | 2024 |
| Algorithms and Complexity of Difference Logic KK Dabrowski, P Jonsson, S Ordyniak, G Osipov arXiv preprint arXiv:2402.03273, 2024 | | 2024 |
| Directed Symmetric Multicut is W [1]-hard G Osipov, M Pilipczuk arXiv preprint arXiv:2310.05839, 2023 | | 2023 |
| Parameterized Complexity Classification for Interval Constraints S Ordyniak, K Dabrowski, P Jonsson, G Osipov, M Pilipczuk, R Sharma Dagstuhl Reports, 2023 | | 2023 |
| Home of TCSLAB G Osipov Linköping University, 2022 | | 2022 |
| Concise Representations and Complexity of Combinatorial Assignment Problems F Präntare, G Osipov, L Eriksson Proceedings of the 21st International Conference on Autonomous Agents and …, 2022 | | 2022 |
| Parameterized Complexity of MinCSP over the Point Algebra G Osipov, M Pilipczuk, M Wahlström | | |
| Classifying Constraint Satisfaction Problems V Lagerkvist, G Osipov, IDA TCSLAB | | |
Peter JonssonProfessor in Computer Science, Linköping University在 liu.se 的电子邮件经过验证
