{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T03:56:24Z","timestamp":1769572584368,"version":"3.49.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030358013","type":"print"},{"value":"9783030358020","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-35802-0_4","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T23:02:50Z","timestamp":1574895770000},"page":"46-60","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Computing Stable Demers Cartograms"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5161-3841","authenticated-orcid":false,"given":"Soeren","family":"Nickel","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3309-638X","authenticated-orcid":false,"given":"Max","family":"Sondag","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4978-3400","authenticated-orcid":false,"given":"Wouter","family":"Meulemans","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4681-5550","authenticated-orcid":false,"given":"Markus","family":"Chimani","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0477-2724","authenticated-orcid":false,"given":"Stephen","family":"Kobourov","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3485-8585","authenticated-orcid":false,"given":"Jaakko","family":"Peltonen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0454-3937","authenticated-orcid":false,"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Alam, M.J., Biedl, T., Felsner, S., Kaufmann, M., Kobourov, S.G., Ueckerdt, T.: Computing cartograms with optimal complexity. Discrete Comput. Geom. 50(3), 784\u2013810 (2013). https:\/\/doi.org\/10.1007\/s00454-013-9521-1","DOI":"10.1007\/s00454-013-9521-1"},{"issue":"3","key":"4_CR2","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1111\/cgf.12647","volume":"34","author":"MJ Alam","year":"2015","unstructured":"Alam, M.J., Kobourov, S.G., Veeramoni, S.: Quantitative measures for cartogram generation techniques. Comput. Graph. Forum 34(3), 351\u2013360 (2015). https:\/\/doi.org\/10.1111\/cgf.12647","journal-title":"Comput. Graph. Forum"},{"key":"4_CR3","unstructured":"Bortins, I., Demers, S., Clarke, K.: Cartogram types (2002). http:\/\/www.ncgia.ucsb.edu\/projects\/Cartogram_Central\/types.html"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Bowen, C., Durocher, S., L\u00f6ffler, M., Rounds, A., Schulz, A., T\u00f3th, C.D.: Realization of simply connected polygonal linkages and recognition of unit disk contact trees. In: Di Giacomo, E., Lubiw, A. (eds.) Graph Drawing and Network Visualization (GD). LNCS, vol. 9411, pp. 447\u2013459. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-319-27261-0_37","DOI":"10.1007\/978-3-319-27261-0_37"},{"issue":"1\u20132","key":"4_CR5","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. 9(1\u20132), 3\u201324 (1998). https:\/\/doi.org\/10.1016\/S0925-7721(97)00014-X","journal-title":"Comput. Geom."},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Buchin, K., Kusters, V., Speckmann, B., Staals, F., Vasilescu, B.: A splitting line model for directional relations. In: Advances in Geographic Information Systems (SIGSPATIAL), pp. 142\u2013151. ACM (2011). https:\/\/doi.org\/10.1145\/2093973.2093994","DOI":"10.1145\/2093973.2093994"},{"key":"4_CR7","doi-asserted-by":"publisher","unstructured":"Buchin, K., Speckmann, B., Verdonschot, S.: Evolution strategies for optimizing rectangular cartograms. In: Xiao, N., Kwan, M.P., Goodchild, M.F., Shekhar, S. (eds.) Geographic Information Science (GIScience). LNCS, vol. 7478, pp. 29\u201342. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33024-7_3","DOI":"10.1007\/978-3-642-33024-7_3"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Di Giacomo, E., Didimo, W., Hong, S.H., Kaufmann, M., Kobourov, S.G., Liotta, G., Misue, K., Symvonis, A., Yen, H.C.: Low ply graph drawing. In: Information, Intelligence, Systems and Applications (IISA). IEEE (2015). https:\/\/doi.org\/10.1109\/IISA.2015.7388020","DOI":"10.1109\/IISA.2015.7388020"},{"key":"4_CR9","unstructured":"Dorling, D.: Area cartograms: their use and creation. No. 59 in Concepts and Techniques in Modern Geography, University of East Anglia: Environmental Publications (1996). http:\/\/www.dannydorling.org\/?page_id=1448"},{"issue":"02","key":"4_CR10","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1142\/S0218195915500077","volume":"25","author":"D Eppstein","year":"2015","unstructured":"Eppstein, D., van Kreveld, M., Speckmann, B., Staals, F.: Improved grid map layout by point set matching. Int. J. Comput. Geom. Appl. 25(02), 101\u2013122 (2015). https:\/\/doi.org\/10.1142\/S0218195915500077","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"4_CR11","doi-asserted-by":"publisher","unstructured":"Eppstein, D., Mumford, E., Speckmann, B., Verbeek, K.: Area-universal rectangular layouts. In: Symposium on Computational Geometry (SoCG), pp. 267\u2013276. ACM (2009). https:\/\/doi.org\/10.1145\/1542362.1542411","DOI":"10.1145\/1542362.1542411"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"7499","DOI":"10.1073\/pnas.0400280101","volume":"101","author":"M Gastner","year":"2004","unstructured":"Gastner, M., Newman, M.: Diffusion-based method for producing density-equalizing maps. Proc. Natl. Acad. Sci. U.S.A. 101, 7499\u20137504 (2004). https:\/\/doi.org\/10.1073\/pnas.0400280101","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"4_CR13","doi-asserted-by":"publisher","unstructured":"Heilmann, R., Keim, D., Panse, C., Sips, M.: RecMap: rectangular map approximations. In: Information Visualization (InfoVis), pp. 33\u201340. IEEE (2004). https:\/\/doi.org\/10.1109\/INFVIS.2004.57","DOI":"10.1109\/INFVIS.2004.57"},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Hlin\u011bn\u00fd, P.: Contact graphs of line segments are NP-complete. Discrete Math. 235(1\u20133), 95\u2013106 (2001). https:\/\/doi.org\/10.1016\/S0012-365X(00)00263-6","DOI":"10.1016\/S0012-365X(00)00263-6"},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"House, D.H., Kocmoud, C.J.: Continuous cartogram construction. In: IEEE Conference on Visualization, pp. 197\u2013204 (1998). https:\/\/doi.org\/10.1109\/VISUAL.1998.745303","DOI":"10.1109\/VISUAL.1998.745303"},{"key":"4_CR16","doi-asserted-by":"publisher","unstructured":"Johnson, T., Acedo, C., Kobourov, S., Nusrat, S.: Analyzing the evolution of the Internet. In: Eurographics Conference on Visualization (EuroVis), pp. 43\u201347. Eurographics Association (2015). https:\/\/doi.org\/10.2312\/eurovisshort.20151123","DOI":"10.2312\/eurovisshort.20151123"},{"issue":"1","key":"4_CR17","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1109\/TVCG.2004.1260761","volume":"10","author":"DA Keim","year":"2004","unstructured":"Keim, D.A., North, S.C., Panse, C.: CartoDraw: a fast algorithm for generating contiguous cartograms. IEEE Trans. Vis. Comput. Graph. 10(1), 95\u2013110 (2004). https:\/\/doi.org\/10.1109\/TVCG.2004.1260761","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Klemz, B., N\u00f6llenburg, M., Prutkin, R.: Recognizing weighted disk contact graphs. In: Di Giacomo, E., Lubiw, A. (eds.) Graph Drawing and Network Visualization (GD). LNCS, vol. 9411, pp. 433\u2013446. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-319-27261-0_36","DOI":"10.1007\/978-3-319-27261-0_36"},{"issue":"3","key":"4_CR19","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.comgeo.2006.06.002","volume":"37","author":"M van Kreveld","year":"2007","unstructured":"van Kreveld, M., Speckmann, B.: On rectangular cartograms. Comput. Geom. 37(3), 175\u2013187 (2007). https:\/\/doi.org\/10.1016\/j.comgeo.2006.06.002","journal-title":"Comput. Geom."},{"issue":"3","key":"4_CR20","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1111\/cgf.13722","volume":"38","author":"W Meulemans","year":"2019","unstructured":"Meulemans, W.: Efficient optimal overlap removal: algorithms and experiments. Comput. Graph. Forum 38(3), 713\u2013723 (2019). https:\/\/doi.org\/10.1111\/cgf.13722","journal-title":"Comput. Graph. Forum"},{"issue":"1","key":"4_CR21","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1109\/TVCG.2016.2598542","volume":"23","author":"W Meulemans","year":"2017","unstructured":"Meulemans, W., Dykes, J., Slingsby, A., Turkay, C., Wood, J.: Small multiples with gaps. IEEE Trans. Vis. Comput. Graph. 23(1), 381\u2013390 (2017). https:\/\/doi.org\/10.1109\/TVCG.2016.2598542","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"2","key":"4_CR22","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/jvlc.1995.1010","volume":"6","author":"K Misue","year":"1995","unstructured":"Misue, K., Eades, P., Lai, W., Sugiyama, K.: Layout adjustment and the mental map. J. Vis. Lang. Comput. 6(2), 183\u2013210 (1995). https:\/\/doi.org\/10.1006\/jvlc.1995.1010","journal-title":"J. Vis. Lang. Comput."},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Munzner, T.: Visualization Analysis and Design. AK Peters\/CRC Press, Natick\/Boca Raton (2014)","DOI":"10.1201\/b17511"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Nickel, S., Sondag, M., Meulemans, W., Chimani, M., Kobourov, S., Peltonen, J., N\u00f6llenburg, M.: Computing stable Demers cartograms. CoRR abs\/1908.07291 (2019). http:\/\/arxiv.org\/abs\/1908.07291","DOI":"10.1007\/978-3-030-35802-0_4"},{"issue":"3","key":"4_CR25","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1111\/cgf.12932","volume":"35","author":"S Nusrat","year":"2016","unstructured":"Nusrat, S., Kobourov, S.: The state of the art in cartograms. Comput. Graph. Forum 35(3), 619\u2013642 (2016). https:\/\/doi.org\/10.1111\/cgf.12932","journal-title":"Comput. Graph. Forum"},{"issue":"2","key":"4_CR26","doi-asserted-by":"publisher","first-page":"292","DOI":"10.2307\/208794","volume":"24","author":"E Raisz","year":"1934","unstructured":"Raisz, E.: The rectangular statistical cartogram. Geogr. Rev. 24(2), 292\u2013296 (1934). https:\/\/doi.org\/10.2307\/208794","journal-title":"Geogr. Rev."},{"key":"4_CR27","doi-asserted-by":"publisher","unstructured":"Shneiderman, B., Wattenberg, M.: Ordered treemap layouts. In: Information Visualization (InfoVis), pp. 73\u201378. IEEE (2001). https:\/\/doi.org\/10.1109\/INFVIS.2001.963283","DOI":"10.1109\/INFVIS.2001.963283"},{"issue":"1","key":"4_CR28","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1109\/TVCG.2017.2745140","volume":"24","author":"M Sondag","year":"2018","unstructured":"Sondag, M., Speckmann, B., Verbeek, K.: Stable treemaps via local moves. IEEE Trans. Vis. Comput. Graph. 24(1), 729\u2013738 (2018). https:\/\/doi.org\/10.1109\/TVCG.2017.2745140","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"4_CR29","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1111\/j.1749-6632.1973.tb41401.x","volume":"219","author":"WR Tobler","year":"1973","unstructured":"Tobler, W.R.: A continuous transformation useful for districting. Ann. New York Acad. Sci. 219, 215\u2013220 (1973). https:\/\/doi.org\/10.1111\/j.1749-6632.1973.tb41401.x","journal-title":"Ann. New York Acad. Sci."},{"key":"4_CR30","doi-asserted-by":"publisher","unstructured":"Tversky, B.: Cognitive maps, cognitive collages, and spatial mental models. In: Frank, A.U., Campari, I. (eds.) Spatial Information Theory (COSIT). LNCS, vol. 716, pp. 14\u201324. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57207-4_2","DOI":"10.1007\/3-540-57207-4_2"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35802-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:02:39Z","timestamp":1701133359000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35802-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030358013","9783030358020"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35802-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/kam.mff.cuni.cz\/gd2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"113","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12.55","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}