Talks and Poster Presentations (without Proceedings-Entry):
M. Löffler, M. Nöllenburg:
Slanted and curved nonograms are a new type of picture puzzles introduced by van de Kerkhofet al.(2019). They consist of an arrangement of lines or curves within a frameB, where some ofthe cells need to be colored in order to obtain the solution picture. Up to two clues are attachedas numeric labels to each line on either side ofB. In this paper we study the algorithmic problemof optimizing or deciding the existence of a placement of the given clue labels to a nonogram. Weprovide polynomial-time algorithms for restricted cases and proveNP-completeness in general.
Electronic version of the publication:
Created from the Publication Database of the Vienna University of Technology.