{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T02:46:45Z","timestamp":1649040405920},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,1,15]],"date-time":"2014-01-15T00:00:00Z","timestamp":1389744000000},"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":[[2015,6]]},"DOI":"10.1007\/s00453-013-9866-0","type":"journal-article","created":{"date-parts":[[2014,1,14]],"date-time":"2014-01-14T20:37:10Z","timestamp":1389731830000},"page":"620-655","source":"Crossref","is-referenced-by-count":0,"title":["The Approximate Rectangle of Influence Drawability Problem"],"prefix":"10.1007","volume":"72","author":[{"given":"Emilio","family":"Di\u00a0Giacomo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henk","family":"Meijer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,1,15]]},"reference":[{"key":"9866_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":"Graph Drawing","author":"S. Alamdari","year":"2012","unstructured":"Alamdari, S., Biedl, T.: Planar open rectangle-of-influence drawings with non-aligned frames. In: Kreveld, M., Speckmann, B. (eds.) Graph Drawing. Lecture Notes in Computer Science, vol. 7034, pp. 14\u201325. Springer, Berlin (2012)"},{"key":"9866_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1007\/978-3-642-36763-2_10","volume-title":"Graph Drawing","author":"S. Alamdari","year":"2013","unstructured":"Alamdari, S., Biedl, T.: Open rectangle-of-influence drawings of non-triangulated planar graphs. In: Didimo, W., Patrignani, M. (eds.) Graph Drawing. Lecture Notes in Computer Science, vol. 7704, pp. 102\u2013113. Springer, Berlin (2013)"},{"key":"9866_CR3","series-title":"Lecture Notes in Computer Science","first-page":"25","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.) Algorithms and Data Structures. Lecture Notes in Computer Science, vol. 6844, pp. 25\u201336. Springer, Berlin (2011)"},{"key":"9866_CR4","first-page":"3","volume-title":"Proc. of SOFSEM 2004","author":"C. Bachmaier","year":"2004","unstructured":"Bachmaier, C., Brandenburg, F.J., Forster, M.: Track planarity testing and embedding. In: Boas, P.V.E., Pokorny, J., Bielikova, M., Stuller, J. (eds.) Proc. of SOFSEM 2004, vol. 2, pp. 3\u201317. MatFyzPress, Prague (2004)"},{"key":"9866_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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\u00edyl, J. (ed.) Graph Drawing. Lecture Notes in Computer Science, vol. 1731, pp. 359\u2013368. Springer, Berlin (1999)"},{"key":"9866_CR6","doi-asserted-by":"crossref","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 16, 83\u2013110 (1996)","journal-title":"Algorithmica"},{"key":"9866_CR7","doi-asserted-by":"crossref","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 13, 274\u2013296 (1992)","journal-title":"J. Algorithms"},{"key":"9866_CR8","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, 41\u201351 (1990). doi: 10.1007\/BF02122694","journal-title":"Combinatorica"},{"issue":"3","key":"9866_CR9","doi-asserted-by":"crossref","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 4(3), 384\u2013400 (2006)","journal-title":"J. Discrete Algorithms"},{"issue":"2","key":"9866_CR10","doi-asserted-by":"crossref","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. 78(2), 491\u2013503 (2012)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"9866_CR11","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1016\/j.comgeo.2013.01.001","volume":"46","author":"W.S. Evans","year":"2013","unstructured":"Evans, W.S., Gansner, E.R., Kaufmann, M., Liotta, G., Meijer, H., Spillner, A.: Approximate proximity drawings. Comput. Geom. 46(6), 604\u2013614 (2013)","journal-title":"Comput. Geom."},{"issue":"9","key":"9866_CR12","doi-asserted-by":"crossref","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 Appl. 44(9), 529\u2013543 (2011)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9866_CR13","doi-asserted-by":"crossref","first-page":"259","DOI":"10.2307\/2412323","volume":"18","author":"K.R. Gabriel","year":"1969","unstructured":"Gabriel, K.R., Sokal, R.R.: A new statistical approach to geographic variation analysis. Syst. Zool. 18, 259\u2013278 (1969)","journal-title":"Syst. Zool."},{"issue":"2","key":"9866_CR14","doi-asserted-by":"crossref","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 Recognit. 18(2), 161\u2013167 (1985)","journal-title":"Pattern Recognit."},{"issue":"2","key":"9866_CR15","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0020-0190(97)00048-3","volume":"62","author":"G. Kant","year":"1997","unstructured":"Kant, G., Liotta, G., Tamassia, R., Tollis, I.G.: Area requirement of visibility representations of trees. Inf. Process. Lett. 62(2), 81\u201388 (1997)","journal-title":"Inf. Process. Lett."},{"key":"9866_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1007\/3-540-62495-3_55","volume-title":"Graph Drawing","author":"W. Lenhart","year":"1997","unstructured":"Lenhart, W., Liotta, G.: Proximity drawings of outerplanar graphs. In: North, S. (ed.) Graph Drawing. Lecture Notes in Computer Science, vol. 1190, pp. 286\u2013302. Springer, Berlin (1997)"},{"key":"9866_CR17","volume-title":"Handbook of Graph Drawing and Visualization","author":"G. Liotta","year":"2013","unstructured":"Liotta, G.: Proximity drawings. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization. CRC Press, Boca Raton (2013)"},{"issue":"1","key":"9866_CR18","doi-asserted-by":"crossref","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 Appl. 10(1), 1\u201322 (1998)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9866_CR19","series-title":"CRPIT","first-page":"75","volume-title":"APVIS 2005","author":"K. Miura","year":"2005","unstructured":"Miura, K., Nishizeki, T.: Rectangle-of-influence drawings of four-connected plane graphs. In: hee Hong, S. (ed.) APVIS 2005. CRPIT, vol. 45, pp. 75\u201380. Australian Computer Society, Sydney (2005)"},{"key":"9866_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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: Goos, G., Hartmanis, J., Leeuwen, J., Lee, D., Teng, S.-H. (eds.) Algorithms and Computation. Lecture Notes in Computer Science, vol. 1969, pp. 254\u2013265. Springer, Berlin (2000)"},{"issue":"4","key":"9866_CR21","doi-asserted-by":"crossref","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 Comput. Geom. 41(4), 643\u2013670 (2009)","journal-title":"Discrete Comput. Geom."},{"key":"9866_CR22","doi-asserted-by":"crossref","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 9, 372\u2013390 (1988)","journal-title":"J. Algorithms"},{"key":"9866_CR23","volume-title":"Computational Geometry: An Introduction","author":"F.P. Preparata","year":"1990","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction, 3rd edn. Springer, Berlin (1990)","edition":"3"},{"issue":"1","key":"9866_CR24","doi-asserted-by":"crossref","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 Appl. 44(1), 9\u201319 (2011)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9866_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/978-3-540-77891-2_8","volume-title":"WALCOM: Algorithms and Computation","author":"M. Samee","year":"2008","unstructured":"Samee, M., Irfan, M., Rahman, M.: Computing \u03b2-drawings of 2-outerplane graphs in linear time. In: Nakano, S.-i., Rahman, M. (eds.) WALCOM: Algorithms and Computation. Lecture Notes in Computer Science, vol. 4921, pp. 81\u201387. Springer, Berlin (2008)"},{"key":"9866_CR26","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0031-3203(80)90066-7","volume":"12","author":"G.T. Toussaint","year":"1980","unstructured":"Toussaint, G.T.: The relative neighbourhood graph of a finite planar set. Pattern Recognit. 12, 261\u2013268 (1980)","journal-title":"Pattern Recognit."},{"issue":"3","key":"9866_CR27","doi-asserted-by":"crossref","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 Math. Algorithms Appl. 1(3), 319\u2013333 (2009)","journal-title":"Discrete Math. Algorithms Appl."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9866-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-013-9866-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9866-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:13Z","timestamp":1559137513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-013-9866-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,15]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["9866"],"URL":"https:\/\/doi.org\/10.1007\/s00453-013-9866-0","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,15]]}}}