{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:47:06Z","timestamp":1725472026620},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540359043"},{"type":"electronic","value":"9783540359050"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11786986_36","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T10:46:45Z","timestamp":1151491605000},"page":"407-418","source":"Crossref","is-referenced-by-count":5,"title":["Nearly Optimal Visibility Representations of Plane Graphs"],"prefix":"10.1007","author":[{"given":"Xin","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaming","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/3-540-36494-3_44","volume-title":"STACS 2003","author":"N. Bonichon","year":"2003","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N.: An information-theoretic upper bound of planar graphs using triangulation. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 499\u2013510. Springer, Heidelberg (2003)"},{"key":"36_CR2","first-page":"506","volume-title":"Proc. of the 12th Annual ACM-SIAM SODA","author":"Y.-T. Chiang","year":"2001","unstructured":"Chiang, Y.-T., Lin, C.-C., Lu, H.-I.: Orderly spanning trees with applications to graph encoding and graph drawing. In: Proc. of the 12th Annual ACM-SIAM SODA, pp. 506\u2013515. ACM Press, New York (2001)"},{"issue":"4","key":"36_CR3","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/PL00009264","volume":"23","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Tamassia, R., Vismara, L.: Output-sensitive Reporting of Disjoint Paths. Algorithmica\u00a023(4), 302\u2013340 (1999)","journal-title":"Algorithmica"},{"unstructured":"Lempel, A., Even, S., Cederbaum, I.: An algorithm for planarity testing of graphs. In: Theory of Graphs (Proc. of an International Symposium, Rome,July 1966), Rome, pp. 215\u2013232 (1967)","key":"36_CR4"},{"unstructured":"de Mendez, P.O.: Orientations bipolaires. PhD thesis, Ecole des Hautes Etudes en Sciences Sociales, Paris (1994)","key":"36_CR5"},{"key":"36_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":"36_CR7","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/BF00353652","volume":"5","author":"W. Schnyder","year":"1989","unstructured":"Schnyder, W.: Planar graphs and poset dimension. Order\u00a05, 323\u2013343 (1989)","journal-title":"Order"},{"key":"36_CR8","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":"36_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.ipl.2005.05.024","volume":"96","author":"H. Zhang","year":"2005","unstructured":"Zhang, H., He, X.: Visibility Representation of Plane Graphs via Canonical Ordering Tree. Information Processing Letters\u00a096, 41\u201348 (2005)","journal-title":"Information Processing Letters"},{"key":"36_CR10","doi-asserted-by":"crossref","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: Theory and Applications\u00a030, 29\u201329 (2005)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"36_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/11618058_41","volume-title":"Graph Drawing","author":"H. Zhang","year":"2006","unstructured":"Zhang, H., He, X.: An Application of Well-Orderly Trees in Graph Drawing. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 458\u2013467. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11786986_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T23:32:10Z","timestamp":1558308730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11786986_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}