{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:36Z","timestamp":1740122436027,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,9,20]],"date-time":"2023-09-20T00:00:00Z","timestamp":1695168000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,20]],"date-time":"2023-09-20T00:00:00Z","timestamp":1695168000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s10878-023-01084-9","type":"journal-article","created":{"date-parts":[[2023,9,20]],"date-time":"2023-09-20T19:01:56Z","timestamp":1695236516000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Area, perimeter, height, and width of rectangle visibility graphs"],"prefix":"10.1007","volume":"46","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2692-9198","authenticated-orcid":false,"given":"John S.","family":"Caughman","sequence":"first","affiliation":[]},{"given":"Charles L.","family":"Dunn","sequence":"additional","affiliation":[]},{"given":"Joshua D.","family":"Laison","sequence":"additional","affiliation":[]},{"given":"Nancy Ann","family":"Neudauer","sequence":"additional","affiliation":[]},{"given":"Colin L.","family":"Starr","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,20]]},"reference":[{"key":"1084_CR1","doi-asserted-by":"crossref","unstructured":"Angelini P, Bekos MA, Kaufmann M, Montecchiani F (2018) 3D visibility representations of 1-planar graphs. In: Graph drawing and network visualization, volume 10692 of Lecture notes in computer science. Springer, Cham, pp 102\u2013109","DOI":"10.1007\/978-3-319-73915-1_9"},{"key":"1084_CR2","unstructured":"Biedl T, Liotta G, Montecchiani F (2016) On visibility representations on non-planar graphs. In: 32nd International symposium on computational geometry, volume\u00a051 of LIPIcs. Leibniz international proceedings in informatics. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, p 16"},{"key":"1084_CR3","doi-asserted-by":"crossref","unstructured":"Bose P, Dean A, Hutchinson J, Shermer T (1996) On rectangle visibility graphs. In: International symposium on graph drawing. Springer, pp 25\u201344","DOI":"10.1007\/3-540-62495-3_35"},{"issue":"3","key":"1084_CR4","doi-asserted-by":"publisher","first-page":"16","DOI":"10.7155\/jgaa.00006","volume":"2","author":"P Bose","year":"1998","unstructured":"Bose P, Everett H, Fekete SP, Houle ME, Lubiw A, Meijer H, Romanik K, Rote G, Shermer TC, Whitesides S, Zelle C (1998) A visibility representation for graphs in three dimensions. J Graph Algorithms Appl 2(3):16","journal-title":"J Graph Algorithms Appl"},{"key":"1084_CR5","first-page":"24","volume":"24","author":"I Cahit","year":"1998","unstructured":"Cahit I (1998) On $$2$$-visibility drawings of non-planar graphs. Bull Inst Combin Appl 24:24\u201326","journal-title":"Bull Inst Combin Appl"},{"key":"1084_CR6","unstructured":"Caughman J, Dunn C, Laison J, Neudauer N, Starr C (2014) Minimum representations of rectangle visibility graphs. In: Duncan C, Symvonis A (eds) Graph drawing: 22nd international symposium, GD 2014, volume 8871 of lecture notes in computer science. Springer, Heidelberg, pp 527\u2013528"},{"key":"1084_CR7","unstructured":"Caughman J, Dunn C, Laison J, Neudauer N, Starr C (2022) Connected 6-vertex RVGs. http:\/\/web.pdx.edu\/~caughman\/6-Vertex-Chart.pdf. Accessed 27 July 2022"},{"key":"1084_CR8","doi-asserted-by":"crossref","unstructured":"Dean AM, Hutchinson JP (1995) Rectangle-visibility representations of bipartite graphs. In: Graph drawing (Princeton, NJ, 1994), of Lecture notes in computer science, vol 894. Springer, Berlin, pp 159\u2013166","DOI":"10.1007\/3-540-58950-3_367"},{"issue":"1","key":"1084_CR9","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/S0166-218X(96)00029-7","volume":"75","author":"AM Dean","year":"1997","unstructured":"Dean AM, Hutchinson JP (1997) Rectangle-visibility representations of bipartite graphs. Discrete Appl Math 75(1):9\u201325","journal-title":"Discrete Appl Math"},{"issue":"8","key":"1084_CR10","doi-asserted-by":"publisher","first-page":"21","DOI":"10.7155\/jgaa.00011","volume":"2","author":"AM Dean","year":"1998","unstructured":"Dean AM, Hutchinson JP (1998) Rectangle-visibility layouts of unions and products of trees. J Graph Algorithms Appl 2(8):21","journal-title":"J Graph Algorithms Appl"},{"key":"1084_CR11","unstructured":"Dean AM, Hutchinson JP (2010) Representing 3-trees as unit rectangle-visibility graphs. In: Proceedings of the forty-first southeastern international conference on combinatorics, graph theory and computing, vol 203, pp 139\u2013160"},{"issue":"1","key":"1084_CR12","doi-asserted-by":"publisher","first-page":"79, 24","DOI":"10.37236\/803","volume":"15","author":"AM Dean","year":"2008","unstructured":"Dean AM, Ellis-Monaghan JA, Hamilton S, Pangborn G (2008) Unit rectangle visibility graphs. Electron J Combin 15(1):79, 24 (Research Paper)","journal-title":"Electron J Combin"},{"issue":"4","key":"1084_CR13","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/s00454-003-2773-4","volume":"29","author":"M Develin","year":"2003","unstructured":"Develin M, Hartke S, Moultons DP (2003) A general notion of visibility graph. Discrete Comput Geom 29(4):511\u2013524","journal-title":"Discrete Comput Geom"},{"issue":"8","key":"1084_CR14","doi-asserted-by":"publisher","first-page":"2345","DOI":"10.1007\/s00453-017-0324-2","volume":"80","author":"E Di Giacomo","year":"2018","unstructured":"Di Giacomo E, Didimo W, Evans WS, Liotta G, Meijer H, Montecchiani F, Wismath SK (2018) Ortho-polygon visibility representations of embedded graphs. Algorithmica 80(8):2345\u20132383","journal-title":"Algorithmica"},{"issue":"3","key":"1084_CR15","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0012-365X(83)90128-0","volume":"46","author":"P Duchet","year":"1983","unstructured":"Duchet P, Hamidoune Y, Las\u00a0Vergnas M, Meyniel H (1983) Representing a planar graph by vertical lines joining different levels. Discrete Math 46(3):319\u2013321","journal-title":"Discrete Math"},{"issue":"1","key":"1084_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0218195999000029","volume":"9","author":"SP Fekete","year":"1999","unstructured":"Fekete SP, Meijer H (1999) Rectangle and box visibility graphs in $$3$$D. Int J Comput Geom Appl 9(1):1\u201327","journal-title":"Int J Comput Geom Appl"},{"issue":"10","key":"1084_CR17","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1109\/TCS.1976.1084138","volume":"2","author":"MR Garey","year":"1976","unstructured":"Garey MR, Johnson DS, So HC (1976) An application of graph coloring to printed circuit testing. IEEE Trans Circuits Syst CAS 2(10):591\u2013599","journal-title":"IEEE Trans Circuits Syst CAS"},{"key":"1084_CR18","first-page":"55","volume":"50","author":"E Gethner","year":"2011","unstructured":"Gethner E, Laison JD (2011) More directions in visibility graphs. Australas J Combin 50:55\u201365","journal-title":"Australas J Combin"},{"issue":"4","key":"1084_CR19","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1080\/0025570X.1993.11996124","volume":"66","author":"JP Hutchinson","year":"1993","unstructured":"Hutchinson JP (1993) Coloring ordinary maps, maps of empires and maps of the moon. Math Mag 66(4):211\u2013226","journal-title":"Math Mag"},{"issue":"3","key":"1084_CR20","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0925-7721(99)00018-8","volume":"13","author":"JP Hutchinson","year":"1999","unstructured":"Hutchinson JP, Shermer T, Vince A (1999) On representations of some thickness-two graphs. Comput Geom 13(3):161\u2013171","journal-title":"Comput Geom"},{"issue":"2","key":"1084_CR21","doi-asserted-by":"publisher","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 IG (1997) Area requirement of visibility representations of trees. Inform Process Lett 62(2):81\u201388","journal-title":"Inform Process Lett"},{"key":"1084_CR22","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.tcs.2021.02.018","volume":"863","author":"G Liotta","year":"2021","unstructured":"Liotta G, Montecchiani F, Tappini A (2021) Ortho-polygon visibility representations of 3-connected 1-plane graphs. Theor Comput Sci 863:40\u201352","journal-title":"Theor Comput Sci"},{"key":"1084_CR23","unstructured":"Keith M (2021) All small connected graphs. Accessed 20 April 2021"},{"key":"1084_CR24","doi-asserted-by":"crossref","unstructured":"Streinu I, Whitesides S (2003) Rectangle visibility graphs: characterization, construction, and compaction. In: STACS 2003, volume 2607 of Lecture notes in computer science. Springer, Berlin, pp 26\u201337","DOI":"10.1007\/3-540-36494-3_4"},{"issue":"4","key":"1084_CR25","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R Tamassia","year":"1986","unstructured":"Tamassia R, Tollis IG (1986) A unified approach to visibility representations of planar graphs. Discrete Comput Geom 1(4):321\u2013341","journal-title":"Discrete Comput Geom"},{"key":"1084_CR26","doi-asserted-by":"crossref","unstructured":"Wismath SK (1985) Characterizing bar line-of-sight graphs. In: Proceedings of the first annual symposium on computational geometry, SCG \u201985. Association for Computing Machinery, New York, pp 147\u2013152","DOI":"10.1145\/323233.323253"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01084-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-023-01084-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01084-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T08:15:25Z","timestamp":1698221725000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-023-01084-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,20]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["1084"],"URL":"https:\/\/doi.org\/10.1007\/s10878-023-01084-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2023,9,20]]},"assertion":[{"value":"30 August 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"18"}}