{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:13:12Z","timestamp":1725495192090},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001584"},{"type":"electronic","value":"9783540361510"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36151-0_4","type":"book-chapter","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T12:14:14Z","timestamp":1195215254000},"page":"31-41","source":"Crossref","is-referenced-by-count":9,"title":["Drawing Graphs on Two and Three Lines"],"prefix":"10.1007","author":[{"given":"Sabine","family":"Cornelsen","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Schank","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"T. C. Biedl. Drawing planar partitions I: LL-drawings and LH-drawings. In Proceedings of the 14th Annual ACM Symposium on Computational Geometry (SCG\u2019 98), pages 287\u2013296, 1998.","DOI":"10.1145\/276884.276917"},{"key":"4_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/10692760_11","volume-title":"Drawing planar partitions II: HHdrawings","author":"T. C. Biedl","year":"1998","unstructured":"T. C. Biedl, M. Kaufmann, and P. Mutzel. Drawing planar partitions II: HHdrawings. In J. Hromkovic, editor, Graph Theoretic Cocepts in Computer Science, 24th International Workshop, (WG\u2019 98), volume 1517of Lecture Notes in Computer Science, pages 124\u2013136. Springer, 1998."},{"key":"4_CR3","unstructured":"P. Eades, B. D. McKay, and N. C. Wormald. On an edge crossing problem. In Proceedings of the 9th Australian Computer Science Conference (ACSC 9), pages 327\u2013334, 1986."},{"key":"4_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/3-540-45848-4_26","volume-title":"Straight-line drawings on restricted integer grids in two and three dimensions","author":"S. Felsner","year":"2002","unstructured":"S. Felsner, G. Liotta, and S. K. Wismath. Straight-line drawings on restricted integer grids in two and three dimensions. In M. J\u00fcnger and P. Mutzel, editors, Proceedings of the 9th International Symposium on Graph Drawing (GD 2001), volume 2265of Lecture Notes in Computer Science, pages 328\u2013342. Springer, 2002."},{"key":"4_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/3-540-62592-5_66","volume-title":"Nice drawings for planar bipartite graphs","author":"U. F\u00f6\u00dfmeier","year":"1997","unstructured":"U. F\u00f6\u00dfmeier and M. Kaufmann. Nice drawings for planar bipartite graphs. In G. Bongiovanni, D. P. Bovet, and G. Di Battista, editors, Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC\u2019 97), volume 1203 of Lecture Notes in Computer Science, pages 122\u2013134. Springer, 1997."},{"key":"4_CR6","first-page":"203","volume":"1","author":"F. Harary","year":"1972","unstructured":"F. Harary and A. Schwenk. A new crossing number for bipartite graphs. Utilitas Mathematica, 1:203\u2013209, 1972.","journal-title":"Utilitas Mathematica"},{"key":"4_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/3-540-37623-2_17","volume-title":"Level planarity testing in linear time","author":"M. J\u00fcnger","year":"1998","unstructured":"M. J\u00fcnger, S. Leipert, and P. Mutzel. Level planarity testing in linear time. In S. H. Whitesides, editor, Proceedings of the 6th International Symposium on Graph Drawing (GD\u2019 98), volume 1547 of Lecture Notes in Computer Science, pages 224\u2013237. Springer, 1998."},{"key":"4_CR8","unstructured":"T. Schank. Algorithmen zur Visualisierung planarer partitionierter Graphen. Master\u2019s thesis, Universit\u00e4t Konstanz, 2001. http:\/\/www.inf.uni-konstanz.de\/algo\/lehre\/theses\/ ."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36151-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T11:31:58Z","timestamp":1556969518000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36151-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001584","9783540361510"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-36151-0_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}