{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:24:56Z","timestamp":1725665096570},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642280757"},{"type":"electronic","value":"9783642280764"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-28076-4_21","type":"book-chapter","created":{"date-parts":[[2012,2,27]],"date-time":"2012-02-27T08:53:14Z","timestamp":1330332794000},"page":"211-216","source":"Crossref","is-referenced-by-count":1,"title":["Heuristics for the Maximum 2-layer RAC Subgraph Problem"],"prefix":"10.1007","author":[{"given":"Emilio","family":"Di Giacomo","sequence":"first","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Grilli","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Salvatore A.","family":"Romeo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.7155\/jgaa.00217","volume":"15","author":"P. Angelini","year":"2011","unstructured":"Angelini, P., Cittadini, L., Di Battista, G., Didimo, W., Frati, F., Kaufmann, M., Symvonis, A.: On the perspectives opened by right angle crossing drawings. JGAA\u00a015(1), 53\u201378 (2011)","journal-title":"JGAA"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-16926-7_14","volume-title":"Graph Theoretic Concepts in Computer Science","author":"K. Arikushi","year":"2010","unstructured":"Arikushi, K., Fulek, R., Keszegh, B., Mori\u0107, F., T\u00f3th, C.D.: Graphs that Admit Right Angle Crossing Drawings. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol.\u00a06410, pp. 135\u2013146. Springer, Heidelberg (2010)"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-642-25011-8_13","volume-title":"Combinatorial Algorithms","author":"E. Di Giacomo","year":"2011","unstructured":"Di Giacomo, E., Didimo, W., Eades, P., Liotta, G.: 2-Layer Right Angle Crossing Drawings. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2011. LNCS, vol.\u00a07056, pp. 156\u2013169. Springer, Heidelberg (2011)"},{"issue":"39","key":"21_CR4","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. Theoretical Computer Science\u00a0412(39), 5156\u20135166 (2011)","journal-title":"Theoretical Computer Science"},{"key":"21_CR5","unstructured":"Dujmovi\u0107, V., Gudmundsson, J., Morin, P., Wolle, T.: Notes on large angle crossing graphs. In: Proc. CATS 2010, pp. 19\u201324. ACS (2010)"},{"key":"21_CR6","unstructured":"Eades, P., McKay, B., Wormald, N.: On an edge crossing problem. In: Proc. of 9th Australian Computer Science Conference, pp. 327\u2013334 (1986)"},{"key":"21_CR7","first-page":"89","volume":"21","author":"P. Eades","year":"1986","unstructured":"Eades, P., Kelly, D.: Heuristics for drawing 2-layered networks. Ars Combin.\u00a021, 89\u201398 (1986)","journal-title":"Ars Combin."},{"issue":"2","key":"21_CR8","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.H.: Drawing graphs in two layers. Theoretical Computer Science\u00a0131(2), 361\u2013374 (1994)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"21_CR9","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\u00a011(4), 379\u2013403 (1994)","journal-title":"Algorithmica"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"J\u00fcnger, M., Mutzel, P.: 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms. J. Graph Algorithms Appl.\u00a01 (1997)","DOI":"10.7155\/jgaa.00001"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-642-18469-7_34","volume-title":"Graph Drawing","author":"M. Kreveld van","year":"2011","unstructured":"van Kreveld, M.: The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol.\u00a06502, pp. 371\u2013376. Springer, Heidelberg (2011)"},{"issue":"4","key":"21_CR12","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. on Optimization\u00a011(4), 1065\u20131080 (2001)","journal-title":"SIAM J. on Optimization"},{"issue":"2","key":"21_CR13","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. on Syst., Man and Cyber.\u00a011(2), 109\u2013125 (1981)","journal-title":"IEEE Trans. on Syst., Man and Cyber."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28076-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T02:40:44Z","timestamp":1556419244000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28076-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642280757","9783642280764"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28076-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}