{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:34:45Z","timestamp":1766378085070},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540624950"},{"type":"electronic","value":"9783540680482"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62495-3_34","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:38:45Z","timestamp":1330277925000},"page":"11-24","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Series-parallel planar ordered sets have pagenumber two"],"prefix":"10.1007","author":[{"given":"Mohammad","family":"Alzohairi","sequence":"first","affiliation":[]},{"given":"Ivan","family":"Rival","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/0095-8956(79)90021-2","volume":"B 27","author":"F. Bernhart","year":"1979","unstructured":"F. Bernhart and P. C. Kainen (1979) The book thickness of a graph, Journal of Combinatorial Theory, Series B 27, 320\u2013331.","journal-title":"Journal of Combinatorial Theory, Series"},{"key":"2_CR2","volume-title":"Lattice Theory","author":"G. Birkhoff","year":"1967","unstructured":"G. Birkhoff (1967) Lattice Theory, American Mathematical Society, Providence, Rhode Island."},{"key":"2_CR3","first-page":"291","volume":"35","author":"L. T. Q. Hung","year":"1993","unstructured":"L. T. Q. Hung (1993) A Planar Poset which Requires four Pages, Ars Combin 35, 291\u2013302","journal-title":"Ars Combin"},{"key":"2_CR4","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/BF02574056","volume":"13","author":"H. Fraysseix de","year":"1995","unstructured":"H. de Fraysseix, P. O. de Mendez and J. Pach (1995) A Left Search Algorithm for Planar Graphs, Discrete Comput. Geom. 13, 459\u2013468.","journal-title":"Discrete Comput. Geom."},{"key":"2_CR5","doi-asserted-by":"crossref","first-page":"636","DOI":"10.4153\/CJM-1975-074-0","volume":"27","author":"D. Kelly","year":"1975","unstructured":"D. Kelly and I. Rival (1975) Planar lattices, Canad. Journal of Mathematics 27, 636\u2013665.","journal-title":"Canad. Journal of Mathematics"},{"key":"2_CR6","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1090\/S0002-9947-1937-1501929-X","volume":"42","author":"H. M. MacNeille","year":"1937","unstructured":"H. M. MacNeille (1937) Partially ordered sets, Trans. Amer. Math. Soc. 42, 416\u2013460.","journal-title":"Trans. Amer. Math. Soc."},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF00563521","volume":"6","author":"R. Nowakowski","year":"1989","unstructured":"R. Nowakowski and A. Parker (1989), Ordered sets, pagenumbers and planarity, Order 6, 209\u2013218.","journal-title":"Order"},{"key":"2_CR8","volume-title":"Ph.D. thesis","author":"S. V. Pemmaraju","year":"1992","unstructured":"S. V. Pemmaraju (1992) Exploring the Powers of Stacks and Queues via Graph Layouts, Ph.D. thesis, Virginia Polytechnic Institute and State University at Blacksburg, Virginia."},{"key":"2_CR9","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/3-540-52292-1_13","volume-title":"Graph-theoretic concepts in computer science (Kerkrade, 1989)","author":"M. M. Sys\u0142o","year":"1990","unstructured":"M. M. Sys\u0142o (1990) Bounds to the Page Number of Partially Ordered Sets, Graph-theoretic concepts in computer science (Kerkrade, 1989), 181\u2013195, Lecture Notes in Comput. Sci. 411. Springer, Berlin."},{"key":"2_CR10","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. L. Lawler (1982) The recognition of seriesparallel digraphs, SIAM J. Computing 11, 298\u2013314.","journal-title":"SIAM J. Computing"},{"key":"2_CR11","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 (1989) Embedding planar graphs in four pages, J. Comput. System Sci. 38, 36\u201367","journal-title":"J. Comput. System Sci."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62495-3_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:21:16Z","timestamp":1578518476000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62495-3_34"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540624950","9783540680482"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-62495-3_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"7 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}