Libor Barto
Orcid: 0000-0002-8481-6458Affiliations:
- Charles University, Prague, Czech Republic
According to our database1,
Libor Barto
authored at least 44 papers
between 2005 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2006
2008
2010
2012
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
7
2
3
1
2
2
1
3
2
1
1
1
1
3
1
1
1
3
4
1
2
1
2
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2024
TheoretiCS, 2024
CoRR, 2024
The Sherali-Adams and Weisfeiler-Leman hierarchies in (Promise Valued) Constraint Satisfaction Problems.
CoRR, 2024
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024
2023
Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023
2022
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
Proceedings of the 28th International Conference on Principles and Practice of Constraint Programming, 2022
Proceedings of the 28th International Conference on Principles and Practice of Constraint Programming, 2022
2021
Erratum: Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures.
J. Math. Log., 2021
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021
Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021
2020
Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems).
SIAM J. Comput., 2020
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020
2019
Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures.
J. Math. Log., 2019
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019
Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019
2017
The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017
Proceedings of the Constraint Satisfaction Problem: Complexity and Approximability, 2017
Proceedings of the Constraint Satisfaction Problem: Complexity and Approximability, 2017
2016
The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016
Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016
2015
2014
2013
2012
Log. Methods Comput. Sci., 2012
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012
2011
Electron. Colloquium Comput. Complex., 2011
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011
2010
Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010
2009
The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell).
SIAM J. Comput., 2009
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009
2008
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008
2005
Appl. Categorical Struct., 2005