{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T13:10:08Z","timestamp":1748783408223,"version":"3.41.0"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319295152"},{"type":"electronic","value":"9783319295169"}],"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-319-29516-9_4","type":"book-chapter","created":{"date-parts":[[2016,2,19]],"date-time":"2016-02-19T05:05:19Z","timestamp":1455858319000},"page":"38-51","source":"Crossref","is-referenced-by-count":2,"title":["1-Page and 2-Page Drawings with Bounded Number of Crossings per Edge"],"prefix":"10.1007","author":[{"given":"Carla","family":"Binucci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emilio","family":"Di Giacomo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Md. Iqbal","family":"Hossain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,20]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-319-03841-4_8","volume-title":"Graph Drawing","author":"MJ Alam","year":"2013","unstructured":"Alam, M.J., Brandenburg, F.J., Kobourov, S.G.: Straight-line grid drawings of 3-connected 1-planar graphs. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 83\u201394. Springer, Heidelberg (2013)"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1007\/978-3-662-45803-7_18","volume-title":"Graph Drawing","author":"MJ Bannister","year":"2014","unstructured":"Bannister, M.J., Eppstein, D.: Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 210\u2013221. Springer, Heidelberg (2014)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-319-03841-4_30","volume-title":"Graph Drawing","author":"MJ Bannister","year":"2013","unstructured":"Bannister, M.J., Eppstein, D., Simons, J.A.: Fixed parameter tractability of crossing minimization of almost-trees. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 340\u2013351. Springer, Heidelberg (2013)"},{"issue":"3","key":"4_CR4","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/0095-8956(79)90021-2","volume":"27","author":"F Bernhart","year":"1979","unstructured":"Bernhart, F., Kainen, P.C.: The book thickness of a graph. J. Comb. Theor. Ser. B 27(3), 320\u2013331 (1979)","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"12","key":"4_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial $$k$$ -arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209(12), 1\u201345 (1998)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/0608002","volume":"8","author":"FRK Chung","year":"1987","unstructured":"Chung, F.R.K., Leighton, F.T., Rosenberg, A.L.: Embedding graphs in books: a layout problem with applications to VLSI design. SIAM J. Discrete Math. 8(1), 33\u201358 (1987)","journal-title":"SIAM J. Discrete Math."},{"key":"4_CR7","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G Di Battista","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Upper Saddle River (1999)"},{"issue":"8","key":"4_CR8","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1016\/j.comgeo.2013.03.001","volume":"46","author":"E Giacomo Di","year":"2013","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Montecchiani, F.: Area requirement of graph drawings with few crossings per edge. Comput. Geom. 46(8), 909\u2013916 (2013)","journal-title":"Comput. Geom."},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/978-3-662-45803-7_15","volume-title":"Graph Drawing","author":"E Giacomo Di","year":"2014","unstructured":"Di Giacomo, E., Liotta, G., Montecchiani, F.: Drawing outer 1-planar graphs with few slopes. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 174\u2013185. Springer, Heidelberg (2014)"},{"issue":"1","key":"4_CR10","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/12.46286","volume":"39","author":"S Masuda","year":"1990","unstructured":"Masuda, S., Nakajima, K., Kashiwabara, T., Fujisawa, T.: Crossing minimization in linear embeddings of graphs. IEEE Trans. Comput. 39(1), 124\u2013127 (1990)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"4_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1049\/piee.1968.0004","volume":"115","author":"T Nicholson","year":"1968","unstructured":"Nicholson, T.: Permutation procedure for minimising the number of crossings in a network. Proc. Inst. Electr. Eng. 115(1), 21\u201326 (1968)","journal-title":"Proc. Inst. Electr. Eng."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Wattenberg, M.: Arc diagrams: visualizing structure in strings. In: InfoVis 2002, pp. 110\u2013116. IEEE Computer Society (2002)","DOI":"10.1109\/INFVIS.2002.1173155"},{"issue":"1","key":"4_CR13","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/0022-0000(89)90032-9","volume":"38","author":"M Yannakakis","year":"1989","unstructured":"Yannakakis, M.: Embedding planar graphs in four pages. J. Comput. Syst. Sci. 38(1), 36\u201367 (1989)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-29516-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T12:37:29Z","timestamp":1748781449000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-29516-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319295152","9783319295169"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-29516-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}