{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:07:56Z","timestamp":1725455276241},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540605737"},{"type":"electronic","value":"9783540477662"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0015441","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:50:06Z","timestamp":1131864606000},"page":"352-361","source":"Crossref","is-referenced-by-count":5,"title":["A linear time algorithm for finding maximal planar subgraphs"],"prefix":"10.1007","author":[{"given":"Wen-Lian","family":"Hsu","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"40_CR1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K. S. Booth","year":"1976","unstructured":"K. S. Booth and G. S. Lueker, Testing the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, J. Comput. Syst. Sci. 13(1976), 335\u2013379.","journal-title":"J. Comput. Syst. Sci."},{"key":"40_CR2","doi-asserted-by":"crossref","first-page":"1142","DOI":"10.1137\/0222068","volume":"22","author":"J. Cai","year":"1994","unstructured":"J. Cai, X. Han and R. T. Tarjan, An O(mlogn)-time algorithm for the maximal planar subgraph problem, SIAM J. Comput. 22(1994), 1142\u20131162.","journal-title":"SIAM J. Comput."},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"G. Di Battista and R. Tamassia [1989], Incremental planarity testing, in Proc. 30th Annual IEEE Symposium on Foundation of Computer Science, 436\u2013411.","DOI":"10.1109\/SFCS.1989.63515"},{"key":"40_CR4","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. E. Hopcroft","year":"1994","unstructured":"J. E. Hopcroft and R. E. Tarjan, Efficient planarity testing, J. Assoc. Comput. Mach. 21(1994), 549\u2013568.","journal-title":"J. Assoc. Comput. Mach."},{"key":"40_CR5","unstructured":"W. K. Shih and W. L. Hsu, A simple test for planar graphs, 1993, submitted."},{"key":"40_CR6","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/43.21845","volume":"8","author":"R. Jakayumar","year":"1989","unstructured":"R. Jakayumar, K. Thulasiraman and M. N. S. Swamy, An O(n 2) algorithms for graph planarization, IEEE Trans. CAD 8(1989), 257\u2013267.","journal-title":"IEEE Trans. CAD"},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"J. A. La Poute, Alpha-Algorithms for incremental planarity testing, STOC 1994, 706\u2013715.","DOI":"10.1145\/195058.195439"},{"key":"40_CR8","first-page":"215","volume-title":"Theory of Graphs","author":"A. Lempel","year":"1967","unstructured":"A. Lempel, S. Even and I. Cederbaum, An algorithm for planarity testing of graphs, Theory of Graphs, ed., P. Rosenstiehl, Gordon and Breach, New York, 1967, 215\u2013232."},{"key":"40_CR9","first-page":"290","volume":"5","author":"W. Wu","year":"1985","unstructured":"W. Wu, On the planar imbedding of linear graphs, J. Systems Sci. Math. Sci. 5, 290\u2013302, 1985.","journal-title":"J. Systems Sci. Math. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0015441","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T20:49:30Z","timestamp":1586551770000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0015441"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540605737","9783540477662"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0015441","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}