{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:24:56Z","timestamp":1760441096792},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642346101"},{"type":"electronic","value":"9783642346118"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34611-8_28","type":"book-chapter","created":{"date-parts":[[2012,10,22]],"date-time":"2012-10-22T08:42:25Z","timestamp":1350895345000},"page":"274-285","source":"Crossref","is-referenced-by-count":13,"title":["Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill"],"prefix":"10.1007","author":[{"given":"Steven","family":"Chaplick","sequence":"first","affiliation":[]},{"given":"V\u00edt","family":"Jel\u00ednek","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[]},{"given":"Tom\u00e1\u0161","family":"Vysko\u010dil","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.endm.2011.05.025","volume":"37","author":"A. Asinowski","year":"2011","unstructured":"Asinowski, A., Cohen, E., Golumbic, M.C., Limouzy, V., Lipshteyn, M., Stern, M.: String graphs of k-bend paths on a grid. Electronic Notes in Discrete Mathematics\u00a037, 141\u2013146 (2011)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"2","key":"28_CR2","doi-asserted-by":"publisher","first-page":"129","DOI":"10.7155\/jgaa.00253","volume":"16","author":"A. Asinowski","year":"2012","unstructured":"Asinowski, A., Cohen, E., Golumbic, M.C., Limouzy, V., Lipshteyn, M., Stern, M.: Vertex Intersection Graphs of Paths on a Grid. Journal of Graph Algorithms and Applications\u00a016(2), 129\u2013150 (2012)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1109\/12.46293","volume":"39","author":"M. Bandy","year":"1990","unstructured":"Bandy, M., Sarrafzadeh, M.: Stretching a knock-knee layout for multilayer wiring. IEEE Trans. Computing\u00a039, 148\u2013151 (1990)","journal-title":"IEEE Trans. Computing"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0012-365X(93)90354-V","volume":"114","author":"S. Bellantoni","year":"1993","unstructured":"Bellantoni, S., Ben-Arroyo Hartman, I., Przytycka, T.M., Whitesides, S.: Grid intersection graphs and boxicity. Discrete Mathematics\u00a0114, 41\u201349 (1993)","journal-title":"Discrete Mathematics"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-642-25870-1_29","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S. Chaplick","year":"2011","unstructured":"Chaplick, S., Cohen, E., Stacho, J.: Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid. In: Kolman, P., Kratochv\u00edl, J. (eds.) WG 2011. LNCS, vol.\u00a06986, pp. 319\u2013330. Springer, Heidelberg (2011)"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-642-12200-2_13","volume-title":"LATIN 2010: Theoretical Informatics","author":"M.D. Coury","year":"2010","unstructured":"Coury, M.D., Hell, P., Kratochv\u00edl, J., Vysko\u010dil, T.: Faithful Representations of Graphs by Islands in the Extended Grid. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol.\u00a06034, pp. 131\u2013142. Springer, Heidelberg (2010)"},{"unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice-Hall (1999)","key":"28_CR7"},{"unstructured":"Golumbic, M.C., Ries, B.: On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs. To Appear in Graphs and Combinatorics","key":"28_CR8"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0095-8956(91)90091-W","volume":"52","author":"J. Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J.: String graphs II, Recognizing string graphs is NP-hard. J. Comb. Theory, Ser. B\u00a052, 67\u201378 (1991)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0095-8956(91)90050-T","volume":"53","author":"J. Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: String graphs requiring exponential representations. J. Comb. Theory, Ser. B\u00a053, 1\u20134 (1991)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0166-218X(94)90143-0","volume":"52","author":"J. Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J.: A Special Planar Satisfiability Problem and a Consequence of Its NP-completeness. Discrete Applied Mathematics\u00a052, 233\u2013252 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1006\/jctb.1994.1071","volume":"62","author":"J. Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: Intersection Graphs of Segments. J. Comb. Theory, Ser. B\u00a062, 289\u2013315 (1994)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"28_CR13","first-page":"3","volume":"27","author":"P. Molitor","year":"1991","unstructured":"Molitor, P.: A survey on wiring. EIK Journal of Information Processing and Cybernetics\u00a027, 3\u201319 (1991)","journal-title":"EIK Journal of Information Processing and Cybernetics"},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0022-0000(03)00045-X","volume":"67","author":"M. Schaefer","year":"2003","unstructured":"Schaefer, M., Sedgwick, E., Stefankovic, D.: Recognizing string graphs in NP. J. Comput. Syst. Sci.\u00a067, 365\u2013380 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"28_CR15","doi-asserted-by":"crossref","first-page":"1639","DOI":"10.1002\/j.1538-7305.1966.tb01713.x","volume":"45","author":"F. Sinden","year":"1966","unstructured":"Sinden, F.: Topology of thin film circuits. Bell System Tech. J.\u00a045, 1639\u20131662 (1966)","journal-title":"Bell System Tech. J."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34611-8_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:00:46Z","timestamp":1620133246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34611-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642346101","9783642346118"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34611-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}