List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Linear-time algorithm for vertex 2-coloring without monochromatic triangles on planar graphs | 2021-10-09 | Paper |
| Incremental encoding of pseudo-Boolean goal functions based on comparator networks | 2021-04-07 | Paper |
| Encoding cardinality constraints using multiway merge selection networks Constraints | 2019-11-27 | Paper |
| On vertex coloring without monochromatic triangles (available as arXiv preprint) | 2018-11-28 | Paper |
| Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency Theoretical Computer Science | 2017-12-20 | Paper |
| Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete Theoretical Computer Science | 2016-12-23 | Paper |
Research outcomes over time
This page was built for person: Michał Karpiński
