乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:13:10Z","timestamp":1725495190730},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001584"},{"type":"electronic","value":"9783540361510"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36151-0_16","type":"book-chapter","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T17:14:14Z","timestamp":1195233254000},"page":"162-173","source":"Crossref","is-referenced-by-count":1,"title":["Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs"],"prefix":"10.1007","author":[{"given":"Emilio","family":"Di Giacomo","sequence":"first","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Stephen K.","family":"Wismath","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"M. Alzohairi and I. Rival. Series-parallel ordered sets have pagenumber two. In S. North, editor, Graph Drawing (Proc. GD\u2019 96), volume 1190 of Lecture Notes Comput. Sci., pages 11\u201324. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-62495-3_34"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/0095-8956(79)90021-2","volume":"27","author":"F. Bernhart","year":"1979","unstructured":"F. Bernhart and P. C. Kainen. The book thickness of a graph. J. Combin. Theory, Ser. B 27:320\u2013331, 1979.","journal-title":"J. Combin. Theory"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"P. Bose. On embedding an outer-planar graph on a point set. In G. Di Battista, editor, Graph Drawing (Proc. GD\u2019 97), volume 1353 of Lecture Notes Comput. Sci., pages 25\u201336. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63938-1_47"},{"issue":"1","key":"16_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00002","volume":"2","author":"P. Bose","year":"1997","unstructured":"P. Bose, M. McAllister, and J. Snoeyink. Optimal algorithms to embed trees in a point set. Journal of Graph Algorithms and Applications, 2(1):1\u201315, 1997.","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/0608002","volume":"8","author":"F. R. K. Chung","year":"1987","unstructured":"F. R. K. Chung, F. T. Leighton, and A. Rosenberg. Embedding graphs in books: A layout problem with applications to VLSI design. SIAM Journal on Algebraic and Discrete Methods, 8:33\u201358, 1987.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"16_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46648-7_31","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999."},{"issue":"5","key":"16_CR7","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G. Battista Di","year":"1996","unstructured":"G. Di Battista and R. Tamassia. On-line planarity testing. SIAM Journal on Computing, 25(5):956\u2013997, October 1996.","journal-title":"SIAM Journal on Computing"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0304-3975(76)90086-4","volume":"2","author":"S. Even","year":"1976","unstructured":"S. Even and R. E. Tarjan. Computing an st-numbering. Theoret. Comput. Sci., 2:339\u2013344, 1976.","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0166-218X(00)00178-5","volume":"109","author":"J. Ganley","year":"2001","unstructured":"J. Ganley and L. Heath. The pagenumber of k-trees is O(k). Discrete Applied Mathematics, 109:215\u2013221, 2001.","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"16_CR10","doi-asserted-by":"publisher","first-page":"165","DOI":"10.2307\/2323956","volume":"98","author":"P. Gritzmann","year":"1991","unstructured":"P. Gritzmann, B. Mohar, J. Pach, and R. Pollack. Embedding a planar triangulation with vertices at specified poi nts. Amer. Math. Monthly, 98(2):165\u2013166, 1991.","journal-title":"Amer. Math. Monthly"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1137\/S0895480193252380","volume":"10","author":"L. S. Heath","year":"1997","unstructured":"L. S. Heath and S. V. Pemmaraju. Stack and queue layouts of posets. SIAM Journal on Discrete Mathematics, 10:599\u2013625, 1997.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"1588","DOI":"10.1137\/S0097539795291550","volume":"28","author":"L. S. Heath","year":"1999","unstructured":"L. S. Heath and S. V. Pemmaraju. Stack and queue layouts of directed acyclic graphs: Part II. SIAM Journal on Computing, 28:1588\u20131626, 1999.","journal-title":"SIAM Journal on Computing"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1137\/S0097539795280287","volume":"28","author":"L. S. Heath","year":"1999","unstructured":"L. S. Heath, S. V. Pemmaraju, and A. Trenk. Stack and queue layouts of directed acyclic graphs: Part I. SIAM Journal on Computing, 28:1510\u20131539, 1999.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"16_CR14","doi-asserted-by":"crossref","first-page":"115","DOI":"10.7155\/jgaa.00046","volume":"6","author":"M. Kaufmann","year":"2002","unstructured":"M. Kaufmann and R. Wiese. Embedding vertices at points: Few bends suffice for planar graphs. Journal of Graph Algorithms and Applications, 6(1):115\u2013129, 2002.","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF00563521","volume":"6","author":"R. Nowakowski","year":"1989","unstructured":"R. Nowakowski and A. Parker. Ordered sets, pagenumbers and planarity. Order, 6:209\u2013218, 1989.","journal-title":"Order"},{"issue":"2","key":"16_CR16","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J. Valdes","year":"1982","unstructured":"J. Valdes, R. E. Tarjan, and E. Lawler. The recognition of series-parallel digraphs. SIAM J. Comput., 11(2):298\u2013313, 1982.","journal-title":"SIAM J. Comput."},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/0022-0000(89)90032-9","volume":"38","author":"M. Yannakakis","year":"1989","unstructured":"M. Yannakakis. Embedding planar graphs in four pages. Journal of Computer and System Sciences, 38:36\u201367, 1989.","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36151-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T15:32:01Z","timestamp":1556983921000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36151-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001584","9783540361510"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-36151-0_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}