{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:36Z","timestamp":1750307016574,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,17]],"date-time":"2012-06-17T00:00:00Z","timestamp":1339891200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,6,17]]},"DOI":"10.1145\/2261250.2261254","type":"proceedings-article","created":{"date-parts":[[2012,6,20]],"date-time":"2012-06-20T13:33:01Z","timestamp":1340199181000},"page":"21-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Computing cartograms with optimal complexity"],"prefix":"10.1145","author":[{"given":"Md. Jawaherul","family":"Alam","sequence":"first","affiliation":[{"name":"University of Arizona, Tucson, AZ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Therese","family":"Biedl","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Felsner","sequence":"additional","affiliation":[{"name":"Technische Universitat Berlin, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[{"name":"Eberhard Karls Universitat Tubingen, Tubingen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen G.","family":"Kobourov","sequence":"additional","affiliation":[{"name":"University of Arizona, Tucson, AZ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torsten","family":"Ueckerdt","sequence":"additional","affiliation":[{"name":"Technische Universitat Berlin, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,6,17]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1007\/978-3-642-25591-5_30"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1007\/978-3-642-25878-7_4"},{"key":"e_1_3_2_1_3_1","first-page":"117","volume-title":"CCCG","author":"Biedl T. C.","year":"2005","unstructured":"T. C. Biedl and B. Genc . Complexity of octagonal and rectangular cartograms . In CCCG , pp. 117 -- 120 , 2005 . T. C. Biedl and B. Genc. Complexity of octagonal and rectangular cartograms. In CCCG, pp. 117--120, 2005."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.5555\/2033190.2033199"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/1328911.1328919"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1049\/ip-g-2.1992.0016"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/274535.274553"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1016\/0020-0190(95)00020-D"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1016\/j.disc.2007.12.087"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1142\/S0218195910003268"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1017\/S0963548300001139"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1007\/BF02122694"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1007\/s00453-011-9525-2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/1542362.1542411"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1137\/S0097539796308874"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.5555\/1038262.1038779"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.5555\/288216.288250"},{"key":"e_1_3_2_1_18_1","volume-title":"Commun. and Comp. Sci., E81-A:857--865","author":"Izumi T.","year":"1998","unstructured":"T. Izumi , A. Takahashi , and Y. Kajitani . Air-pressure model and fast algorithms for zero-wasted-area layout of general floorplan. IEICE Trans. Fundam. Electron ., Commun. and Comp. Sci., E81-A:857--865 , 1998 . T. Izumi, A. Takahashi, and Y. Kajitani. Air-pressure model and fast algorithms for zero-wasted-area layout of general floorplan. IEICE Trans. Fundam. Electron., Commun. and Comp. Sci., E81-A:857--865, 1998."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.5555\/1767854.1767909"},{"key":"e_1_3_2_1_20_1","first-page":"141","article-title":"Berichte \u00fcber die Verhandlungen der S\u00e4chsischen Akademie der Wissenschaften zu Leipzig","volume":"88","author":"Koebe P.","year":"1936","unstructured":"P. Koebe . Kontaktprobleme der konformen Abbildung . Berichte \u00fcber die Verhandlungen der S\u00e4chsischen Akademie der Wissenschaften zu Leipzig . Math.-Phys. Klasse , 88 : 141 -- 164 , 1936 . P. Koebe. Kontaktprobleme der konformen Abbildung. Berichte \u00fcber die Verhandlungen der S\u00e4chsischen Akademie der Wissenschaften zu Leipzig. Math.-Phys. Klasse, 88:141--164, 1936.","journal-title":"Math.-Phys. Klasse"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1002\/net.3230150202"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.5555\/800033.800874"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1016\/S0196-6774(03)00057-9"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1080\/03052150214016"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1109\/81.536741"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.2307\/208794"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1068\/b140163"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1007\/BF01415168"},{"key":"e_1_3_2_1_29_1","first-page":"138","volume-title":"SODA","author":"Schnyder W.","year":"1990","unstructured":"W. Schnyder . Embedding planar graphs on the grid . In SODA , pp. 138 -- 148 , 1990 . W. Schnyder. Embedding planar graphs on the grid. In SODA, pp. 138--148, 1990."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1111\/j.1467-8306.2004.09401004.x"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1112\/jlms\/s1-28.3.336"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_33_1","DOI":"10.1016\/j.comgeo.2006.06.002"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.1109\/ISCAS.1995.521477"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_35_1","DOI":"10.1109\/31.1739"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_36_1","DOI":"10.1137\/0222035"}],"event":{"sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"SoCG '12","name":"SoCG '12: Symposium on Computational Geometry 2012","location":"Chapel Hill North Carolina USA"},"container-title":["Proceedings of the twenty-eighth annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2261250.2261254","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2261250.2261254","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:49:08Z","timestamp":1750236548000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2261250.2261254"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,17]]},"references-count":35,"alternative-id":["10.1145\/2261250.2261254","10.1145\/2261250"],"URL":"https:\/\/doi.org\/10.1145\/2261250.2261254","relation":{},"subject":[],"published":{"date-parts":[[2012,6,17]]},"assertion":[{"value":"2012-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}