{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T20:10:23Z","timestamp":1741983023866,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255908"},{"type":"electronic","value":"9783642255915"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25591-5_30","type":"book-chapter","created":{"date-parts":[[2011,12,3]],"date-time":"2011-12-03T00:32:34Z","timestamp":1322872354000},"page":"281-291","source":"Crossref","is-referenced-by-count":6,"title":["Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations"],"prefix":"10.1007","author":[{"given":"Muhammad Jawaherul","family":"Alam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Therese","family":"Biedl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Felsner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Gerasch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen G.","family":"Kobourov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Alam, M.J., Biedl, T., Felsner, S., Gerasch, A., Kaufmann, M., Kobourov, S.G.: Linear-time algorithms for proportional contact graph representations. Technical Report CS-2011-19, University of Waterloo (2011)","DOI":"10.1007\/978-3-642-25591-5_30"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Alam, M.J., Biedl, T., Felsner, S., Kaufmann, M., Kobourov, S., Ueckert, T.: Computing cartograms with optimal complexity (2011) (submitted)","DOI":"10.1145\/2261250.2261254"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-642-11805-0_30","volume-title":"Graph Drawing","author":"T. Biedl","year":"2010","unstructured":"Biedl, T., Ruiz Vel\u00e1zquez, L.E.: Drawing Planar 3-Trees with Given Face-Areas. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 316\u2013322. Springer, Heidelberg (2010)"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-22300-6_9","volume-title":"Algorithms and Data Structures","author":"T. Biedl","year":"2011","unstructured":"Biedl, T., Ruiz Vel\u00e1zquez, L.E.: Orthogonal Cartograms with Few Corners Per Face. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol.\u00a06844, pp. 98\u2013109. Springer, Heidelberg (2011)"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Buchsbaum, A.L., Gansner, E.R., Procopiuc, C.M., Venkatasubramanian, S.: Rectangular layouts and contact graphs. ACM Transactions on Algorithms\u00a04(1) (2008)","DOI":"10.1145\/1328911.1328919"},{"issue":"7","key":"30_CR6","doi-asserted-by":"publisher","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 Mathematics\u00a0309(7), 1794\u20131812 (2009)","journal-title":"Discrete Mathematics"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-642-12200-2_37","volume-title":"LATIN 2010: Theoretical Informatics","author":"E.R. Gansner","year":"2010","unstructured":"Gansner, E.R., Hu, Y.F., Kaufmann, M., Kobourov, S.G.: Optimal Polygonal Representation of Planar Graphs. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol.\u00a06034, pp. 417\u2013432. Springer, Heidelberg (2010)"},{"issue":"6","key":"30_CR8","doi-asserted-by":"publisher","first-page":"2150","DOI":"10.1137\/S0097539796308874","volume":"28","author":"X. He","year":"1999","unstructured":"He, X.: On floor-plan of plane graphs. SIAM Journal of Computing\u00a028(6), 2150\u20132167 (1999)","journal-title":"SIAM Journal of Computing"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Heilmann, R., Keim, D.A., Panse, C., Sips, M.: Recmap: Rectangular map approximations. In: 10th IEEE Symp.\u00a0on Information Visualization (InfoVis 2004), pp. 33\u201340 (2004)","DOI":"10.1109\/INFVIS.2004.57"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1007\/978-3-540-72504-6_53","volume-title":"Theory and Applications of Models of Computation","author":"A. Kawaguchi","year":"2007","unstructured":"Kawaguchi, A., Nagamochi, H.: Orthogonal Drawings for Plane Graphs with Specified Face Areas. In: Cai, J.-Y., Cooper, S.B., Zhu, H. (eds.) TAMC 2007. LNCS, vol.\u00a04484, pp. 584\u2013594. Springer, Heidelberg (2007)"},{"key":"30_CR11","doi-asserted-by":"publisher","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\u00a015, 145\u2013157 (1985)","journal-title":"Networks"},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/S0196-6774(03)00057-9","volume":"48","author":"C.-C. Liao","year":"2003","unstructured":"Liao, C.-C., Lu, H.-I., Yen, H.-C.: Compact floor-planning via orderly spanning trees. Journal of Algorithms\u00a048, 441\u2013451 (2003)","journal-title":"Journal of Algorithms"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Mondal, D., Nishat, R.I., Rahman, M.S., Alam, M.J.: Minimum-area drawings of plane 3-trees. In: CCCG, pp. 191\u2013194 (2010)","DOI":"10.7155\/jgaa.00222"},{"issue":"3","key":"30_CR14","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.comgeo.2008.09.002","volume":"42","author":"M.S. Rahman","year":"2009","unstructured":"Rahman, M.S., Miura, K., Nishizeki, T.: Octagonal drawings of plane graphs with prescribed face areas. Computational Geometry\u00a042(3), 214\u2013230 (2009)","journal-title":"Computational Geometry"},{"key":"30_CR15","unstructured":"Ringel, G.: Equiareal graphs. In: Bodendiek, R. (ed.) Contemporary Methods in Graph Theory, pp. 503\u2013505. Wissenschaftsverlag (1990)"},{"key":"30_CR16","doi-asserted-by":"publisher","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. Environment and Planning B: Planning and Design\u00a014, 163\u2013166 (1987)","journal-title":"Environment and Planning B: Planning and Design"},{"key":"30_CR17","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: SODA, pp. 138\u2013148 (1990)"},{"issue":"6","key":"30_CR18","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/BF01891831","volume":"10","author":"Y. Sun","year":"1993","unstructured":"Sun, Y., Sarrafzadeh, M.: Floorplanning by graph dualization: L-shaped modules. Algorithmica\u00a010(6), 429\u2013456 (1993)","journal-title":"Algorithmica"},{"key":"30_CR19","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1017\/S0963548300000407","volume":"1","author":"C. Thomassen","year":"1992","unstructured":"Thomassen, C.: Plane cubic graphs with prescribed face areas. Combinatorics, Probability & Computing\u00a01, 371\u2013381 (1992)","journal-title":"Combinatorics, Probability & Computing"},{"key":"30_CR20","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1112\/jlms\/s1-28.3.336","volume":"28","author":"P. Ungar","year":"1953","unstructured":"Ungar, P.: On diagrams representing graphs. J. London Math. Soc.\u00a028, 336\u2013342 (1953)","journal-title":"J. London Math. Soc."},{"issue":"3","key":"30_CR21","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.comgeo.2006.06.002","volume":"37","author":"M.J. Kreveld van","year":"2007","unstructured":"van Kreveld, M.J., Speckmann, B.: On rectangular cartograms. Computational Geometry\u00a037(3), 175\u2013187 (2007)","journal-title":"Computational Geometry"},{"key":"30_CR22","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1137\/0222035","volume":"22","author":"K.-H. Yeap","year":"1993","unstructured":"Yeap, K.-H., Sarrafzadeh, M.: Floor-planning by graph dualization: 2-concave rectilinear modules. SIAM Journal on Computing\u00a022, 500\u2013526 (1993)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25591-5_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T19:32:01Z","timestamp":1741980721000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25591-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255908","9783642255915"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25591-5_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}