{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,2]],"date-time":"2023-10-02T13:59:33Z","timestamp":1696255173333},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,3,16]],"date-time":"2013-03-16T00:00:00Z","timestamp":1363392000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s00453-013-9764-5","type":"journal-article","created":{"date-parts":[[2013,3,16]],"date-time":"2013-03-16T04:40:39Z","timestamp":1363408839000},"page":"3-22","source":"Crossref","is-referenced-by-count":7,"title":["Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact Graph Representations"],"prefix":"10.1007","volume":"67","author":[{"given":"M. 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","published-online":{"date-parts":[[2013,3,16]]},"reference":[{"key":"9764_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/978-3-642-25591-5_30","volume-title":"International Symposium on Algorithms and Computation (ISAAC\u201911)","author":"M.J. Alam","year":"2011","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). Lecture Notes in Computer Science, vol. 7074, pp. 281\u2013291. Springer, Berlin (2011)"},{"key":"9764_CR2","first-page":"21","volume-title":"Symposium on Computational Geometry (SoCG\u201912)","author":"M.J. Alam","year":"2012","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. ACM, New York (2012)"},{"issue":"7","key":"9764_CR3","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."},{"key":"9764_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/978-3-642-22300-6_9","volume-title":"Workshop on Algorithms and Data Structures (WADS\u201911)","author":"T.C. Biedl","year":"2011","unstructured":"Biedl, T.C., Vel\u00e1zquez, L.E.R.: Orthogonal cartograms with few corners per face. In: Workshop on Algorithms and Data Structures (WADS\u201911). Lecture Notes in Computer Science, vol. 6844, pp. 98\u2013109. Springer, Berlin (2011)"},{"issue":"3","key":"9764_CR5","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/j.comgeo.2012.09.004","volume":"46","author":"T.C. Biedl","year":"2013","unstructured":"Biedl, T.C., Vel\u00e1zquez, L.E.R.: Drawing planar 3-trees with given face areas. Comput. Geom. 46(3), 276\u2013285 (2013)","journal-title":"Comput. Geom."},{"issue":"1","key":"9764_CR6","doi-asserted-by":"crossref","DOI":"10.1145\/1328911.1328919","volume":"4","author":"A.L. Buchsbaum","year":"2008","unstructured":"Buchsbaum, A.L., Gansner, E.R., Procopiuc, C.M., Venkatasubramanian, S.: Rectangular layouts and contact graphs. ACM Trans. Algorithms 4(1), 8 (2008). doi: 10.1145\/1328911.1328919","journal-title":"ACM Trans. Algorithms"},{"issue":"3","key":"9764_CR7","doi-asserted-by":"crossref","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 63(3), 672\u2013691 (2012)","journal-title":"Algorithmica"},{"issue":"1\u20133","key":"9764_CR8","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0012-365X(00)00201-6","volume":"229","author":"H. Fraysseix de","year":"2001","unstructured":"de Fraysseix, H., de Mendez, P.O.: On topological aspects of orientations. Discrete Math. 229(1\u20133), 57\u201372 (2001)","journal-title":"Discrete Math."},{"key":"9764_CR9","doi-asserted-by":"crossref","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. Comb. Probab. Comput. 3, 233\u2013246 (1994)","journal-title":"Comb. Probab. Comput."},{"issue":"6","key":"9764_CR10","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":"9764_CR11","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1109\/INFVIS.2004.57","volume-title":"IEEE Symposium on Information Visualization (INFOVIS\u201904)","author":"R. Heilmann","year":"2004","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 (2004)"},{"issue":"5","key":"9764_CR12","first-page":"857","volume":"E81-A","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-A(5), 857\u2013865 (1998). Special section on discrete mathematics and its applications","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"3","key":"9764_CR13","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1142\/S0218195997000132","volume":"7","author":"G. Kant","year":"1997","unstructured":"Kant, G.: A more compact visibility representation. Int. J. Comput. Geom. Appl. 7(3), 197\u2013210 (1997)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9764_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1007\/978-3-540-72504-6_53","volume-title":"Theory and Applications of Models of Computation (TAMC\u201907)","author":"A. Kawaguchi","year":"2007","unstructured":"Kawaguchi, A., Nagamochi, H.: Orthogonal drawings for plane graphs with specified face areas. In: Theory and Applications of Models of Computation (TAMC\u201907). Lecture Notes in Computer Science, vol. 4484, pp. 584\u2013594. Springer, Berlin (2007)"},{"key":"9764_CR15","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":"Berichte \u00fcber die Verhandlungen der S\u00e4chsischen Akademie der Wissenschaften zu Leipzig. Math.-Phys. Klasse"},{"key":"9764_CR16","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"},{"issue":"3","key":"9764_CR17","doi-asserted-by":"crossref","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. Comput. Geom. 37(3), 175\u2013187 (2007)","journal-title":"Comput. Geom."},{"issue":"2","key":"9764_CR18","doi-asserted-by":"crossref","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. J.\u00a0Algorithms 48(2), 441\u2013451 (2003)","journal-title":"J.\u00a0Algorithms"},{"issue":"2","key":"9764_CR19","doi-asserted-by":"crossref","first-page":"177","DOI":"10.7155\/jgaa.00222","volume":"15","author":"D. Mondal","year":"2011","unstructured":"Mondal, D., Nishat, R.I., Rahman, M.S., Alam, M.J.: Minimum-area drawings of plane 3-trees. J.\u00a0Graph Algorithms Appl. 15(2), 177\u2013204 (2011)","journal-title":"J.\u00a0Graph Algorithms Appl."},{"issue":"3","key":"9764_CR20","doi-asserted-by":"crossref","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. Comput. Geom. 42(3), 214\u2013230 (2009)","journal-title":"Comput. Geom."},{"key":"9764_CR21","first-page":"503","volume-title":"Contemporary Methods in Graph Theory","author":"G. Ringel","year":"1990","unstructured":"Ringel, G.: Equiareal graphs. In: Bodendiek, R. (ed.) Contemporary Methods in Graph Theory, pp.\u00a0503\u2013505. Wissenschaftsverlag, Berlin (1990)"},{"key":"9764_CR22","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. B, Plan. Des. 14, 163\u2013166 (1987)","journal-title":"Environ. Plan. B, Plan. Des."},{"key":"9764_CR23","first-page":"138","volume-title":"Symposium on Discrete Algorithms (SODA\u201990)","author":"W. Schnyder","year":"1990","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Symposium on Discrete Algorithms (SODA\u201990), pp. 138\u2013148 (1990)"},{"issue":"6","key":"9764_CR24","doi-asserted-by":"crossref","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 10(6), 429\u2013456 (1993)","journal-title":"Algorithmica"},{"key":"9764_CR25","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1017\/S0963548300000407","volume":"1","author":"C. Thomassen","year":"1992","unstructured":"Thomassen, C.: Plane cubic graphs with prescribed face areas. Comb. Probab. Comput. 1, 371\u2013381 (1992)","journal-title":"Comb. Probab. Comput."},{"key":"9764_CR26","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 graphs. J.\u00a0Lond. Math. Soc. 28, 336\u2013342 (1953)","journal-title":"J.\u00a0Lond. Math. Soc."},{"key":"9764_CR27","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1109\/ISCAS.1995.521477","volume-title":"IEEE International Symposium on Circuits and Systems","author":"K. Wang","year":"1995","unstructured":"Wang, K., Chen, W.K.: Floorplan area optimization using network analogous approach. In: IEEE International Symposium on Circuits and Systems, vol. 1, pp. 167\u2013170 (1995)"},{"key":"9764_CR28","doi-asserted-by":"crossref","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 J. Comput. 22, 500\u2013526 (1993)","journal-title":"SIAM J. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9764-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-013-9764-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9764-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:11Z","timestamp":1559137511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-013-9764-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,16]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["9764"],"URL":"https:\/\/doi.org\/10.1007\/s00453-013-9764-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,16]]}}}