{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T08:02:24Z","timestamp":1648540944188},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,1,22]],"date-time":"2009-01-22T00:00:00Z","timestamp":1232582400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2010,10]]},"DOI":"10.1007\/s00453-009-9277-4","type":"journal-article","created":{"date-parts":[[2009,1,21]],"date-time":"2009-01-21T19:03:07Z","timestamp":1232564587000},"page":"478-497","source":"Crossref","is-referenced-by-count":1,"title":["Approximation Algorithms for Minimizing Edge Crossings in Radial Drawings"],"prefix":"10.1007","volume":"58","author":[{"given":"Seok-Hee","family":"Hong","sequence":"first","affiliation":[]},{"given":"Hiroshi","family":"Nagamochi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,1,22]]},"reference":[{"key":"9277_CR1","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1109\/TVCG.2007.1000","volume":"13","author":"C. Bachmaier","year":"2007","unstructured":"Bachmaier, C.: A radial adaptation of the Sugiyama framework for visualizing hierarchical information. IEEE Trans. Vis. Comput. Graph. 13, 583\u2013594 (2007)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"9277_CR2","unstructured":"Buchner, H.: Displaying centralities using orbital layout. Diploma Thesis, University of Passau, Germany (2006)"},{"key":"9277_CR3","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, Englewood Cliffs (1999)"},{"key":"9277_CR4","doi-asserted-by":"crossref","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 40, 15\u201331 (2004)","journal-title":"Algorithmica"},{"key":"9277_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/978-3-540-24595-7_31","volume-title":"Proc. of Graph Drawing 2003","author":"V. Dujmovi\u0107","year":"2004","unstructured":"Dujmovi\u0107, V., Fernau, H., Kaufmann, M.: Fixed parameter algorithms for one-sided crossing minimization revisited. In: Proc. of Graph Drawing 2003. Lecture Notes in Computer Science, vol. 2912, pp. 332\u2013344. Springer, New York (2004)"},{"issue":"2","key":"9277_CR6","doi-asserted-by":"crossref","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."},{"key":"9277_CR7","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF01187020","volume":"11","author":"P. Eades","year":"1994","unstructured":"Eades, P., Wormald, N.C.: Edge crossing in drawing bipartite graphs. Algorithmica 11, 379\u2013403 (1994)","journal-title":"Algorithmica"},{"issue":"3","key":"9277_CR8","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M.R. Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Algebr. Discrete Methods 4(3), 312\u2013316 (1983)","journal-title":"SIAM J. Algebr. Discrete Methods"},{"issue":"1","key":"9277_CR9","doi-asserted-by":"crossref","first-page":"97","DOI":"10.7155\/jgaa.00161","volume":"12","author":"E. Di Giacomo","year":"2008","unstructured":"Di Giacomo, E., Grilli, L., Liotta, G.: Drawing bipartite graphs on two parallel convex curves. J.\u00a0Graph Algorithms Appl. 12(1), 97\u2013112 (2008)","journal-title":"J.\u00a0Graph Algorithms Appl."},{"key":"9277_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00001","volume":"1","author":"M. J\u00fcnger","year":"1997","unstructured":"J\u00fcnger, M., Mutzel, P.: 2-layer straight line crossing minimization: performance of exact and heuristic algorithms. J. Graph Algorithms Appl. 1, 1\u201325 (1997)","journal-title":"J. Graph Algorithms Appl."},{"key":"9277_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Drawing Graphs: Methods and Models","year":"2001","unstructured":"Kaufmann, M., Wagner, D. (ed.): Drawing Graphs: Methods and Models. Lecture Notes in Computer Science, vol.\u00a02025. Springer, New York (2001)"},{"key":"9277_CR12","series-title":"Lecture Notes in Computer Science","first-page":"69","volume-title":"Proc. of ISAAC 1998","author":"P. Mutzel","year":"1998","unstructured":"Mutzel, P., Weiskircher, R.: Two-layer planarization in graph drawing. In: Proc. of ISAAC 1998. Lecture Notes in Computer Science, vol. 1533, pp. 69\u201379. Springer, New York (1998)"},{"key":"9277_CR13","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/s00454-005-1168-0","volume":"33","author":"H. Nagamochi","year":"2005","unstructured":"Nagamochi, H.: An improved bound on the one-sided minimum crossing number in two-layered drawings. Discrete Comput. Geom. 33, 569\u2013591 (2005)","journal-title":"Discrete Comput. Geom."},{"key":"9277_CR14","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/j.ipl.2004.05.001","volume":"91","author":"H. Nagamochi","year":"2004","unstructured":"Nagamochi, H., Yamada, N.: Counting edge crossings in a 2-layered drawing. Inf. Process. Lett. 91, 221\u2013225 (2004)","journal-title":"Inf. Process. Lett."},{"key":"9277_CR15","doi-asserted-by":"crossref","DOI":"10.1142\/5648","volume-title":"Planar Graph Drawing","author":"T. Nishizeki","year":"2004","unstructured":"Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. World Scientific, Singapore (2004)"},{"key":"9277_CR16","series-title":"Lecture Notes in Computer Science","first-page":"248","volume-title":"Proc. of the 5th International Symposium on Graph Drawing (GD\u201997)","author":"H.C. Purchase","year":"2007","unstructured":"Purchase, H.C.: Which aesthetic has the greatest effect on human understanding? In: Proc. of the 5th International Symposium on Graph Drawing (GD\u201997). Lecture Notes in Computer Science, vol. 1353, pp. 248\u2013261. Springer, New York (2007)"},{"key":"9277_CR17","doi-asserted-by":"crossref","first-page":"1773","DOI":"10.1137\/S0097539797331671","volume":"30","author":"F. Shahrokhi","year":"2001","unstructured":"Shahrokhi, F., Sykora, O., Sz\u00e9kly, L.A., Vrto, I.: On bipartite drawings and the linear arrangement problem. SIAM J. Comput. 30, 1773\u20131789 (2001)","journal-title":"SIAM J. Comput."},{"key":"9277_CR18","volume-title":"Graph Drawing and Applications","author":"K. Sugiyama","year":"2002","unstructured":"Sugiyama, K.: Graph Drawing and Applications. World Scientific, Singapore (2002)"},{"key":"9277_CR19","doi-asserted-by":"crossref","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, 109\u2013125 (1981)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"9277_CR20","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis: Methods and Applications","author":"S. Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge (1994)"},{"key":"9277_CR21","series-title":"Lecture Notes in Computer Science","first-page":"301","volume-title":"Proc. of COCOA 2007","author":"L. Zheng","year":"2007","unstructured":"Zheng, L., Buchheim, C.: A new exact algorithm for the two-sided crossing minimization problem. In: Proc. of COCOA 2007. Lecture Notes in Computer Science, vol. 4616, pp. 301\u2013310. Springer, New York (2007)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9277-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-009-9277-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9277-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:03Z","timestamp":1559137503000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-009-9277-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,22]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["9277"],"URL":"https:\/\/doi.org\/10.1007\/s00453-009-9277-4","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1,22]]}}}