{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:30:08Z","timestamp":1725507008637},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540787723"},{"type":"electronic","value":"9783540787730"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78773-0_40","type":"book-chapter","created":{"date-parts":[[2008,4,3]],"date-time":"2008-04-03T08:38:35Z","timestamp":1207211915000},"page":"461-472","source":"Crossref","is-referenced-by-count":1,"title":["Approximating Crossing Minimization in Radial Layouts"],"prefix":"10.1007","author":[{"given":"Seok-Hee","family":"Hong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Nagamochi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"publisher","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.\u00a013, 583\u2013594 (2007)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"40_CR2","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 crossing in drawing bipartite graphs. Algorithmica\u00a011, 379\u2013403 (1994)","journal-title":"Algorithmica"},{"key":"40_CR3","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 and Applications\u00a01, 1\u201325 (1997)","journal-title":"J. Graph Algorithms and Applications"},{"key":"40_CR4","volume-title":"Complexity Issues in VLSI","author":"F.T. Leighton","year":"1983","unstructured":"Leighton, F.T.: Complexity Issues in VLSI. MIT Press, Cambridge (1983)"},{"key":"40_CR5","doi-asserted-by":"publisher","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 and Computational Geometry\u00a033, 569\u2013591 (2005)","journal-title":"Discrete and Computational Geometry"},{"key":"40_CR6","volume-title":"An Introduction to VLSI Physical Design","author":"M. Sarrafzadeh","year":"1996","unstructured":"Sarrafzadeh, M., Wong, C.K.: An Introduction to VLSI Physical Design. McGraw-Hill, New York (1996)"},{"key":"40_CR7","doi-asserted-by":"publisher","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 Journal on Computing\u00a030, 1773\u20131789 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"40_CR8","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 Transactions on Systems, Man, and Cybernetics\u00a011, 109\u2013125 (1981)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"40_CR9","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)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2008: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78773-0_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:21:40Z","timestamp":1619522500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78773-0_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540787723","9783540787730"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78773-0_40","relation":{},"subject":[]}}