乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:36:44Z","timestamp":1725467804122},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642367625"},{"type":"electronic","value":"9783642367632"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36763-2_8","type":"book-chapter","created":{"date-parts":[[2013,2,14]],"date-time":"2013-02-14T03:17:33Z","timestamp":1360811853000},"page":"79-89","source":"Crossref","is-referenced-by-count":6,"title":["Implementing a Partitioned 2-Page Book Embedding Testing Algorithm"],"prefix":"10.1007","author":[{"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[]},{"given":"Marco","family":"Di Bartolomeo","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Di Battista","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Angelini, P., Di Bartolomeo, M., Di Battista, G.: Implementing a partitioned 2-page book embedding testing algorithm. CoRR, arXiv:1209.0598v1 (2012)","DOI":"10.1007\/978-3-642-36763-2_8"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Biedl, T.: Drawing planar partitions III: Two Constrained Embedding Problems. Tech. Report RRR 13-98, Rutcor Research Report (1998)","DOI":"10.1145\/276884.276917"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/10692760_11","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"T.C. Biedl","year":"1998","unstructured":"Biedl, T.C., Kaufmann, M., Mutzel, P.: Drawing Planar Partitions II: HH-Drawings. In: Hromkovi\u010d, J., S\u00fdkora, O. (eds.) WG 1998. LNCS, vol.\u00a01517, pp. 124\u2013136. Springer, Heidelberg (1998)"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Buss, J.F., Shor, P.W.: On the pagenumber of planar graphs. In: STOC 1984, pp. 98\u2013100. ACM (1984)","DOI":"10.1145\/800057.808670"},{"key":"8_CR5","unstructured":"Chimani, M., Gutwenger, C., J\u00fcnger, M., Klau, G., Klein, K., Mutzel, P.: Handbook of Graph Drawing and Visualization: The Open Graph Drawing Framework. CRC-Press (2012)"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Cortese, P.F., Di Battista, G.: Clustered planarity. In: SoCG 2005, pp. 32\u201334 (2005)","DOI":"10.1145\/1064092.1064093"},{"key":"8_CR7","unstructured":"Di Battista, G., Didimo, W.: Handbook of Graph Drawing and Visualization: GDToolkit. CRC-Press (2012)"},{"issue":"4","key":"8_CR8","doi-asserted-by":"crossref","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(4), 302\u2013318 (1996)","journal-title":"Algorithmica"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G. Battista Di","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. Comput.\u00a025, 956\u2013997 (1996)","journal-title":"SIAM J. Comput."},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-60313-1_145","volume-title":"Algorithms - ESA \u201995","author":"Q.W. Feng","year":"1995","unstructured":"Feng, Q.W., Cohen, R.F., Eades, P.: Planarity for Clustered Graphs. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol.\u00a0979, pp. 213\u2013226. Springer, Heidelberg (1995)"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/978-3-642-25878-7_37","volume-title":"GD 2011","author":"F. Frati","year":"2012","unstructured":"Frati, F., Fulek, R., Ruiz-Vargas, A.J.: On the Page Number of Upward Planar Directed Acyclic Graphs. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol.\u00a07034, pp. 391\u2013402. Springer, Heidelberg (2012)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-44541-2_8","volume-title":"Graph Drawing","author":"C. Gutwenger","year":"2001","unstructured":"Gutwenger, C., Mutzel, P.: A Linear Time Implementation of SPQR-Trees. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 77\u201390. Springer, Heidelberg (2001)"},{"key":"8_CR13","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, Japan (2009)"},{"key":"8_CR14","unstructured":"Ollmann, L.T.: On the book thicknesses of various graphs. Cong. Num, vol.\u00a0VIII, p. 459 (1973)"},{"issue":"2","key":"8_CR15","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/S0196-6774(02)00249-3","volume":"45","author":"D.R. Wood","year":"2002","unstructured":"Wood, D.R.: Degree constrained book embeddings. J. of Algorithms\u00a045(2), 144\u2013154 (2002)","journal-title":"J. of Algorithms"},{"issue":"1","key":"8_CR16","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/0022-0000(89)90032-9","volume":"38","author":"M. Yannakakis","year":"1989","unstructured":"Yannakakis, M.: Embedding planar graphs in four pages. JCSS\u00a038(1), 36\u201367 (1989)","journal-title":"JCSS"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36763-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T06:58:44Z","timestamp":1557557924000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36763-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642367625","9783642367632"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36763-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}