3 citations · 3 across the 1 of their papers we have counts for
2 papers
cs.DS2017
On vertex coloring without monochromatic triangles
Michał Karpiński, Krzysztof Piecuch
We study a certain relaxation of the classic vertex coloring problem, namely, a coloring of vertices of undirected, simple graphs, such that there are no monochromatic triangles. W…
cs.DS2015★ 3 cited
Smaller Selection Networks for Cardinality Constraints Encoding
Michał Karpiński, Marek Piotrów
Selection comparator networks have been studied for many years. Recently, they have been successfully applied to encode cardinality constraints for SAT-solvers. To decrease the siz…