{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:47:18Z","timestamp":1743122838945,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319272603"},{"type":"electronic","value":"9783319272610"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27261-0_24","type":"book-chapter","created":{"date-parts":[[2015,11,26]],"date-time":"2015-11-26T01:24:59Z","timestamp":1448501099000},"page":"281-294","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["2-Layer Fan-Planarity: From Caterpillar to Stegosaurus"],"prefix":"10.1007","author":[{"given":"Carla","family":"Binucci","sequence":"first","affiliation":[]},{"given":"Markus","family":"Chimani","sequence":"additional","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Gronemann","sequence":"additional","affiliation":[]},{"given":"Karsten","family":"Klein","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[]},{"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[]},{"given":"Ioannis G.","family":"Tollis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,27]]},"reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/978-3-662-45803-7_17","volume-title":"Graph Drawing","author":"MA Bekos","year":"2014","unstructured":"Bekos, M.A., Cornelsen, S., Grilli, L., Hong, S.-H., Kaufmann, M.: On the recognition of fan-planar and maximal outer-fan-planar graphs. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 198\u2013209. Springer, Heidelberg (2014)"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.tcs.2015.04.020","volume":"589","author":"C Binucci","year":"2015","unstructured":"Binucci, C., Di Giacomo, E., Didimo, W., Montecchiani, F., Patrignani, M., Symvonis, A., Tollis, I.G.: Fan-planarity: properties and complexity. Theor. Comput. Sci. 589, 76\u201386 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR3","doi-asserted-by":"publisher","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 graph planarity using PQ-trees. J. Comput. Syst. Sci. 13, 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"24_CR4","volume-title":"Graph Drawing","author":"G Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Upper Saddle River (1999)"},{"issue":"4","key":"24_CR5","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1007\/s00453-012-9706-7","volume":"68","author":"E Giacomo Di","year":"2014","unstructured":"Di Giacomo, E., Didimo, W., Eades, P., Liotta, G.: 2-layer right angle crossing drawings. Algorithmica 68(4), 954\u2013997 (2014)","journal-title":"Algorithmica"},{"issue":"5","key":"24_CR6","doi-asserted-by":"publisher","first-page":"1085","DOI":"10.1093\/comjnl\/bxu017","volume":"58","author":"E Giacomo Di","year":"2015","unstructured":"Di Giacomo, E., Didimo, W., Grilli, L., Liotta, G., Romeo, S.A.: Heuristics for the maximum 2-layer RAC subgraph problem. Comput. J. 58(5), 1085\u20131098 (2015)","journal-title":"Comput. J."},{"issue":"39","key":"24_CR7","doi-asserted-by":"publisher","first-page":"5156","DOI":"10.1016\/j.tcs.2011.05.025","volume":"412","author":"W Didimo","year":"2011","unstructured":"Didimo, W., Eades, P., Liotta, G.: Drawing graphs with right angle crossings. Theor. Comput. Sci. 412(39), 5156\u20135166 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR8","first-page":"167","volume-title":"Thirty Essays on Geometric Graph Theory","author":"W Didimo","year":"2012","unstructured":"Didimo, W., Liotta, G.: The crossing angle resolution in graph drawing. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp. 167\u2013184. Springer, New York (2012)"},{"key":"24_CR9","unstructured":"Eades, P., McKay, B., Wormald, N.: On an edge crossing problem. In: ACSC 1986, pp. 327\u2013334 (1986)"},{"key":"24_CR10","first-page":"89","volume":"21","author":"P Eades","year":"1986","unstructured":"Eades, P., Kelly, D.: Heuristics for drawing 2-layered networks. Ars Comb. 21, 89\u201398 (1986)","journal-title":"Ars Comb."},{"issue":"2","key":"24_CR11","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0304-3975(94)90179-1","volume":"131","author":"P Eades","year":"1994","unstructured":"Eades, P., Whitesides, S.: Drawing graphs in two layers. Theor. Comput. Sci. 131(2), 361\u2013374 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"24_CR12","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01187020","volume":"11","author":"P Eades","year":"1994","unstructured":"Eades, P., Wormald, N.C.: Edge crossings in drawings of bipartite graphs. Algorithmica 11(4), 379\u2013403 (1994)","journal-title":"Algorithmica"},{"issue":"4","key":"24_CR13","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1016\/j.jvlc.2014.03.001","volume":"25","author":"W Huang","year":"2014","unstructured":"Huang, W., Eades, P., Hong, S.: Larger crossing angles make graphs easier to read. J. Vis. Lang. Comput. 25(4), 452\u2013465 (2014)","journal-title":"J. Vis. Lang. Comput."},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00001","volume":"1","author":"M J\u00fcnger","year":"1997","unstructured":"J\u00fcnger, M., Mutzel, P.: 2-layer straightline crossing minimization: performance of exact and heuristic algorithms. J. Graph Algorithms Appl. 1, 1\u201325 (1997)","journal-title":"J. Graph Algorithms Appl."},{"key":"24_CR15","unstructured":"Kaufmann, M., Ueckerdt, T.: The density of fan-planar graphs. CoRR abs\/1403.6184 (2014). \n                      http:\/\/arxiv.org\/abs\/1403.6184"},{"issue":"4","key":"24_CR16","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1137\/S1052623498334013","volume":"11","author":"P Mutzel","year":"2001","unstructured":"Mutzel, P.: An alternative method to crossing minimization on hierarchical graphs. SIAM J. Optim. 11(4), 1065\u20131080 (2001)","journal-title":"SIAM J. Optim."},{"key":"24_CR17","doi-asserted-by":"publisher","DOI":"10.1142\/4902","volume-title":"Graph Drawing and Applications for Software and Knowledge Engineers","author":"K Sugiyama","year":"2002","unstructured":"Sugiyama, K.: Graph Drawing and Applications for Software and Knowledge Engineers. World Scientific, Singapore (2002)"},{"issue":"2","key":"24_CR18","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K Sugiyama","year":"1981","unstructured":"Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man Cybern. 11(2), 109\u2013125 (1981)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"2","key":"24_CR19","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0377-2217(95)00356-8","volume":"90","author":"V Valls","year":"1996","unstructured":"Valls, V., Mart\u00ed, R., Lino, P.: A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs. Eur. J. Oper. Res. 90(2), 303\u2013319 (1996)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27261-0_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T20:12:06Z","timestamp":1569269526000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27261-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319272603","9783319272610"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27261-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"27 November 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}