{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:54:07Z","timestamp":1725558847201},"publisher-location":"Berlin, Heidelberg","reference-count":12,"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_10","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T20:54:14Z","timestamp":1278363254000},"page":"82-88","source":"Crossref","is-referenced-by-count":0,"title":["Additional PC-Tree Planarity Conditions"],"prefix":"10.1007","author":[{"given":"John M.","family":"Boyer","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. Hopcroft","year":"1974","unstructured":"Hopcroft, J., Tarjan, R.: Efficient planarity testing. Journal of the Association for Computing Machinery\u00a021, 549\u2013568 (1974)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10_CR2","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"},{"unstructured":"Boyer, J., Myrvold, W.: Stop minding your P\u2019s and Q\u2019s: A simplified O(n) planar embedding algorithm. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 140\u2013146 (1999)","key":"10_CR3"},{"doi-asserted-by":"crossref","unstructured":"Boyer, J., Myrvold, W.: On the cutting edge: Simplified O(n) planarity by edge addition. Accepted to Journal of Graph Algorithms and Applications, 1\u201329 (August 2004) Preprint at http:\/\/www.pacificcoast.net\/~lightning\/planarity.ps","key":"10_CR4","DOI":"10.7155\/jgaa.00091"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0304-3975(98)00120-0","volume":"223","author":"W.K. Shih","year":"1999","unstructured":"Shih, W.K., Hsu, W.L.: A new planarity test. Theoretical Computer Science\u00a0223, 179\u2013191 (1999)","journal-title":"Theoretical Computer Science"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.2001.1205","volume":"42","author":"W.L. Hsu","year":"2002","unstructured":"Hsu, W.L.: A simple test for the consecutive ones property. Journal of Algorithms\u00a042, 1\u201316 (2002)","journal-title":"Journal of Algorithms"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0304-3975(02)00435-8","volume":"296","author":"W.L. Hsu","year":"2003","unstructured":"Hsu, W.L., McConnell, R.: PC-trees and circular-ones arrangements. Theoretical Computer Science\u00a0296, 59\u201374 (2003)","journal-title":"Theoretical Computer Science"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-44679-6_23","volume-title":"Computing and Combinatorics","author":"W.-L. Hsu","year":"2001","unstructured":"Hsu, W.-L.: PC-trees vs. PQ-trees. In: Wang, J. (ed.) COCOON 2001. LNCS, vol.\u00a02108, pp. 207\u2013217. Springer, Heidelberg (2001)"},{"unstructured":"Hsu, W.L., McConnell, R.: PC-trees. In: Mehta, D.P., Sahni, S, (eds.) submitted to Handbook of Data Structures and Applications (2004)","key":"10_CR9"},{"unstructured":"Hsu, W.L.: An efficient implementation of the PC-trees algorithm of shih and hsu\u2019s planarity test. Technical Report TR-IIS-03-015, Institute of Information Science, Academia Sinica (2003)","key":"10_CR10"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-540-24595-7_3","volume-title":"Graph Drawing","author":"J.M. Boyer","year":"2004","unstructured":"Boyer, J.M., Cortese, P.F., Patrignani, M., Di Battista, G.: Stop minding your P\u2019s and Q\u2019s: Implementing a fast and simple DFS-based planarity testing and embedding algorithm. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 25\u201336. Springer, Heidelberg (2004)"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF02579375","volume":"5","author":"H. Fraysseix de","year":"1985","unstructured":"de Fraysseix, H., Rosenstiehl, P.: A characterization of planar graphs by tr\u00e9maux orders. Combinatorica\u00a05, 127\u2013135 (1985)","journal-title":"Combinatorica"}],"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_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:28:12Z","timestamp":1605760092000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31843-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245285","9783540318439"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31843-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}