20 citations · 49 across the 8 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2022★ 1 cited
Reusing Comparator Networks in Pseudo-Boolean Encodings
Michał Karpiński, Marek Piotrów
A Pseudo-Boolean (PB) constraint is a linear inequality constraint over Boolean literals. One of the popular, efficient ideas used to solve PB-problems (a set of PB-constraints) is…
cs.DS2021
Linear-time algorithm for vertex 2-coloring without monochromatic triangles on planar graphs
Michał Karpiński, Krzysztof Piecuch
In the problem of 2-coloring without monochromatic triangles (or triangle-tree 2-coloring), vertices of the simple, connected, undirected graph are colored with either 'black' or '…
cs.DS2019
CNF Encodings of Cardinality Constraints Based on Comparator Networks
Michał Karpiński
Boolean Satisfiability Problem (SAT) is one of the core problems in computer science. As one of the fundamental NP-complete problems, it can be used - by known reductions - to repr…