Labeling nonograms: Boundary labeling for curve arrangements

Grid recognition: Classical and parameterized computational perspectives

“…Research at the intersection of graph drawing and parameterized complexity (and parameterized algorithms in particular) is in its infancy. Most (in particular, the early efforts) have been directed at variants of the classic Crossing Minimization problem, introduced by Turán in 1940 [47], parameterized by the number of crossings (see, e.g., [30,38,23,35,36,39]). However, in the past few years, there is an increasing interest in the analysis of a variety of other problems in graph drawing from the perspective of parameterized complexity (see, e.g., [1, 10,2,31,13,34,6,19,18,11,21,41,40].…”