{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T06:51:11Z","timestamp":1773211871736,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,7,4]],"date-time":"2013-07-04T00:00:00Z","timestamp":1372896000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s00454-013-9521-1","type":"journal-article","created":{"date-parts":[[2013,7,3]],"date-time":"2013-07-03T20:38:56Z","timestamp":1372883936000},"page":"784-810","source":"Crossref","is-referenced-by-count":38,"title":["Computing Cartograms with Optimal Complexity"],"prefix":"10.1007","volume":"50","author":[{"given":"Md. Jawaherul","family":"Alam","sequence":"first","affiliation":[]},{"given":"Therese","family":"Biedl","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Felsner","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[]},{"given":"Stephen G.","family":"Kobourov","sequence":"additional","affiliation":[]},{"given":"Torsten","family":"Ueckerdt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,7,4]]},"reference":[{"key":"9521_CR1","doi-asserted-by":"crossref","unstructured":"Alam, M.J., Kobourov, S.G.: Proportional contact representations of 4-connected planar graphs. In: Graph Drawing (GD\u201912), pp. 211\u2013223. Springer (2013)","DOI":"10.1007\/978-3-642-36763-2_19"},{"key":"9521_CR2","doi-asserted-by":"crossref","unstructured":"Alam, M.J., Biedl, T.C., Felsner, S., Gerasch, A., Kaufmann, M., Kobourov, S.G.: Linear-time algorithms for hole-free rectilinear proportional contact graph representations. In: International Symposium on Algorithms and Computation (ISAAC\u201911), pp. 281\u2013291. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-25591-5_30"},{"key":"9521_CR3","doi-asserted-by":"crossref","unstructured":"Alam, M.J., Biedl, T.C., Felsner, S., Kaufmann, M., Kobourov, S.G.: Proportional contact representations of planar graphs. In: Graph Drawing (GD\u201911), pp. 26\u201338. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-25878-7_4"},{"key":"9521_CR4","doi-asserted-by":"crossref","unstructured":"Alam, M.J., Biedl, T.C., Felsner, S., Kaufmann, M., Kobourov, S.G., Ueckerdt, T.: Computing cartograms with optimal complexity. In: Symposium on Computational Geometry (SoCG\u201912), pp. 21\u201330. Bethesda (2012)","DOI":"10.1145\/2261250.2261254"},{"key":"9521_CR5","unstructured":"Biedl, T.C., Genc, B.: Complexity of octagonal and rectangular cartograms. In: Canadian Conference on, Computational Geometry (CCCG\u201905), pp. 117\u2013120. Ontario (2005)"},{"key":"9521_CR6","doi-asserted-by":"crossref","unstructured":"Biedl, T.C., Vel\u00e1zquez, L.E.R.: Orthogonal cartograms with few corners per face. In: Algorithms and Data Structures, Symposium (WADS\u201911), pp. 98\u2013109. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-22300-6_9"},{"key":"9521_CR7","first-page":"28","volume":"4","author":"AL Buchsbaum","year":"2008","unstructured":"Buchsbaum, A.L., Gansner, E.R., Procopiuc, C.M., Venkatasubramanian, S.: Rectangular layouts and contact graphs. ACM Trans. Algorithms 4, 28 (2008)","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"9521_CR8","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1049\/ip-g-2.1992.0016","volume":"139","author":"I Cederbaum","year":"1992","unstructured":"Cederbaum, I.: Analogy between VLSI floorplanning problems and realisation of a resistive network. IEE Circuits Devices Syst. 139(1), 99\u2013103 (1992)","journal-title":"IEE Circuits Devices Syst."},{"key":"9521_CR9","doi-asserted-by":"crossref","unstructured":"Chen, T., Fan, M.K.H.: On convex formulation of the floorplan area minimization problem. In: Symposium on Physical Design, pp. 124\u2013128. (1998)","DOI":"10.1145\/274535.274553"},{"issue":"4","key":"9521_CR10","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0020-0190(95)00020-D","volume":"54","author":"M Chrobak","year":"1995","unstructured":"Chrobak, M., Payne, T.H.: A linear-time algorithm for drawing a planar graph on a grid. Inf. Process. Lett. 54(4), 241\u2013246 (1995)","journal-title":"Inf. Process. Lett."},{"issue":"7","key":"9521_CR11","doi-asserted-by":"crossref","first-page":"1794","DOI":"10.1016\/j.disc.2007.12.087","volume":"309","author":"M Berg de","year":"2009","unstructured":"de Berg, M., Mumford, E., Speckmann, B.: On rectilinear duals for vertex-weighted plane graphs. Discrete Math. 309(7), 1794\u20131812 (2009)","journal-title":"Discrete Math."},{"issue":"2","key":"9521_CR12","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1142\/S0218195910003268","volume":"20","author":"M Berg de","year":"2010","unstructured":"de Berg, M., Mumford, E., Speckmann, B.: Optimal BSPs and rectilinear cartograms. Int. J. Comput. Geom. Appl. 20(2), 203\u2013222 (2010)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9521_CR13","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1017\/S0963548300001139","volume":"3","author":"H Fraysseix de","year":"1994","unstructured":"de Fraysseix, H., Ossona de Mendez, P.: On triangle contact graphs. Comb. Probab. Comput. 3, 233\u2013246 (1994)","journal-title":"Comb. Probab. Comput."},{"key":"9521_CR14","doi-asserted-by":"crossref","unstructured":"de Fraysseix, H., Ossona de Mendez, P.: On topological aspects of orientations. Discrete Math. 229(1\u20133), 57\u201372 (2001)","DOI":"10.1016\/S0012-365X(00)00201-6"},{"issue":"1","key":"9521_CR15","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H Fraysseix de","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"issue":"3","key":"9521_CR16","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1007\/s00453-011-9525-2","volume":"63","author":"CA 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 63(3), 672\u2013691 (2012)","journal-title":"Algorithmica"},{"issue":"3","key":"9521_CR17","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1137\/110834032","volume":"41","author":"D Eppstein","year":"2012","unstructured":"Eppstein, D., Mumford, E., Speckmann, B., Verbeek, K.: Area-universal and constrained rectangular layouts. SIAM J. Comput. 41(3), 537\u2013564 (2012)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"9521_CR18","doi-asserted-by":"crossref","first-page":"2150","DOI":"10.1137\/S0097539796308874","volume":"28","author":"X He","year":"1999","unstructured":"He, X.: On floor-plan of plane graphs. SIAM J. Comput. 28(6), 2150\u20132167 (1999)","journal-title":"SIAM J. Comput."},{"key":"9521_CR19","unstructured":"Heilmann, R., Keim, D.A., Panse, C., Sips, M.: Recmap: Rectangular map approximations. In: IEEE Symposium on, Information Visualization (INFOVIS\u201904), pp. 33\u201340. Minneapolis (2004)"},{"key":"9521_CR20","unstructured":"House, D., Kocmoud, C.: Continuous cartogram construction. In: Proceedings of IEEE Visualization, pp. 197\u2013204. Triangle Park (1998)"},{"key":"9521_CR21","first-page":"857","volume":"E81\u2013A","author":"T Izumi","year":"1998","unstructured":"Izumi, T., Takahashi, A., Kajitani, Y.: Air-pressure model and fast algorithms for zero-wasted-area layout of general floorplan. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E81\u2013A, 857\u2013865 (1998)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"9521_CR22","doi-asserted-by":"crossref","unstructured":"Kawaguchi, A., Nagamochi, H.: Orthogonal drawings for plane graphs with specified face areas. In: Theory and Applications of Model of Computation (TAMC\u201907), pp. 584\u2013594 . Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-72504-6_53"},{"key":"9521_CR23","first-page":"141","volume":"88","author":"P Koebe","year":"1936","unstructured":"Koebe, P.: Kontaktprobleme der konformen Abbildung. Berichte \u00fcber die Verhandlungen der S\u00e4chsischen Akademie der Wissenschaften zu Leipzig. Math. Phys. Klasse 88, 141\u2013164 (1936)","journal-title":"Math. Phys. Klasse"},{"key":"9521_CR24","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/net.3230150202","volume":"15","author":"K Ko\u017ami\u0144ski","year":"1985","unstructured":"Ko\u017ami\u0144ski, K., Kinnen, E.: Rectangular duals of planar graphs. Networks 15, 145\u2013157 (1985)","journal-title":"Networks"},{"key":"9521_CR25","doi-asserted-by":"crossref","unstructured":"Leinwand, S.M., Lai, Y.T.: An algorithm for building rectangular floor-plans. In: Design Automation Conference, pp. 663\u2013664. IEEE Press, Piscataway (1984)","DOI":"10.1109\/DAC.1984.1585874"},{"key":"9521_CR26","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/S0196-6774(03)00057-9","volume":"48","author":"CC Liao","year":"2003","unstructured":"Liao, C.C., Lu, H.I., Yen, H.C.: Compact floor-planning via orderly spanning trees. J. Algorithms 48, 441\u2013451 (2003)","journal-title":"J. Algorithms"},{"issue":"5","key":"9521_CR27","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1080\/03052150214016","volume":"34","author":"J Michalek","year":"2002","unstructured":"Michalek, J., Choudhary, R., Papalambros, P.: Architectural layout design optimization. Eng. Optim. 34(5), 461\u2013484 (2002)","journal-title":"Eng. Optim."},{"issue":"9","key":"9521_CR28","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1109\/81.536741","volume":"43","author":"TS Moh","year":"1996","unstructured":"Moh, T.S., Chang, T.S., Hakimi, S.L.: Globally optimal floorplanning for a layout problem. IEEE Trans. Circuits Syst. 43(9), 713\u2013720 (1996)","journal-title":"IEEE Trans. Circuits Syst."},{"key":"9521_CR29","doi-asserted-by":"crossref","unstructured":"N\u00f6llenburg, M., Prutkin, R., Rutter, I.: Edge-weighted contact representations of planar graphs. In: Graph Drawing (GD\u201912), pp. 224\u2013235. Springer (2013)","DOI":"10.1007\/978-3-642-36763-2_20"},{"issue":"3","key":"9521_CR30","doi-asserted-by":"crossref","first-page":"292","DOI":"10.2307\/208794","volume":"24","author":"E Raisz","year":"1934","unstructured":"Raisz, E.: The rectangular statistical cartogram. Geogr. Rev. 24(3), 292\u2013296 (1934)","journal-title":"Geogr. Rev."},{"key":"9521_CR31","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1068\/b140163","volume":"14","author":"I Rinsma","year":"1987","unstructured":"Rinsma, I.: Nonexistence of a certain rectangular floorplan with specified area and adjacency. Environ. Plan. 14, 163\u2013166 (1987)","journal-title":"Environ. Plan."},{"key":"9521_CR32","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01415168","volume":"33","author":"E Rosenberg","year":"1989","unstructured":"Rosenberg, E.: Optimal module sizing in VLSI floorplanning by nonlinear programming. Methods Models Oper. Res. 33, 131\u2013143 (1989)","journal-title":"Methods Models Oper. Res."},{"key":"9521_CR33","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Symposium on Discrete Algorithms (SODA\u201990), pp. 138\u2013148. San Francisco (1990)"},{"key":"9521_CR34","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1111\/j.1467-8306.2004.09401004.x","volume":"94","author":"W Tobler","year":"2004","unstructured":"Tobler, W.: Thirty five years of computer cartograms. Ann. Assoc. Am. Geogr. 94, 58\u201373 (2004)","journal-title":"Ann. Assoc. Am. Geogr."},{"key":"9521_CR35","unstructured":"Ueckerdt, T.: Geometric representations of graphs with low polygonal complexity. Ph.D. Thesis, Technische Universit\u00e4t, Berlin (2011)"},{"key":"9521_CR36","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1112\/jlms\/s1-28.3.336","volume":"28","author":"P Ungar","year":"1953","unstructured":"Ungar, P.: On diagrams representing maps. J. Lond. Math. Soc. 28, 336\u2013342 (1953)","journal-title":"J. Lond. Math. Soc."},{"issue":"3","key":"9521_CR37","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.comgeo.2006.06.002","volume":"37","author":"MJ Kreveld van","year":"2007","unstructured":"van Kreveld, M.J., Speckmann, B.: On rectangular cartograms. Comput. Geom. 37(3), 175\u2013187 (2007)","journal-title":"Comput. Geom."},{"key":"9521_CR38","unstructured":"Wang, K., Chen, W.K.: Floorplan area optimization using network analogous approach. In: IEEE Transactions Circuits and Systems, pp. 167\u2013170 (1995)"},{"issue":"3","key":"9521_CR39","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1109\/31.1739","volume":"35","author":"S Wimer","year":"1988","unstructured":"Wimer, S., Koren, I., Cederbaum, I.: Floorplans, planar graphs, and layouts. IEEE Trans. Circuits Syst. 35(3), 267\u2013278 (1988)","journal-title":"IEEE Trans. Circuits Syst."},{"key":"9521_CR40","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1137\/0222035","volume":"22","author":"KH Yeap","year":"1993","unstructured":"Yeap, K.H., Sarrafzadeh, M.: Floor-planning by graph dualization: 2-concave rectilinear modules. SIAM J. Comput. 22, 500\u2013526 (1993)","journal-title":"SIAM J. Comput."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-013-9521-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-013-9521-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-013-9521-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,17]],"date-time":"2019-07-17T01:43:51Z","timestamp":1563327831000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-013-9521-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,4]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["9521"],"URL":"https:\/\/doi.org\/10.1007\/s00454-013-9521-1","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,4]]}}}