{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:23:44Z","timestamp":1725524624028},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002182"},{"type":"electronic","value":"9783642002199"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00219-9_8","type":"book-chapter","created":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T13:03:51Z","timestamp":1233752631000},"page":"67-77","source":"Crossref","is-referenced-by-count":1,"title":["Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights"],"prefix":"10.1007","author":[{"given":"Chieh-Yu","family":"Chen","sequence":"first","affiliation":[]},{"given":"Ya-Fei","family":"Hung","sequence":"additional","affiliation":[]},{"given":"Hsueh-I","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"8_CR1","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0304-3975(76)90086-4","volume":"2","author":"S. Even","year":"1976","unstructured":"Even, S., Tarjan, R.E.: Computing an st-numbering. Theoretical Computer Science\u00a02(3), 339\u2013344 (1976)","journal-title":"Theoretical Computer Science"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-540-77120-3_16","volume-title":"Algorithms and Computation","author":"J.H. Fan","year":"2007","unstructured":"Fan, J.H., Lin, C.C., Lu, H.I., Yen, H.C.: Width-optimal visibility representations of plane graphs. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol.\u00a04835, pp. 160\u2013171. Springer, Heidelberg (2007)"},{"issue":"3","key":"8_CR3","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1137\/S0895480197325031","volume":"12","author":"X. He","year":"1999","unstructured":"He, X., Kao, M.Y., Lu, H.I.: Linear-time succinct encodings of planar graphs via canonical orderings. SIAM Journal on Discrete Mathematics\u00a012(3), 317\u2013325 (1999)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"3","key":"8_CR4","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1142\/S0218195997000132","volume":"7","author":"G. Kant","year":"1997","unstructured":"Kant, G.: A more compact visibility representation. International Journal Computational Geometry and Applications\u00a07(3), 197\u2013210 (1997)","journal-title":"International Journal Computational Geometry and Applications"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0304-3975(95)00257-X","volume":"172","author":"G. Kant","year":"1997","unstructured":"Kant, G., He, X.: Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theoretical Computer Science\u00a0172, 175\u2013193 (1997)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1137\/S0895480103420744","volume":"18","author":"C.C. Lin","year":"2004","unstructured":"Lin, C.C., Lu, H.I., Sun, I.F.: Improved compact visibility representation of planar graph via Schnyder\u2019s realizer. SIAM Journal on Discrete Mathematics\u00a018(1), 19\u201329 (2004)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"8_CR7","unstructured":"Otten, R.H.J.M., van Wijk, J.G.: Graph representations in interactive layout design. In: Proceedings of the IEEE International Symposium on Circuits and Systems, pp. 914\u2013918 (1978)"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF02187706","volume":"1","author":"P. Rosenstiehl","year":"1986","unstructured":"Rosenstiehl, P., Tarjan, R.E.: Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete and Computational Geometry\u00a01, 343\u2013353 (1986)","journal-title":"Discrete and Computational Geometry"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R. Tamassia","year":"1986","unstructured":"Tamassia, R., Tollis, I.G.: A unified approach to visibility representations of planar graphs. Discrete and Computational Geometry\u00a01, 321\u2013341 (1986)","journal-title":"Discrete and Computational Geometry"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/978-3-540-45078-8_43","volume-title":"Algorithms and Data Structures","author":"H. Zhang","year":"2003","unstructured":"Zhang, H., He, X.: Compact visibility representation and straight-line grid embedding of plane graphs. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 493\u2013504. Springer, Heidelberg (2003)"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-540-24749-4_42","volume-title":"STACS 2004","author":"H. Zhang","year":"2004","unstructured":"Zhang, H., He, X.: On visibility representation of plane graphs. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 477\u2013488. Springer, Heidelberg (2004)"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00454-004-1154-y","volume":"33","author":"H. Zhang","year":"2005","unstructured":"Zhang, H., He, X.: Canonical ordering trees and their applications in graph drawing. Discrete and Computational Geometry\u00a033, 321\u2013344 (2005)","journal-title":"Discrete and Computational Geometry"},{"issue":"1","key":"8_CR13","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.comgeo.2004.08.002","volume":"30","author":"H. Zhang","year":"2005","unstructured":"Zhang, H., He, X.: Improved visibility representation of plane graphs. Computational Geometry\u00a030(1), 29\u201339 (2005)","journal-title":"Computational Geometry"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-540-31843-9_43","volume-title":"Graph Drawing","author":"H. Zhang","year":"2005","unstructured":"Zhang, H., He, X.: New theoretical bounds of visibility representation of plane graphs. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 425\u2013430. Springer, Heidelberg (2005)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/11786986_36","volume-title":"Automata, Languages and Programming","author":"H. Zhang","year":"2006","unstructured":"Zhang, H., He, X.: Nearly optimal visibility representations of plane graphs. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 407\u2013418. Springer, Heidelberg (2006)"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-540-72870-2_28","volume-title":"Algorithmic Aspects in Information and Management","author":"H. Zhang","year":"2007","unstructured":"Zhang, H., He, X.: Optimal st-orientations for plane triangulations. In: Kao, M.-Y., Li, X.-Y. (eds.) AAIM 2007. LNCS, vol.\u00a04508, pp. 296\u2013305. Springer, Heidelberg (2007)"},{"issue":"4","key":"8_CR17","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/060651811","volume":"22","author":"H. Zhang","year":"2008","unstructured":"Zhang, H., He, X.: Nearly optimal visibility representations of plane triangulations. SIAM Journal on Discrete Mathematics\u00a022(4), 1364\u20131380 (2008)","journal-title":"SIAM Journal on Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00219-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T05:14:31Z","timestamp":1551762871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00219-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002182","9783642002199"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00219-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}