research
∙
05/09/2022
Reusing Comparator Networks in Pseudo-Boolean Encodings
A Pseudo-Boolean (PB) constraint is a linear inequality constraint over ...
share
research
∙
10/09/2021
Linear-time algorithm for vertex 2-coloring without monochromatic triangles on planar graphs
In the problem of 2-coloring without monochromatic triangles (or triangl...
research
∙
11/01/2019
CNF Encodings of Cardinality Constraints Based on Comparator Networks
Boolean Satisfiability Problem (SAT) is one of the core problems in comp...
research
∙
10/19/2017
On vertex coloring without monochromatic triangles
We study a certain relaxation of the classic vertex coloring problem, na...
research
∙
01/21/2014
