{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:55Z","timestamp":1759638295791},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319087825"},{"type":"electronic","value":"9783319087832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08783-2_41","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T14:04:30Z","timestamp":1404569070000},"page":"477-488","source":"Crossref","is-referenced-by-count":5,"title":["Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs"],"prefix":"10.1007","author":[{"given":"Seok-Hee","family":"Hong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Nagamochi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-642-36763-2_8","volume-title":"Graph Drawing","author":"P. Angelini","year":"2013","unstructured":"Angelini, P., Di Bartolomeo, M., Di Battista, G.: Implementing a partitioned 2-page book embedding testing algorithm. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol.\u00a07704, pp. 79\u201389. Springer, Heidelberg (2013)"},{"key":"41_CR2","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.jda.2011.12.015","volume":"14","author":"P. Angelini","year":"2012","unstructured":"Angelini, P., Di Battista, G., Frati, F., Patrignani, M., Rutter, I.: Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph. J. Discrete Algorithms\u00a014, 150\u2013172 (2012)","journal-title":"J. Discrete Algorithms"},{"issue":"3","key":"41_CR3","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/0095-8956(79)90021-2","volume":"27","author":"F. Bernhart","year":"1979","unstructured":"Bernhart, F., Kainen, P.C.: The book thickness of a graph. J. Combin. Theory Ser. B\u00a027(3), 320\u2013331 (1979)","journal-title":"J. Combin. Theory Ser. B"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"Biedl, T.: Drawing planar partitions III: Two constrained embedding problems, Technical Report RRR 12-98, RUTCOR, Rutgers University (1998)","DOI":"10.1145\/276884.276917"},{"key":"41_CR5","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/BF01961541","volume":"15","author":"G. Battista Di","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line maintenance of triconnected components with SPQR-trees. Algorithmica\u00a015, 302\u2013318 (1996)","journal-title":"Algorithmica"},{"key":"41_CR6","unstructured":"Hong, S., Nagamochi, H.: Two-page book embedding and clustered graph planarity, TR[2009-004], Dept. of Applied Mathematics and Physics, University of Kyoto (2009)"},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"Hong, S., Nagamochi, H.: Simpler testing for two page book embedding of partitioned graphs, TR[2013-001], Dept. of Applied Mathematics and Physics, University of Kyoto (2013)","DOI":"10.1007\/978-3-319-08783-2_41"},{"key":"41_CR8","unstructured":"Wigderson, A.: The complexity of the Hamiltonian circuit problem for maximal planar graphs, Technical Report 298, EECS Department, Princeton University (1982)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08783-2_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T12:54:04Z","timestamp":1565614444000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08783-2_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319087825","9783319087832"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08783-2_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}