乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T23:40:41Z","timestamp":1725838841578},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319272603"},{"type":"electronic","value":"9783319272610"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-27261-0_11","type":"book-chapter","created":{"date-parts":[[2015,11,26]],"date-time":"2015-11-26T06:24:59Z","timestamp":1448519099000},"page":"125-138","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["The Book Embedding Problem from a SAT-Solving Perspective"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Bekos","sequence":"first","affiliation":[]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Zielke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,27]]},"reference":[{"key":"11_CR1","unstructured":"Bekos, M., Gronemann, M., Raftopoulou, C.N.: Two-page book embeddings of 4-planar graphs. In: STACS, vol. 25, pp. 137\u2013148. LIPIcs, Schloss Dagstuhl (2014)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-662-48350-3_12","volume-title":"Algorithms - ESA 2015","author":"MA Bekos","year":"2015","unstructured":"Bekos, M.A., Bruckdorfer, T., Kaufmann, M., Raftopoulou, C.: 1-planar graphs have constant book thickness. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 130\u2013141. Springer, Heidelberg (2015)"},{"issue":"3","key":"11_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.: The book thickness of a graph. Comb. Theory 27(3), 320\u2013331 (1979)","journal-title":"Comb. Theory"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/978-3-319-03841-4_40","volume-title":"Graph Drawing","author":"T Biedl","year":"2013","unstructured":"Biedl, T., Bl\u00e4sius, T., Niedermann, B., N\u00f6llenburg, M., Prutkin, R., Rutter, I.: Using ILP\/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 460\u2013471. Springer, Heidelberg (2013)"},{"issue":"2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1049\/ip-e.1992.0021","volume":"139","author":"T Bilski","year":"1992","unstructured":"Bilski, T.: Embedding graphs in books: a survey. IEEE Proc. Comput. Digit. Tech. 139(2), 134\u2013138 (1992)","journal-title":"IEEE Proc. Comput. Digit. Tech."},{"key":"11_CR6","unstructured":"Blankenship, R.: Book embeddings of graphs. Ph.D. thesis, Louisiana State University (2003)"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1002\/mana.3211170125","volume":"117","author":"R Bodendiek","year":"1984","unstructured":"Bodendiek, R., Schumacher, H., Wagner, K.: \u00dcber 1-optimale graphen. Math. Nachr. 117(1), 323\u2013339 (1984)","journal-title":"Math. Nachr."},{"issue":"1\u20133","key":"11_CR8","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.disc.2005.10.005","volume":"305","author":"G Brinkmann","year":"2005","unstructured":"Brinkmann, G., Greenberg, S., Greenhill, C.S., McKay, B.D., Thomas, R., Wollan, P.: Generation of simple quadrangulations of the sphere. Discrete Math. 305(1\u20133), 33\u201354 (2005)","journal-title":"Discrete Math."},{"key":"11_CR9","unstructured":"Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the really hard problems are. In: Mylopoulos, J., Reiter, R. (eds.) AI, pp. 331\u2013340. Morgan Kaufmann (1991)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-642-36763-2_22","volume-title":"Graph Drawing","author":"M Chimani","year":"2013","unstructured":"Chimani, M., Zeranski, R.: Upward planarity testing via SAT. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 248\u2013259. Springer, Heidelberg (2013)"},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/0608002","volume":"8","author":"FRK Chung","year":"1987","unstructured":"Chung, F.R.K., Leighton, F.T., Rosenberg, A.L.: Embedding graphs in books: a layout problem with applications to VLSI design. SIAM J. Algebraic Discrete Method 8(1), 33\u201358 (1987)","journal-title":"SIAM J. Algebraic Discrete Method"},{"issue":"3","key":"11_CR12","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BF02591867","volume":"26","author":"G Cornu\u00e9jols","year":"1983","unstructured":"Cornu\u00e9jols, G., Naddef, D., Pulleyblank, W.: Halin graphs and the travelling salesman problem. Math. Programm. 26(3), 287\u2013294 (1983)","journal-title":"Math. Programm."},{"issue":"4","key":"11_CR13","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s00454-007-1318-7","volume":"37","author":"V Dujmovi\u0107","year":"2007","unstructured":"Dujmovi\u0107, V., Wood, D.: Graph treewidth and geometric thickness parameters. Discrete Comput. Geom. 37(4), 641\u2013670 (2007)","journal-title":"Discrete Comput. Geom."},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-18469-7_22","volume-title":"Graph Drawing","author":"G Gange","year":"2011","unstructured":"Gange, G., Stuckey, P.J., Marriott, K.: Optimal k-level planarization and crossing minimization. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 238\u2013249. Springer, Heidelberg (2011)"},{"issue":"3","key":"11_CR16","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0166-218X(00)00178-5","volume":"109","author":"JL Ganley","year":"2001","unstructured":"Ganley, J.L., Heath, L.S.: The pagenumber of \n \n \n \n $$k$$\n -trees is \n \n \n \n $$O(k)$$\n . Discrete Appl. Math. 109(3), 215\u2013221 (2001)","journal-title":"Discrete Appl. Math."},{"issue":"6","key":"11_CR17","first-page":"41","volume":"1","author":"A Goldner","year":"1975","unstructured":"Goldner, A., Harary, F.: Note on a smallest nonhamiltonian maximal planar graph. Bull. Malays. Math. Sci. Soc. 1(6), 41\u201342 (1975)","journal-title":"Bull. Malays. Math. Sci. Soc."},{"key":"11_CR18","unstructured":"Heath, L.: Embedding planar graphs in seven pages. In: FOCS, pp. 74\u201383. IEEE Computer Society (1984)"},{"key":"11_CR19","unstructured":"Heath, L.: Algorithms for embedding graphs in books. Ph.D. thesis, University of N. Carolina (1985)"},{"issue":"5","key":"11_CR20","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1137\/0405031","volume":"3","author":"LS Heath","year":"1992","unstructured":"Heath, L.S., Leighton, F.T., Rosenberg, A.L.: Comparing queues and stacks as machines for laying out graphs. SIAM J. Discrete Math. 3(5), 398\u2013412 (1992)","journal-title":"SIAM J. Discrete Math."},{"issue":"7","key":"11_CR21","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1016\/j.aml.2006.08.019","volume":"20","author":"PC Kainen","year":"2007","unstructured":"Kainen, P.C., Overbay, S.: Extension of a theorem of Whitney. Appl. Math. Lett. 20(7), 835\u2013837 (2007)","journal-title":"Appl. Math. Lett."},{"key":"11_CR22","unstructured":"Kottler, S.: Description of the SApperloT, SArTagnan and MoUsSaka solvers for the SAT-competition 2011 (2011)"},{"issue":"1","key":"11_CR23","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/jagm.1994.1028","volume":"17","author":"S Malitz","year":"1994","unstructured":"Malitz, S.: Genus \n \n \n \n $$g$$\n graphs have pagenumber \n \n \n \n $$O(\\sqrt{q})$$\n . J. Algorithms 17(1), 85\u2013109 (1994)","journal-title":"J. Algorithms"},{"issue":"1","key":"11_CR24","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/jagm.1994.1027","volume":"17","author":"S Malitz","year":"1994","unstructured":"Malitz, S.: Graphs with \n \n \n \n $$e$$\n edges have pagenumber \n \n \n \n $$O(\\sqrt{E})$$\n . J. Algorithms 17(1), 71\u201384 (1994)","journal-title":"J. Algorithms"},{"key":"11_CR25","unstructured":"Nishizeki, T., Chiba, N.: Hamiltonian cycles. In: Planar Graphs: Theory and Algorithms, chap. 10, pp. 171\u2013184. Dover Books on Mathematics, Courier Dover Publications (2008)"},{"key":"11_CR26","unstructured":"Ollmann, T.: On the book thicknesses of various graphs. In: Hoffman, F., Levow, R., Thomas, R. (eds.) Southeastern Conference on Combinatorics, Graph Theory and Computing. Congressus Numerantium, vol. VIII, p. 459 (1973)"},{"issue":"3","key":"11_CR27","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0747-7171(86)80028-1","volume":"2","author":"DA Plaisted","year":"1986","unstructured":"Plaisted, D.A., Greenbaum, S.: A structure-preserving clause form translation. J. Symbolic Comput. 2(3), 293\u2013304 (1986)","journal-title":"J. Symbolic Comput."},{"issue":"10","key":"11_CR28","doi-asserted-by":"publisher","first-page":"902","DOI":"10.1109\/TC.1983.1676134","volume":"C\u201332","author":"AL Rosenberg","year":"1983","unstructured":"Rosenberg, A.L.: The Diogenes approach to testable fault-tolerant arrays of processors. IEEE Trans. Comput. C\u201332(10), 902\u2013910 (1983)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"11_CR29","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.disc.2009.07.016","volume":"310","author":"Y Suzuki","year":"2010","unstructured":"Suzuki, Y.: Optimal 1-planar graphs which triangulate other surfaces. Discrete Math. 310(1), 6\u201311 (2010)","journal-title":"Discrete Math."},{"issue":"2","key":"11_CR30","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/321694.321704","volume":"19","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Sorting using networks of queues and stacks. J. ACM 19(2), 341\u2013346 (1972)","journal-title":"J. ACM"},{"key":"11_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/978-3-642-10439-8_52","volume-title":"AI 2009: Advances in Artificial Intelligence","author":"MN Velev","year":"2009","unstructured":"Velev, M.N., Gao, P.: Efficient SAT techniques for relative encoding of permutations with constraints. In: Nicholson, A., Li, X. (eds.) AI 2009. LNCS, vol. 5866, pp. 517\u2013527. Springer, Heidelberg (2009)"},{"key":"11_CR32","unstructured":"Wigderson, A.: The complexity of the Hamiltonian circuit problem for maximal planar graphs. Technical report TR-298, EECS Department, Princeton University (1982)"},{"issue":"1","key":"11_CR33","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/0022-0000(89)90032-9","volume":"C\u201338","author":"M Yannakakis","year":"1989","unstructured":"Yannakakis, M.: Embedding planar graphs in four pages. J. Comput. Syst. Sci. C\u201338(1), 36\u201367 (1989)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27261-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T00:11:16Z","timestamp":1569283876000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27261-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319272603","9783319272610"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27261-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"27 November 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}