{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:04:07Z","timestamp":1725807847766},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319125671"},{"type":"electronic","value":"9783319125688"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45803-7_11","type":"book-chapter","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T06:12:53Z","timestamp":1417414373000},"page":"125-136","source":"Crossref","is-referenced-by-count":5,"title":["Balanced Circle Packings for Planar Graphs"],"prefix":"10.1007","author":[{"given":"Md. Jawaherul","family":"Alam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Eppstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael T.","family":"Goodrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen G.","family":"Kobourov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey","family":"Pupyrev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Alam, J., Eppstein, D., Goodrich, M.T., Kobourov, S.G., Pupyrev, S.: Balanced circle packings for planar graphs. Arxiv report arxiv.org\/abs\/1408.4902 (2014)","DOI":"10.1007\/978-3-662-45803-7_11"},{"key":"11_CR2","series-title":"LNCS","first-page":"149","volume-title":"GD 2014","author":"M.J. Bannister","year":"2014","unstructured":"Bannister, M.J., Devanny, W.E., Eppstein, D., Goodrich, M.T.: The Galois complexity of graph drawing: Why numerical solutions are ubiquitous for force-directed, spectral, and circle packing drawings. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol.\u00a08871, pp. 149\u2013161. Springer, Heidelberg (2014)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/3-540-44634-6_3","volume-title":"Algorithms and Data Structures","author":"M. Bern","year":"2001","unstructured":"Bern, M., Eppstein, D.: Optimal M\u00f6bius transformations for information visualization and meshing. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol.\u00a02125, pp. 14\u201325. Springer, Heidelberg (2001)"},{"issue":"1-2","key":"11_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0925-7721(97)00014-X","volume":"9","author":"H. Breu","year":"1998","unstructured":"Breu, H., Kirkpatrick, D.G.: Unit disk graph recognition is NP-hard. Comput. Geom. Th. Appl.\u00a09(1-2), 3\u201324 (1998)","journal-title":"Comput. Geom. Th. Appl."},{"issue":"2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1137\/0406017","volume":"6","author":"G. Brightwell","year":"1993","unstructured":"Brightwell, G., Scheinerman, E.: Representations of planar graphs. SIAM J. Discrete Math.\u00a06(2), 214\u2013229 (1993)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1006\/jctb.2002.2113","volume":"86","author":"G. Chen","year":"2002","unstructured":"Chen, G., Yu, X.: Long cycles in 3-connected graphs. J. Comb. Theory B\u00a086(1), 80\u201399 (2002)","journal-title":"J. Comb. Theory B"},{"issue":"3","key":"11_CR7","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0925-7721(02)00099-8","volume":"25","author":"C.R. Collins","year":"2003","unstructured":"Collins, C.R., Stephenson, K.: A circle packing algorithm. Comput. Geom. Th. Appl.\u00a025(3), 233\u2013256 (2003)","journal-title":"Comput. Geom. Th. Appl."},{"key":"11_CR8","first-page":"147","volume":"2","author":"D. Dolev","year":"1984","unstructured":"Dolev, D., Leighton, T., Trickey, H.: Planar embedding of planar graphs. Advances in Computing Research\u00a02, 147\u2013161 (1984)","journal-title":"Advances in Computing Research"},{"issue":"3","key":"11_CR9","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1007\/s00453-011-9525-2","volume":"63","author":"C.A. Duncan","year":"2012","unstructured":"Duncan, C.A., Gansner, E.R., Hu, Y.F., Kaufmann, M., Kobourov, S.G.: Optimal polygonal representation of planar graphs. Algorithmica\u00a063(3), 672\u2013691 (2012)","journal-title":"Algorithmica"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-36763-2_12","volume-title":"Graph Drawing","author":"D. Eppstein","year":"2013","unstructured":"Eppstein, D.: Planar Lombardi drawings for subcubic graphs. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol.\u00a07704, pp. 126\u2013137. Springer, Heidelberg (2013)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-319-03841-4_31","volume-title":"Graph Drawing","author":"D. Eppstein","year":"2013","unstructured":"Eppstein, D., Holten, D., L\u00f6ffler, M., N\u00f6llenburg, M., Speckmann, B., Verbeek, K.: Strict confluent drawing. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol.\u00a08242, pp. 352\u2013363. Springer, Heidelberg (2013)"},{"issue":"2","key":"11_CR12","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1017\/S0963548300001139","volume":"3","author":"H. Fraysseix de","year":"1994","unstructured":"de Fraysseix, H., de Mendez, P.O., Rosenstiehl, P.: On triangle contact graphs. Combinatorics, Probability & Computing\u00a03(2), 233\u2013246 (1994)","journal-title":"Combinatorics, Probability & Computing"},{"issue":"4","key":"11_CR13","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1002\/j.1538-7305.1959.tb01583.x","volume":"38","author":"E.N. Gilbert","year":"1959","unstructured":"Gilbert, E.N., Moore, E.F.: Variable-length binary encodings. Bell System Technical Journal\u00a038(4), 933\u2013967 (1959)","journal-title":"Bell System Technical Journal"},{"issue":"1","key":"11_CR14","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s00454-012-9400-1","volume":"48","author":"D. Gon\u00e7alves","year":"2012","unstructured":"Gon\u00e7alves, D., L\u00e9v\u00eaque, B., Pinlou, A.: Triangle contact representations and duality. Discrete Comput. Geom.\u00a048(1), 239\u2013254 (2012)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"11_CR15","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1006\/jctb.1998.1846","volume":"74","author":"P. Hlin\u011bn\u00fd","year":"1998","unstructured":"Hlin\u011bn\u00fd, P.: Classes and recognition of curve contact graphs. J. Comb. Theory B\u00a074(1), 87\u2013103 (1998)","journal-title":"J. Comb. Theory B"},{"key":"11_CR16","first-page":"141","volume":"88","author":"P. Koebe","year":"1936","unstructured":"Koebe, P.: Kontaktprobleme der konformen Abbildung. Ber. S\u00e4chs. Akad. Wiss. Leipzig, Math.-Phys. Kl.\u00a088, 141\u2013164 (1936)","journal-title":"Ber. S\u00e4chs. Akad. Wiss. Leipzig, Math.-Phys. Kl."},{"issue":"4","key":"11_CR17","doi-asserted-by":"publisher","first-page":"2299","DOI":"10.2140\/gt.2011.15.2299","volume":"15","author":"F. Luo","year":"2011","unstructured":"Luo, F.: Rigidity of polyhedral surfaces, III. Geometry & Topology\u00a015(4), 2299\u20132319 (2011)","journal-title":"Geometry & Topology"},{"issue":"2","key":"11_CR18","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/S0895480193242931","volume":"7","author":"S.M. Malitz","year":"1994","unstructured":"Malitz, S.M., Papakostas, A.: On the angular resolution of planar graphs. SIAM J. Discrete Math.\u00a07(2), 172\u2013183 (1994)","journal-title":"SIAM J. Discrete Math."},{"issue":"1-3","key":"11_CR19","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0012-365X(93)90340-Y","volume":"117","author":"B. Mohar","year":"1993","unstructured":"Mohar, B.: A polynomial time circle packing algorithm. Discrete Math.\u00a0117(1-3), 257\u2013263 (1993)","journal-title":"Discrete Math."},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Ne\u0161et\u0159il, J., Ossona de Mendez, P.: Sparsity: Graphs, Structures, and Algorithms. Springer (2012)","DOI":"10.1007\/978-3-642-27875-4"},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/0202005","volume":"2","author":"J. Nievergelt","year":"1973","unstructured":"Nievergelt, J., Reingold, E.M.: Binary search trees of bounded balance. SIAM J. Comput.\u00a02, 33\u201343 (1973)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45803-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,17]],"date-time":"2019-08-17T20:04:41Z","timestamp":1566072281000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45803-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319125671","9783319125688"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45803-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}