@inproceedings{7febbf8db2ae4e789af61341b62e8f3b,

title = "Bend-Bounded Path Intersection Graphs - Sausages, Noodles, and Waffles on a Grill",

abstract = "In this paper we study properties of intersection graphs of k-bend paths in the rectangular grid. A k-bend path is a path with at most k 90 degree turns. The class of graphs representable by intersections of k-bend paths is denoted by b k -vpg. We show here that for every fixed k, b k -vpg \(\subsetneq\) b k + 1-vpg and that recognition of graphs from b k -vpg is np-complete even when the input graph is given by a b k + 1-vpg representation. We also show that the class b k -vpg (for k ≥ 1) is in no inclusion relation with the class of intersection graphs of straight line segments in the plane.",

author = "Steven Chaplick and V{\'i}t Jel{\'i}nek and Jan Kratochv{\'i}l and Tom{\'a}s Vyskocil",

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 = "2012",

doi = "10.1007/978-3-642-34611-8_28",

language = "English",

series = "Lecture Notes in Computer Science",

publisher = "Springer, Berlin, Heidelberg",

pages = "274--285",

editor = "M.C. Golumbic and M. Stern and A. Levy and G. Morgenstern",

booktitle = "Graph-Theoretic Concepts in Computer Science. WG 2012",

address = "Germany",

}