{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:36:52Z","timestamp":1725467812830},"publisher-location":"Berlin, Heidelberg","reference-count":19,"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_11","type":"book-chapter","created":{"date-parts":[[2013,2,13]],"date-time":"2013-02-13T22:17:33Z","timestamp":1360793853000},"page":"114-125","source":"Crossref","is-referenced-by-count":1,"title":["The Approximate Rectangle of Influence Drawability Problem"],"prefix":"10.1007","author":[{"given":"Emilio","family":"Di Giacomo","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Henk","family":"Meijer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/978-3-642-25878-7_3","volume-title":"GD 2011","author":"S. Alamdari","year":"2012","unstructured":"Alamdari, S., Biedl, T.: Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol.\u00a07034, pp. 14\u201325. Springer, Heidelberg (2012)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-642-22300-6_3","volume-title":"Algorithms and Data Structures","author":"P. Angelini","year":"2011","unstructured":"Angelini, P., Bruckdorfer, T., Chiesa, M., Frati, F., Kaufmann, M., Squarcella, C.: On the Area Requirements of Euclidean Minimum Spanning Trees. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol.\u00a06844, pp. 25\u201336. Springer, Heidelberg (2011)"},{"key":"11_CR3","unstructured":"Bachmaier, C., Brandenburg, F.J., Forster, M.: Track planarity testing and embedding. In: Proc. of SOFSEM 2004, vol.\u00a02, pp. 3\u201317. MatFyzPress (2004)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0196-6774(92)90019-9","volume":"13","author":"M.T. Berg de","year":"1992","unstructured":"de Berg, M.T., Carlsson, S., Overmars, M.H.: A general approach to dominance in the plane. J. Algorithms\u00a013, 274\u2013296 (1992)","journal-title":"J. Algorithms"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/3-540-46648-7_37","volume-title":"Graph Drawing","author":"T. Biedl","year":"1999","unstructured":"Biedl, T., Bretscher, A., Meijer, H.: Rectangle of Influence Drawings of Graphs without Filled 3-Cycles. In: Kratochv\u00edl, J. (ed.) GD 1999. LNCS, vol.\u00a01731, pp. 359\u2013368. Springer, Heidelberg (1999)"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF02086609","volume":"16","author":"P. Bose","year":"1996","unstructured":"Bose, P., Lenhart, W., Liotta, G.: Characterizing proximity trees. Algorithmica\u00a016, 83\u2013110 (1996)","journal-title":"Algorithmica"},{"issue":"3","key":"11_CR7","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/j.jda.2005.12.004","volume":"4","author":"G. Battista Di","year":"2006","unstructured":"Di Battista, G., Liotta, G., Whitesides, S.: The strength of weak proximity. J. Discrete Algorithms\u00a04(3), 384\u2013400 (2006)","journal-title":"J. Discrete Algorithms"},{"issue":"2","key":"11_CR8","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.jcss.2011.06.001","volume":"78","author":"E. Giacomo Di","year":"2012","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H.: Drawing a tree as a minimum spanning tree approximation. J. Comput. Syst. Sci.\u00a078(2), 491\u2013503 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/978-3-642-04764-0","volume-title":"GD 2011","author":"W. Evans","year":"2011","unstructured":"Evans, W., Gansner, E.R., Kaufmann, M., Liotta, G., Meijer, H., Spillner, A.: Approximate Proximity Drawings. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol.\u00a07034, pp. 166\u2013178. Springer, Heidelberg (2011)"},{"issue":"9","key":"11_CR10","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/j.comgeo.2011.05.005","volume":"44","author":"F. Frati","year":"2011","unstructured":"Frati, F., Kaufmann, M.: Polynomial area bounds for MST embeddings of trees. Comput. Geom. Theory and Applications\u00a044(9), 529\u2013543 (2011)","journal-title":"Comput. Geom. Theory and Applications"},{"issue":"2","key":"11_CR11","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0031-3203(85)90040-8","volume":"18","author":"M. Ichino","year":"1985","unstructured":"Ichino, M., Sklansky, J.: The relative neighborhood graph for mixed feature variables. Pattern Recognition\u00a018(2), 161\u2013167 (1985)","journal-title":"Pattern Recognition"},{"key":"11_CR12","unstructured":"Liotta, G.: Proximity drawings. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization. CRC Press (to appear)"},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0925-7721(97)00018-7","volume":"10","author":"G. Liotta","year":"1998","unstructured":"Liotta, G., Lubiw, A., Meijer, H., Whitesides, S.: The rectangle of influence drawability problem. Comput. Geom. Theory and Applications\u00a010(1), 1\u201322 (1998)","journal-title":"Comput. Geom. Theory and Applications"},{"issue":"4","key":"11_CR14","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/s00454-008-9098-2","volume":"41","author":"K. Miura","year":"2009","unstructured":"Miura, K., Matsuno, T., Nishizeki, T.: Open rectangle-of-influence drawings of inner triangulated plane graphs. Discrete & Computational Geometry\u00a041(4), 643\u2013670 (2009)","journal-title":"Discrete & Computational Geometry"},{"key":"11_CR15","unstructured":"Miura, K., Nishizeki, T.: Rectangle-of-influence drawings of four-connected plane graphs. In: APVIS 2005. CRPIT, vol.\u00a045, pp. 75\u201380. Australian Computer Society (2005)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-40996-3_22","volume-title":"Algorithms and Computation","author":"K. Miura","year":"2000","unstructured":"Miura, K., Nakano, S.-I., Nishizeki, T.: Convex Grid Drawings of Four-Connected Plane Graphs. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol.\u00a01969, pp. 254\u2013265. Springer, Heidelberg (2000)"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1016\/0196-6774(88)90028-4","volume":"9","author":"M.H. Overmars","year":"1988","unstructured":"Overmars, M.H., Wood, D.: On rectangular visibility. J. Algorithms\u00a09, 372\u2013390 (1988)","journal-title":"J. Algorithms"},{"issue":"1","key":"11_CR18","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.comgeo.2010.07.001","volume":"44","author":"S. Sadasivam","year":"2011","unstructured":"Sadasivam, S., Zhang, H.: Closed rectangle-of-influence drawings for irreducible triangulations. Comput. Geom. Theory and Applications\u00a044(1), 9\u201319 (2011)","journal-title":"Comput. Geom. Theory and Applications"},{"issue":"3","key":"11_CR19","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1142\/S1793830909000257","volume":"1","author":"H. Zhang","year":"2009","unstructured":"Zhang, H., Vaidya, M.: On open rectangle-of-influence and rectangular dual drawings of plane graphs. Discrete Mathematics, Algorithms and Applications\u00a01(3), 319\u2013333 (2009)","journal-title":"Discrete Mathematics, Algorithms and Applications"}],"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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T02:55:51Z","timestamp":1557543351000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36763-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642367625","9783642367632"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36763-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}