{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:36:40Z","timestamp":1725467800007},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642367625"},{"type":"electronic","value":"9783642367632"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36763-2_17","type":"book-chapter","created":{"date-parts":[[2013,2,13]],"date-time":"2013-02-13T22:17:33Z","timestamp":1360793853000},"page":"187-198","source":"Crossref","is-referenced-by-count":9,"title":["On Representing Graphs by Touching Cuboids"],"prefix":"10.1007","author":[{"given":"David","family":"Bremner","sequence":"first","affiliation":[]},{"given":"William","family":"Evans","sequence":"additional","affiliation":[]},{"given":"Fabrizio","family":"Frati","sequence":"additional","affiliation":[]},{"given":"Laurie","family":"Heyer","sequence":"additional","affiliation":[]},{"given":"Stephen G.","family":"Kobourov","sequence":"additional","affiliation":[]},{"given":"William J.","family":"Lenhart","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"David","family":"Rappaport","sequence":"additional","affiliation":[]},{"given":"Sue H.","family":"Whitesides","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","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: Dey, T.K., Whitesides, S. (eds.) Symposium on Computational Geometry, SoCG 2012, pp. 21\u201330 (2012)","DOI":"10.1145\/2261250.2261254"},{"key":"17_CR2","unstructured":"Badent, M., Binucci, C., Giacomo, E.D., Didimo, W., Felsner, S., Giordano, F., Kratochv\u00edl, J., Palladino, P., Patrignani, M., Trotta, F.: Homothetic triangle contact representations of planar graphs. In: Bose, P. (ed.) Canadian Conference on Computational Geometry, CCCG 2007, pp. 233\u2013236 (2007)"},{"key":"17_CR3","unstructured":"Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall (1999)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Borchard-Ott, W.: Crystallography. Springer (2011)","DOI":"10.1007\/978-3-642-16452-1"},{"key":"17_CR5","unstructured":"Breu, H.: Algorithmic Aspects of Constrained Unit Disk Graphs. Ph.D. thesis, The University of British Columbia, Canada (1996)"},{"key":"17_CR6","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 4(1) (2008)","DOI":"10.1145\/1328911.1328919"},{"issue":"4","key":"17_CR7","first-page":"429","volume":"13","author":"J. Czyzowicz","year":"2004","unstructured":"Czyzowicz, J., Kranakis, E., Krizanc, D., Urrutia, J.: Discrete realizations of contact and intersection graphs. International Journal of Pure and Applied Mathematics\u00a013(4), 429\u2013442 (2004)","journal-title":"International Journal of Pure and Applied Mathematics"},{"key":"17_CR8","unstructured":"de Fraysseix, H., Ossona de Mendez, P.: Representations of Planar Graphs by Segments. Colloquia Mathematica Societatis J\u00e1nos Bolyai, vol.\u00a063, pp. 109\u2013117. North-Holland (2007)"},{"issue":"3","key":"17_CR9","doi-asserted-by":"publisher","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\u00a063(3), 672\u2013691 (2012)","journal-title":"Algorithmica"},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0304-3975(97)84223-5","volume":"169","author":"P. Eades","year":"1996","unstructured":"Eades, P., Whitesides, S.: The logic engine and the realization problem for nearest neighbor graphs. Theoretical Computer Science\u00a0169(1), 23\u201337 (1996)","journal-title":"Theoretical Computer Science"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Felsner, S.: Rectangle and square representations of planar graphs. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory. Springer (2012)","DOI":"10.1007\/978-1-4614-0110-0_12"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Felsner, S., Francis, M.C.: Contact representations of planar graphs with cubes. In: Hurtado, F., van Kreveld, M.J. (eds.) Symposium on Computational Geometry, SoCG 2011, pp. 315\u2013320 (2011)","DOI":"10.1145\/1998196.1998250"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1017\/S0963548300001139","volume":"3","author":"H. Fraysseix de","year":"1994","unstructured":"de Fraysseix, H., Ossona de Mendez, P., Rosenstiehl, P.: On triangle contact graphs. Combinatorics, Probability & Computing\u00a03, 233\u2013246 (1994)","journal-title":"Combinatorics, Probability & Computing"},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","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\u00a010(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"issue":"6","key":"17_CR15","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 on Computing\u00a028(6), 2150\u20132167 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing graphs: methods and models. Springer (2001)","DOI":"10.1007\/3-540-44969-8"},{"key":"17_CR17","first-page":"141","volume":"88","author":"P. Koebe","year":"1936","unstructured":"Koebe, P.: Kontaktprobleme der konformen Abbildung. Berichte \u00fcber die Verhandlungen der S\u00e4chsischen Akad.\u00a0der Wissenschaften zu Leipzig. Math.-Phys. Klasse\u00a088, 141\u2013164 (1936)","journal-title":"Math.-Phys. Klasse"},{"key":"17_CR18","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":"17_CR19","doi-asserted-by":"crossref","unstructured":"Leinwand, S.M., Lai, Y.T.: An algorithm for building rectangular floor-plans. In: Lambert, P.H., Ofek, H., O\u2019Neill, L.A., Pistilli, P.O., Losleben, P., Nash, J.D., Shaklee, D.W., Preas, B.T., Lerman, H.N. (eds.) Design Automation Conference, DAC 1984, pp. 663\u2013664 (1984)","DOI":"10.1109\/DAC.1984.1585874"},{"issue":"4","key":"17_CR20","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/BF00353652","volume":"5","author":"W. Schnyder","year":"1989","unstructured":"Schnyder, W.: Planar graphs and poset dimension. Order\u00a05(4), 323\u2013343 (1989)","journal-title":"Order"},{"key":"17_CR21","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Symposium on Discrete Algorithms, SODA 1990, pp. 138\u2013148 (1990)"},{"issue":"1","key":"17_CR22","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0095-8956(86)90061-4","volume":"40","author":"C. Thomassen","year":"1986","unstructured":"Thomassen, C.: Interval representations of planar graphs. Journal of Combinatorial Theory, Series B\u00a040(1), 9\u201320 (1986)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"17_CR23","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. Journal of the London Mathematical Society\u00a028, 336\u2013342 (1953)","journal-title":"Journal of the London Mathematical Society"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36763-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T14:34:07Z","timestamp":1562682847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36763-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642367625","9783642367632"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36763-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}