{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:54:32Z","timestamp":1725558872310},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245285"},{"type":"electronic","value":"9783540318439"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31843-9_43","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T16:54:14Z","timestamp":1278348854000},"page":"425-430","source":"Crossref","is-referenced-by-count":2,"title":["New Theoretical Bounds of Visibility Representation of Plane Graphs"],"prefix":"10.1007","author":[{"given":"Huaming","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Xin","family":"He","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"publisher","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\u00a010, 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"43_CR2","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 of Computational Geometry and Applications\u00a07, 197\u2013210 (1997)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"43_CR3","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"},{"key":"43_CR4","unstructured":"Lempel, A., Even, S., Cederbaum, I.: An algorithm for planarity testing of graphs. In: Theory of Graphs, Rome, pp. 215\u2013232 (1967)"},{"key":"43_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/3-540-36494-3_3","volume-title":"STACS 2003","author":"C.-C. Lin","year":"2003","unstructured":"Lin, C.-C., Lu, H.-I., Sun, I.-F.: Improved compact visibility representation of planar graph via Schnyder\u2019s realizer. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 14\u201325. Springer, Heidelberg (2003)"},{"key":"43_CR6","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 Comput. Geom.\u00a01, 343\u2013353 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"43_CR7","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R. Tamassia","year":"1986","unstructured":"Tamassia, R., Tollis, I.G.: An unified approach to visibility representations of planar graphs. Discrete Comput. Geom.\u00a01, 321\u2013341 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"43_CR8","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":"43_CR9","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)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31843-9_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:42:02Z","timestamp":1619998922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31843-9_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245285","9783540318439"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31843-9_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}