{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:54:08Z","timestamp":1725558848231},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245285"},{"type":"electronic","value":"9783540318439"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31843-9_26","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T20:54:14Z","timestamp":1278363254000},"page":"251-261","source":"Crossref","is-referenced-by-count":0,"title":["Computing Radial Drawings on the Minimum Number of Circles"],"prefix":"10.1007","author":[{"given":"Emilio","family":"Di Giacomo","sequence":"first","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Henk","family":"Meijer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-540-24595-7_37","volume-title":"Graph Drawing","author":"C. Bachmaier","year":"2004","unstructured":"Bachmaier, C., Brandenburg, F., Forster, M.: Radial level planarity testing and embedding in linear time. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 393\u2013405. Springer, Heidelberg (2004)"},{"key":"26_CR2","unstructured":"Bachmaier, C., Brandenburg, F., Forster, M.: Track planarity testing and embedding. In: Proc. SOFSEM 2004, vol.\u00a02, pp. 3\u201317 (2004)"},{"issue":"1","key":"26_CR3","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF01840379","volume":"5","author":"D. Bienstock","year":"1990","unstructured":"Bienstock, D., Monma, C.L.: On the complexity of embedding planar graphs to minimize certain distance measures. Algorithmica\u00a05(1), 93\u2013109 (1990)","journal-title":"Algorithmica"},{"volume-title":"Handbook of Graphs and Networks: From the Genome to the Internet","year":"2003","key":"26_CR4","unstructured":"Bornholdt, S., Schuster, H. (eds.): Handbook of Graphs and Networks: From the Genome to the Internet. Wiley-VCH, Chichester (2003)"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-36151-0_4","volume-title":"Graph Drawing","author":"S. Cornelsen","year":"2002","unstructured":"Cornelsen, S., Schank, T., Wagner, D.: Drawing graphs on two and three lines. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 31\u201341. Springer, Heidelberg (2002)"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-540-24595-7_39","volume-title":"Graph Drawing","author":"E. Giacomo Di","year":"2004","unstructured":"Di Giacomo, E., Didimo, W.: Straight-line drawings of 2-outerplanar graphs on two curves. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 419\u2013424. Springer, Heidelberg (2004)"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Wismath, S.K.: Curve-constrained drawings of planar graphs. Comp. Geometry: Theory and Appl. (to appear)","DOI":"10.1016\/j.comgeo.2004.04.002"},{"key":"26_CR8","volume-title":"Atlas of Cyberspace","author":"M. Dodge","year":"2001","unstructured":"Dodge, M., Kitchin, R.: Atlas of Cyberspace. Addison-Wesley, Reading (2001)"},{"key":"26_CR9","volume-title":"Evolution of Networks, From Biological Nets to the Internet and WWW","author":"S.N. Dorogstev","year":"2003","unstructured":"Dorogstev, S.N., Mendes, J.F.F.: Evolution of Networks, From Biological Nets to the Internet and WWW. Oxford University Press, Oxford (2003)"},{"key":"26_CR10","volume-title":"Graph Theory","author":"F. Harary","year":"1972","unstructured":"Harary, F.: Graph Theory. Addison-Wesley, Reading (1972)"},{"key":"26_CR11","doi-asserted-by":"crossref","first-page":"103","DOI":"10.5486\/PMD.1966.13.1-4.15","volume":"13","author":"F. Harary","year":"1966","unstructured":"Harary, F., Prins, G.: The block-cutpoint-tree of a graph. Publ. Math Debrecen\u00a013, 103\u2013107 (1966)","journal-title":"Publ. Math Debrecen"},{"volume-title":"Graph Drawing Software","year":"2003","key":"26_CR12","unstructured":"J\u00fcnger, M., Mutzel, P. (eds.): Graph Drawing Software. Springer, Heidelberg (2003)"},{"key":"26_CR13","doi-asserted-by":"publisher","DOI":"10.1142\/9789812777898","volume-title":"Graph Drawing and Applications for Software and Knowldege Engineers","author":"K. Sugiyama","year":"2002","unstructured":"Sugiyama, K.: Graph Drawing and Applications for Software and Knowldege Engineers. World Scientific, Singapore (2002)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31843-9_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T22:46:52Z","timestamp":1685659612000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31843-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245285","9783540318439"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31843-9_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}