{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:35:20Z","timestamp":1742913320124,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642250101"},{"type":"electronic","value":"9783642250118"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-25011-8_13","type":"book-chapter","created":{"date-parts":[[2011,11,8]],"date-time":"2011-11-08T20:27:34Z","timestamp":1320784054000},"page":"156-169","source":"Crossref","is-referenced-by-count":4,"title":["2-Layer Right Angle Crossing Drawings"],"prefix":"10.1007","author":[{"given":"Emilio","family":"Di Giacomo","sequence":"first","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Eades","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall (1993)"},{"issue":"1","key":"13_CR2","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. Journal of Graph Algorithms and Applications\u00a015(1), 53\u201378 (2011)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-642-18381-2_6","volume-title":"SOFSEM 2011: Theory and Practice of Computer Science","author":"E.N. Argyriou","year":"2011","unstructured":"Argyriou, E.N., Bekos, M.A., Symvonis, A.: The Straight-Line RAC Drawing Problem is NP-Hard. In: \u010cern\u00e1, I., Gyim\u00f3thy, T., Hromkovi\u010d, J., Jefferey, K., Kr\u00e1lovi\u0107, R., Vukoli\u0107, M., Wolf, S. (eds.) SOFSEM 2011. LNCS, vol.\u00a06543, pp. 74\u201385. Springer, Heidelberg (2011)"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-642-03367-4_19","volume-title":"Algorithms and Data Structures","author":"W. Didimo","year":"2009","unstructured":"Didimo, W., Eades, P., Liotta, G.: Drawing Graphs with Right Angle Crossings. In: Dehne, F., Gavrilova, M., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol.\u00a05664, pp. 206\u2013217. Springer, Heidelberg (2009)"},{"issue":"16","key":"13_CR5","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1016\/j.ipl.2010.05.023","volume":"110","author":"W. Didimo","year":"2010","unstructured":"Didimo, W., Eades, P., Liotta, G.: A characterization of complete bipartite RAC graphs. Inf. Process. Lett.\u00a0110(16), 687\u2013691 (2010)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"13_CR6","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s00453-005-1181-y","volume":"45","author":"V. Dujmovi\u0107","year":"2006","unstructured":"Dujmovi\u0107, V., Fellows, M.R., Hallett, M.T., Kitching, M., Liotta, G., McCartin, C., Nishimura, N., Ragde, P., Rosamond, F.A., Suderman, M., Whitesides, S., Wood, D.R.: A fixed-parameter approach to 2-layer planarization. Algorithmica\u00a045(2), 159\u2013182 (2006)","journal-title":"Algorithmica"},{"key":"13_CR7","unstructured":"Dujmovi\u0107, V., Gudmundsson, J., Morin, P., Wolle, T.: Notes on large angle crossing graphs. In: Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory, CATS 2010, vol.\u00a0109, pp. 19\u201324. Australian Computer Society, Inc. (2010)"},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s00453-004-1093-2","volume":"40","author":"V. Dujmovi\u0107","year":"2004","unstructured":"Dujmovi\u0107, V., Whitesides, S.: An efficient fixed parameter tractable algorithm for 1-sided crossing minimization. Algorithmica\u00a040(1), 15\u201331 (2004)","journal-title":"Algorithmica"},{"key":"13_CR9","first-page":"89","volume":"21","author":"P. Eades","year":"1986","unstructured":"Eades, P., Kelly, D.: Heuristics for drawing 2-layered networks. Ars Comb.\u00a021, 89\u201398 (1986)","journal-title":"Ars Comb."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Eades, P., Liotta, G.: Right angle crossing graphs and 1-planarity. In: EuroCG (2011)","DOI":"10.1007\/978-3-642-25878-7_15"},{"key":"13_CR11","unstructured":"Eades, P., McKay, B., Wormald, N.: On an edge crossing problem. In: Proc. of 9th Australian Computer Science Conference, pp. 327\u2013334 (1986)"},{"issue":"2","key":"13_CR12","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. Theoretical Computer Science\u00a0131(2), 361\u2013374 (1994)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"13_CR13","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":"13_CR14","first-page":"203","volume":"1","author":"F. Harary","year":"1972","unstructured":"Harary, F., Schwenk, A.: A new crossing number for bipartite graphs. Utilitas Mathematica\u00a01, 203\u2013209 (1972)","journal-title":"Utilitas Mathematica"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Huang, W.: Using eye tracking to investigate graph layout effects. In: APVIS, pp. 97\u2013100 (2007)","DOI":"10.1109\/APVIS.2007.329282"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Huang, W., Hong, S.-H., Eades, P.: Effects of crossing angles. In: PacificVis, pp. 41\u201346 (2008)","DOI":"10.1109\/PACIFICVIS.2008.4475457"},{"key":"13_CR17","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"},{"issue":"4","key":"13_CR18","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"},{"key":"13_CR19","unstructured":"Tomii, N., Kambayashi, Y., Yajima, S.: On planarization algorithms of 2-level graphs. Technical Report EC77-38, Inst. of Elect. and Comm. Eng. Japan (1977)"},{"issue":"2","key":"13_CR20","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. Europ. J. of Oper. Res.\u00a090(2), 303\u2013319 (1996)","journal-title":"Europ. J. of Oper. Res."},{"key":"13_CR21","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)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25011-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T04:00:31Z","timestamp":1560916831000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25011-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642250101","9783642250118"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25011-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}