research
∙
02/28/2022
Improved bounds for acyclic coloring parameters
The acyclic chromatic number of a graph is the least number of colors ne...
share
research
∙
01/01/2019
Algorithmically Efficient Syntactic Characterization of Possibility Domains
We call domain any arbitrary subset of a Cartesian power of the set {0,1...
research
∙
08/13/2017
An interactive version of the Lovász local lemma
Assume we are given (finitely many) mutually independent variables and (...
research
∙
08/13/2017