Jakub Bulin

According to our database1, Jakub Bulin authored at least 9 papers between 2013 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
The smallest hard trees.
Constraints An Int. J., 2023

Short Definitions in Constraint Languages.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2021
Algebraic Approach to Promise Constraint Satisfaction.
J. ACM, 2021

2019
Algebraic approach to promise constraint satisfaction.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2018
On the complexity of ℍ-coloring for special oriented trees.
Eur. J. Comb., 2018

2015
A finer reduction of constraint problems to digraphs.
Log. Methods Comput. Sci., 2015

2014
On the complexity of $\mathbb H$-coloring for special oriented trees.
CoRR, 2014

2013
Csp Dichotomy for Special Polyads.
Int. J. Algebra Comput., 2013

On the Reduction of the CSP Dichotomy Conjecture to Digraphs.
Proceedings of the Principles and Practice of Constraint Programming, 2013


  Loading...