{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:17:44Z","timestamp":1760440664258},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540669043"},{"type":"electronic","value":"9783540466482"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46648-7_37","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T04:29:28Z","timestamp":1186892968000},"page":"359-368","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Rectangle of Influence Drawings of Graphs without Filled 3-Cycles"],"prefix":"10.1007","author":[{"given":"Therese","family":"Biedl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Bretscher","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":[[2000,3,3]]},"reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0195-6698(85)80028-7","volume":"6","author":"N. Alon","year":"1985","unstructured":"N. Alon, Z. F\u00fcredi, and M. Katchalski. Separating pairs of points by standard boxes. European Journal of Combinatorics, 6:205\u2013210, 1985.","journal-title":"European Journal of Combinatorics"},{"issue":"4","key":"37_CR2","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/PL00009182","volume":"19","author":"T. Biedl","year":"1997","unstructured":"T. Biedl, G. Kant, and M. Kaufmann. On triangulating planar graphs under the four-connectivity constraint. Algorithmica, 19(4):427\u2013446, 1997.","journal-title":"Algorithmica"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"J. Bondy and U. Murty. Graph Theory and Applications. Amerian Elsevier Publishing Co., 1976.","DOI":"10.1007\/978-1-349-03521-2"},{"key":"37_CR4","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0196-6774(92)90019-9","volume":"13","author":"M. Berlin de","year":"1992","unstructured":"M. de Berlin, S. Carlsson, and M. Overmars. A general approach to dominance in the plane. Journal of Algorithms, 13:274\u2013296, 1992.","journal-title":"Journal of Algorithms"},{"key":"37_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/3-540-58950-3_388","volume-title":"DIMACS International Workshop, Graph Drawing 94","author":"G. Battista Di","year":"1995","unstructured":"G. Di Battista, W. Lenhart, and G. Liotta. Proximinity drawability: A survey. In R. Tamassia and I. Tollis, editors, DIMACS International Workshop, Graph Drawing 94, volume 894 of Lecture Notes in Computer Science, pages 328\u2013339. Springer-Verlag, 1995."},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10:41\u201351, 1990.","journal-title":"Combinatorica"},{"issue":"2","key":"37_CR7","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0031-3203(85)90040-8","volume":"18","author":"M. Ichino","year":"1985","unstructured":"M. Ichino and J. Sklansky. The relative neighborhood graph for mixed feature variables. Pattern Recognition, 18(2):161\u2013167, 1985.","journal-title":"Pattern Recognition"},{"issue":"1","key":"37_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0925-7721(97)00018-7","volume":"10","author":"G. Liotta","year":"1998","unstructured":"G. Liotta, A. Lubiw, H. Meijer, and S. Whitesides. The Rectangle of Influence drawability problem. Computational Geometry: Theory and Applications, 10(1):1\u201322, 1998.","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"3","key":"37_CR9","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1016\/0196-6774(88)90028-4","volume":"9","author":"M.H. Overmars","year":"1988","unstructured":"M.H. Overmars and D. Wood. On rectangular visibility. Journal of Algorithms, 9(3):372\u2013390, 1988.","journal-title":"Journal of Algorithms"},{"key":"37_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F. Preparata","year":"1985","unstructured":"F. Preparata and M. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46648-7_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T13:13:46Z","timestamp":1585919626000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46648-7_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540669043","9783540466482"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-46648-7_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"3 March 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}