15 citations · 57 across the 24 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2021
Filling Crosswords is Very Hard
Laurent Gourvès, Ararat Harutyunyan, Michael Lampis +1
We revisit a classical crossword filling puzzle which already appeared in Garey\&Jonhson's book. We are given a grid with vertical and horizontal slots and a dictionary with $m…
cs.CC2020
Digraph Coloring and Distance to Acyclicity
Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
In -Digraph Coloring we are given a digraph and are asked to partition its vertices into at most sets, so that each set induces a DAG. This well-known problem is NP-hard, as…