{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:10:34Z","timestamp":1743037834172,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662535356"},{"type":"electronic","value":"9783662535363"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53536-3_18","type":"book-chapter","created":{"date-parts":[[2016,9,27]],"date-time":"2016-09-27T12:39:25Z","timestamp":1474979965000},"page":"207-219","source":"Crossref","is-referenced-by-count":3,"title":["On Edge Intersection Graphs of Paths with 2 Bends"],"prefix":"10.1007","author":[{"given":"Martin","family":"Pergel","sequence":"first","affiliation":[]},{"given":"Pawe\u0142","family":"Rz\u0105\u017cewski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,28]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K Booth","year":"1976","unstructured":"Booth, K., Lueker, G.: Testing for the consecutive ones property, interval graphs, and planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13, 335\u2013389 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/3-540-45848-4_21","volume-title":"Graph Drawing","author":"J \u010cern\u00fd","year":"2002","unstructured":"\u010cern\u00fd, J., Kr\u00e1l, D., Nyklov\u00e1, H., Pangr\u00e1c, O.: On intersection graphs of segments with prescribed slopes. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 261\u2013271. Springer, Heidelberg (2002). doi: 10.1007\/3-540-45848-4_21"},{"key":"18_CR3","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"B Clark","year":"1990","unstructured":"Clark, B., Colbourn, C., Johnson, D.: Unit disk graphs. Disc. Math. 86, 165\u2013177 (1990)","journal-title":"Disc. Math."},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Cameron, K., Chaplick, S., Hoang, C.T.: Edge intersection graphs of $$L$$ -shaped paths in grids. Disc. Appl. Math. (2015, in press, available online)","DOI":"10.1016\/j.dam.2015.01.039"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/978-3-642-34611-8_28","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S Chaplick","year":"2012","unstructured":"Chaplick, S., Jel\u00ednek, V., Kratochv\u00edl, J., Vysko\u010dil, T.: Bend-bounded path intersection graphs: sausages, noodles, and waffles on a grill. In: Golumbic, M.C., Stern, M., Levy, A., Morgenstern, G. (eds.) WG 2012. LNCS, vol. 7551, pp. 274\u2013285. Springer, Heidelberg (2012)"},{"key":"18_CR6","doi-asserted-by":"crossref","first-page":"812","DOI":"10.1007\/s00453-013-9828-6","volume":"71","author":"M Francis","year":"2015","unstructured":"Francis, M., Gon\u00e7alves, D., Ochem, P.: The maximum clique problem in multiple interval graphs. Algoritmica 71, 812\u2013836 (2015)","journal-title":"Algoritmica"},{"key":"18_CR7","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1002\/net.20305","volume":"54","author":"M Golumbic","year":"2009","unstructured":"Golumbic, M., Lipshteyn, M., Stern, M.: Edge intersection graphs of single bend paths on a grid. Networks 54, 130\u2013138 (2009)","journal-title":"Networks"},{"key":"18_CR8","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.dam.2013.10.035","volume":"167","author":"D Heldt","year":"2014","unstructured":"Heldt, D., Knauer, K., Ueckerdt, T.: Edge-intersection graphs of grid paths: the bend-number. Disc. Appl. Math. 167, 144\u2013162 (2014)","journal-title":"Disc. Appl. Math."},{"key":"18_CR9","unstructured":"Lov\u00e1sz, L: Coverings and coloring of hypergraphs. In: Proceedings of the 4th SEICCGTC, pp. 3\u201312 (1973)"}],"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-662-53536-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T22:01:44Z","timestamp":1568412104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53536-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662535356","9783662535363"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53536-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}