George Osipov

Orcid: 0000-0002-2884-9837

Affiliations:
  • Linköping University, Sweden


According to our database1, George Osipov authored at least 11 papers between 2020 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Algorithms and Complexity of Difference Logic.
CoRR, 2024

2023
Solving infinite-domain CSPs using the patchwork property.
Artif. Intell., April, 2023

Directed Symmetric Multicut is W[1]-hard.
CoRR, 2023

Almost Consistent Systems of Linear Equations.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Parameterized Complexity Classification for Interval Constraints.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Parameterized Complexity of Equality MinCSP.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
Concise Representations and Complexity of Combinatorial Assignment Problems.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

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

Disjunctive Temporal Problems under Structural Restrictions.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Fine-Grained Complexity of Temporal Problems.
Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020


  Loading...