{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:01:27Z","timestamp":1743116487887,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319123394"},{"type":"electronic","value":"9783319123400"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12340-0_5","type":"book-chapter","created":{"date-parts":[[2014,10,20]],"date-time":"2014-10-20T04:27:23Z","timestamp":1413779243000},"page":"56-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Vertex Contact Graphs of Paths on a Grid"],"prefix":"10.1007","author":[{"given":"Nieke","family":"Aerts","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Felsner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,21]]},"reference":[{"key":"5_CR1","unstructured":"Aerts, N., Felsner, S.: Vertex Contact graphs of Paths on a Grid. http:\/\/page.math.tu-berlin.de\/~aerts\/pubs\/vcpg.pdf"},{"key":"5_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. J. Graph Algorithms Appl. 16, 129\u2013150 (2012)","journal-title":"J. Graph Algorithms Appl."},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"475","DOI":"10.7155\/jgaa.00300","volume":"17","author":"S Chaplick","year":"2013","unstructured":"Chaplick, S., Ueckerdt, T.: Planar graphs as VPG-graphs. J. Graph Algorithms Appl. 17, 475\u2013494 (2013)","journal-title":"J. Graph Algorithms Appl."},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0012-365X(00)00201-6","volume":"229","author":"H de Fraysseix","year":"2001","unstructured":"de Fraysseix, H., de Mendez, P.O.: On topological aspects of orientations. Discrete Math. 229, 57\u201372 (2001)","journal-title":"Discrete Math."},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/BF02574056","volume":"13","author":"H de Fraysseix","year":"1995","unstructured":"de Fraysseix, H., de Mendez, P.O., Pach, J.: A left-first search algorithm for planar graphs. Discrete Comput. Geom. 13, 459\u2013468 (1995)","journal-title":"Discrete Comput. Geom."},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-1-4614-0110-0_12","volume-title":"Thirty Essays on Geometric Graph Theory","author":"S Felsner","year":"2013","unstructured":"Felsner, S.: Rectangle and square representations of planar graphs. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp. 213\u2013248. Springer, New York (2013)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-62495-3_45","volume-title":"Graph Drawing","author":"U F\u00f6\u00dfmeier","year":"1997","unstructured":"F\u00f6\u00dfmeier, U., Kant, G., Kaufmann, M.: 2-visibility drawings of planar graphs. In: North, Stephen C. (ed.) GD 1996. LNCS, vol. 1190, pp. 155\u2013168. Springer, Heidelberg (1997)"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0012-365X(91)90069-E","volume":"87","author":"IB-A Hartman","year":"1991","unstructured":"Hartman, I.B.-A., Newman, I., Ziv, R.: On grid intersection graphs. Discrete Math. 87, 41\u201352 (1991)","journal-title":"Discrete Math."},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Kobourov, S.G., Ueckerdt, T., Verbeek, K.: Combinatorial and geometric properties of planar laman graphs. In: Khanna, S. (ed.) SODA, pp. 1668\u20131678. SIAM (2013)","DOI":"10.1137\/1.9781611973105.120"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0166-218X(94)00020-E","volume":"63","author":"MW Sch\u00e4ffter","year":"1995","unstructured":"Sch\u00e4ffter, M.W.: Drawing graphs on rectangular grids. Discrete Appl. Math. 63, 75\u201389 (1995)","journal-title":"Discrete Appl. Math."},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R Tamassia","year":"1987","unstructured":"Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput. 16, 421\u2013444 (1987)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12340-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T04:16:16Z","timestamp":1675829776000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12340-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319123394","9783319123400"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12340-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"21 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}