@inproceedings{0cb6882888e545fbb430f21d38f6d032,

title = "The Partial Visibility Representation Extension Problem",

abstract = "For a graph G, a function psi is called a bar visibility representation of G when for each vertex v is an element of V (G), psi(v) is a horizontal line segment (bar) and uv is an element of E(G) iff there is an unobstructed, vertical, e-wide line of sight between psi(u) and psi(v). Graphs admitting such representations are well understood (via simple characterizations) and recognizable in linear time. For a directed graph G, a bar visibility representation. of G, additionally, for each directed edge (u, v) of G, puts the bar.(u) strictly below the bar.(v). We study a generalization of the recognition problem where a function psi' defined on a subset V' of V (G) is given and the question is whether there is a bar visibility representation psi of G with psi vertical bar V' = psi'. We show that for undirected graphs this problem together with closely related problems are NP-complete, but for certain cases involving directed graphs it is solvable in polynomial time.",

author = "Steven Chaplick and Grzegorz Guspiel and Grzegorz Gutowski and Tomasz Krawczyk and Giuseppe Liotta",

note = "DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.",

year = "2016",

doi = "10.1007/978-3-319-50106-2_21",

language = "English",

series = "Lecture Notes in Computer Science",

publisher = "Springer Nature Switzerland AG",

pages = "266--279",

editor = "Y. Hu and M. N{\"o}llenburg",

booktitle = "Graph Drawing and Network Visualization. GD 2016",

}