{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:36:09Z","timestamp":1742394969492},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540314257"},{"type":"electronic","value":"9783540316671"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11618058_47","type":"book-chapter","created":{"date-parts":[[2006,1,20]],"date-time":"2006-01-20T09:56:50Z","timestamp":1137751010000},"page":"508-511","source":"Crossref","is-referenced-by-count":1,"title":["A New Method for Efficiently Generating Planar Graph Visibility Representations"],"prefix":"10.1007","author":[{"given":"John M.","family":"Boyer","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"47_CR1","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ\u2013tree algorithms. Journal of Computer and Systems Sciences\u00a013, 335\u2013379 (1976)","journal-title":"Journal of Computer and Systems Sciences"},{"issue":"3","key":"47_CR2","doi-asserted-by":"crossref","first-page":"241","DOI":"10.7155\/jgaa.00091","volume":"8","author":"J. Boyer","year":"2004","unstructured":"Boyer, J., Myrvold, W.: On the cutting edge: Simplified O(n) planarity by edge addition. Journal of Graph Algorithms and Applications\u00a08(3), 241\u2013273 (2004)","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"3","key":"47_CR3","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1109\/31.1746","volume":"35","author":"R. Jayakumar","year":"1988","unstructured":"Jayakumar, R., Thulasiraman, K., Swamy, M.N.S.: Planar embedding: Linear-time algorithms for vertex placement and edge ordering. IEEE Transactions on Circuits and Systems\u00a035(3), 334\u2013344 (1988)","journal-title":"IEEE Transactions on Circuits and Systems"},{"issue":"4","key":"47_CR4","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF02187706","volume":"1","author":"P. Rosenstiehl","year":"1986","unstructured":"Rosenstiehl, P., Tarjan, R.: Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete and Computational Geometry\u00a01(4), 343\u2013353 (1986)","journal-title":"Discrete and Computational Geometry"},{"issue":"4","key":"47_CR5","doi-asserted-by":"crossref","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(4), 321\u2013341 (1986)","journal-title":"Discrete and Computational Geometry"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11618058_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:12:22Z","timestamp":1619507542000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11618058_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540314257","9783540316671"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/11618058_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}