{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:54:25Z","timestamp":1725558865644},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245285"},{"type":"electronic","value":"9783540318439"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31843-9_32","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T20:54:14Z","timestamp":1278363254000},"page":"318-328","source":"Crossref","is-referenced-by-count":3,"title":["Train Tracks and Confluent Drawings"],"prefix":"10.1007","author":[{"given":"Peter","family":"Hui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcus","family":"Schaefer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"\u0160tefankovi\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1999)"},{"key":"32_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24595-7_1","volume-title":"Graph Drawing","author":"M.T. Dickerson","year":"2004","unstructured":"Dickerson, M.T., Eppstein, D., Goodrich, M.T., Meng, J.Y.: Confluent drawings: visualizing non-planar diagrams in a planar way. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 1\u201312. Springer, Heidelberg (2004)"},{"key":"32_CR3","unstructured":"Eppstein, D.: Personal communication (2004)"},{"issue":"3","key":"32_CR4","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M.R. Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM Journal on Algebraic and Discrete Methods\u00a04(3), 312\u2013316 (1983)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1002\/jgt.3190020209","volume":"2","author":"M. Golombic","year":"1978","unstructured":"Golombic, M., Goss, C.F.: Perfect elimination and chordal bipartite graphs. J. Graph Theory\u00a02, 155\u2013163 (1978)","journal-title":"J. Graph Theory"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Penner, R.C., Harer, J.L.: Combinatorics of train tracks. Annals of mathematics studies, vol.\u00a0125. Princeton University Press, Princeton (1992)","DOI":"10.1515\/9781400882458"},{"issue":"2","key":"32_CR7","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0022-0000(03)00045-X","volume":"67","author":"M. Schaefer","year":"2003","unstructured":"Schaefer, M., Sedgwick, E., \u0160tefankovi\u010d, D.: Recognizing string graphs in NP. J. Comput. System Sci.\u00a067(2), 365\u2013380 (2003); Special issue on STOC 2002, Montreal, QC","journal-title":"J. Comput. System Sci."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31843-9_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:28:17Z","timestamp":1605760097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31843-9_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245285","9783540318439"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31843-9_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}