乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T06:29:46Z","timestamp":1726381786820},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T00:00:00Z","timestamp":1496361600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T00:00:00Z","timestamp":1496361600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1228639"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"PRIN Italian National Research","award":["2012C4E3KT"]},{"name":"PEPS egalite"},{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s00453-017-0328-y","type":"journal-article","created":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T13:57:57Z","timestamp":1496411877000},"page":"977-994","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["On the Planar Split Thickness of Graphs"],"prefix":"10.1007","volume":"80","author":[{"given":"David","family":"Eppstein","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-5764-7719","authenticated-orcid":false,"given":"Philipp","family":"Kindermann","sequence":"additional","affiliation":[]},{"given":"Stephen","family":"Kobourov","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-2886-9694","authenticated-orcid":false,"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Lubiw","sequence":"additional","affiliation":[]},{"given":"Aude","family":"Maignan","sequence":"additional","affiliation":[]},{"given":"Debajyoti","family":"Mondal","sequence":"additional","affiliation":[]},{"given":"Hamideh","family":"Vosoughpour","sequence":"additional","affiliation":[]},{"given":"Sue","family":"Whitesides","sequence":"additional","affiliation":[]},{"given":"Stephen","family":"Wismath","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,2]]},"reference":[{"issue":"17","key":"328_CR1","doi-asserted-by":"publisher","first-page":"850","DOI":"10.4153\/CJM-1965-084-2","volume":"14","author":"LW Beineke","year":"1965","unstructured":"Beineke, L.W., Harary, F.: The thickness of the complete graph. Can. J. Math. 14(17), 850\u2013859 (1965)","journal-title":"Can. J. Math."},{"key":"328_CR2","first-page":"85","volume":"8","author":"LW Beineke","year":"1984","unstructured":"Beineke, L.W., Harary, F.: A simplified NP-complete satisfiability problem. Craig A. Tovey 8, 85\u201389 (1984)","journal-title":"Craig A. Tovey"},{"key":"328_CR3","unstructured":"Borradaile, G., Eppstein, D., Zhu, P.: Planar induced subgraphs of sparse graphs. In: Duncan, C.A., Symvonis, A. (eds.) Proceedings of the 22nd International Symposium on Graph Drawing (GD). Lecture Notes Comput. Sci., vol. 8871, pp. 1\u201312. Springer (2014)"},{"issue":"1","key":"328_CR4","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.aam.2012.06.004","volume":"50","author":"M Chimani","year":"2013","unstructured":"Chimani, M., Derka, M., Hlin\u011bn\u1ef3, P., Klus\u00e1\u010dek, M.: How not to characterize planar-emulable graphs. Adv. Appl. Math. 50(1), 46\u201368 (2013)","journal-title":"Adv. Appl. Math."},{"issue":"1","key":"328_CR5","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990)","journal-title":"Inf. Comput."},{"key":"328_CR6","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: On the expression of graph properties in some fragments of monadic second-order logic. In: Immerman, N., Kolaitis, P.G. (eds.) Proceedings of the DIMACS Workshop on Descriptive Complexity and Finite Models. DIMACS Ser. Discrete Math. Theor. Comput. Sci., vol.\u00a031, pp. 33\u201362. American Math. Soc. (1996)","DOI":"10.1090\/dimacs\/031\/02"},{"key":"328_CR7","unstructured":"de\u00a0Mendon\u00e7a\u00a0Neto, C.F.X., Schaffer, K., Xavier, E.F., Stolfi, J., Faria, L., de\u00a0Figueiredo, C.M.H.: The splitting number and skewness of $${C}_n\\times {C}_m$$. Ars Comb. 63 (2002)"},{"issue":"4","key":"328_CR8","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s00454-007-1318-7","volume":"37","author":"V Dujmovic","year":"2007","unstructured":"Dujmovic, V., Wood, D.R.: Graph treewidth and geometric thickness parameters. Discret. Comput. Geom. 37(4), 641\u2013670 (2007)","journal-title":"Discret. Comput. Geom."},{"key":"328_CR9","doi-asserted-by":"crossref","unstructured":"Duncan, C.A., Eppstein, D., Kobourov, S.G.: The geometric thickness of low degree graphs. In: Snoeyink, J., Boissonnat, J. (eds.) Proceedings of the 20th ACM Symposium on Computational Geometry (SoCG), pp. 340\u2013346. ACM (2004)","DOI":"10.1145\/997817.997868"},{"key":"328_CR10","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Kindermann, P., Kobourov, S.G., Liotta, G., Lubiw, A., Maignan, A., Mondal, D., Vosoughpour, H., Whitesides, S., Wismath, S.K.: On the planar split thickness of graphs. In: Kranakis, E., Navarro, G., Ch\u00e1vez, E. (eds.) Proceedings of the 12th Latin American Theoretical Informatics Symposium (LATIN). Lecture Notes Comput. Sci., vol. 9644, pp. 403\u2013415. Springer (2016)","DOI":"10.1007\/978-3-662-49529-2_30"},{"issue":"1\u20132","key":"328_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0166-218X(00)00220-1","volume":"108","author":"L Faria","year":"2001","unstructured":"Faria, L., de Figueiredo, C.M.H., de Mendon\u00e7a Neto, C.F.X.: Splitting number is NP-complete. Discret. Appl. Math. 108(1\u20132), 65\u201383 (2001)","journal-title":"Discret. Appl. Math."},{"key":"328_CR12","unstructured":"Fellows, M.R.: Encoding graphs in graphs. Ph.D. thesis, Univ. of California, San Diego (1985)"},{"issue":"1","key":"328_CR13","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/BF01758774","volume":"7","author":"HN Gabow","year":"1992","unstructured":"Gabow, H.N., Westermann, H.H.: Forests, frames, and games: algorithms for matroid sums and applications. Algorithmica 7(1), 465\u2013497 (1992)","journal-title":"Algorithmica"},{"key":"328_CR14","doi-asserted-by":"crossref","unstructured":"Gansner, E.R., Hu, Y., Kobourov, S.G.: Gmap: Visualizing graphs and clusters as maps. In: Proceedings of the IEEE Pacific Visualization Symposium (PacificVis), pp. 201\u2013208 (2010)","DOI":"10.1109\/PACIFICVIS.2010.5429590"},{"key":"328_CR15","doi-asserted-by":"crossref","unstructured":"Hartsfield, N.: The toroidal splitting number of the complete graph $${K}_n$$. Discrete Math. (1986)","DOI":"10.1016\/0012-365X(86)90039-7"},{"issue":"1","key":"328_CR16","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF01788557","volume":"3","author":"N Hartsfield","year":"1987","unstructured":"Hartsfield, N.: The splitting number of the complete graph in the projective plane. Graphs Comb. 3(1), 349\u2013356 (1987)","journal-title":"Graphs Comb."},{"issue":"1","key":"328_CR17","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF02582960","volume":"1","author":"N Hartsfield","year":"1985","unstructured":"Hartsfield, N., Jackson, B., Ringel, G.: The splitting number of the complete graph. Graphs Comb. 1(1), 311\u2013329 (1985)","journal-title":"Graphs Comb."},{"key":"328_CR18","first-page":"332","volume":"24","author":"PJ Heawood","year":"1890","unstructured":"Heawood, P.J.: Map colour theorem. Q. J. Math. 24, 332\u2013338 (1890)","journal-title":"Q. J. Math."},{"key":"328_CR19","unstructured":"Huneke, J.P.: A conjecture in topological graph theory. In: Robertson, N., Seymour, P.D. (eds.) Graph Structure Theory, Proceedings of a AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors held June 22 to July 5, 1991, at the University of Washington, Seattle. Contemp. Math., vol. 147, pp. 387\u2013389. American Math. Soc. (1991)"},{"issue":"4","key":"328_CR20","doi-asserted-by":"publisher","first-page":"211","DOI":"10.2307\/2690733","volume":"66","author":"JP Hutchinson","year":"1993","unstructured":"Hutchinson, J.P.: Coloring ordinary maps, maps of empires, and maps of the moon. Math. Mag. 66(4), 211\u2013226 (1993)","journal-title":"Math. Mag."},{"key":"328_CR21","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/BF01772941","volume":"42","author":"B Jackson","year":"1984","unstructured":"Jackson, B., Ringel, G.: The splitting number of complete bipartite graphs. Arch. Math. 42, 178\u2013184 (1984)","journal-title":"Arch. Math."},{"key":"328_CR22","unstructured":"Jackson, B., Ringel, G.: Splittings of graphs on surfaces. In: Harary, F., Maybee, J.S. (eds.) Proceedings of the 1st Colorado Symposium on Graph Theory, pp. 203\u2013219 (1985)"},{"issue":"2","key":"328_CR23","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1016\/j.disc.2015.10.023","volume":"339","author":"K Knauer","year":"2016","unstructured":"Knauer, K., Ueckerdt, T.: Three ways to cover a graph. Discret. Math. 339(2), 745\u2013758 (2016)","journal-title":"Discret. Math."},{"issue":"2","key":"328_CR24","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/0404022","volume":"4","author":"J Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J., Lubiw, A., Nesetril, J.: Noncrossing subgraphs in topological layouts. SIAM J. Discret. Math. 4(2), 223\u2013244 (1991)","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"328_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00032","volume":"5","author":"A Liebers","year":"2001","unstructured":"Liebers, A.: Planarizing graphs\u2014a survey and annotated bibliography. J. Graph Algorithms Appl. 5(1), 1\u201374 (2001)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"328_CR26","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1006\/jctb.1994.1054","volume":"62","author":"M Morgenstern","year":"1994","unstructured":"Morgenstern, M.: Existence and explicit constructions of $$q+1$$ regular Ramanujan graphs for every prime power $$q$$. J. Comb. Theory Ser. B 62(1), 44\u201362 (1994)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"328_CR27","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1112\/jlms\/s1-39.1.12","volume":"39","author":"CSJA Nash-Williams","year":"1964","unstructured":"Nash-Williams, C.S.J.A.: Decomposition of finite graphs into forests. J. Lond. Math. Soc. 39(1), 12 (1964)","journal-title":"J. Lond. Math. Soc."},{"issue":"3","key":"328_CR28","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0012-365X(86)90217-7","volume":"63","author":"S Negami","year":"1986","unstructured":"Negami, S.: Enumeration of projective-planar embeddings of graphs. Discret. Math. 63(3), 299\u2013306 (1986)","journal-title":"Discret. Math."},{"issue":"2","key":"328_CR29","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0012-365X(88)90090-8","volume":"70","author":"S Negami","year":"1988","unstructured":"Negami, S.: The spherical genus and virtually planar graphs. Discret. Math. 70(2), 159\u2013168 (1988)","journal-title":"Discret. Math."},{"issue":"2","key":"328_CR30","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1002\/net.3230120206","volume":"12","author":"JC Picard","year":"1982","unstructured":"Picard, J.C., Queyranne, M.: A network flow solution to some nonlinear 0\u20131 programming problems, with applications to graph theory. Networks 12(2), 141\u2013159 (1982)","journal-title":"Networks"},{"issue":"6","key":"328_CR31","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1109\/TVCG.2010.210","volume":"16","author":"NH Riche","year":"2010","unstructured":"Riche, N.H., Dwyer, T.: Untangling euler diagrams. Proc. IEEE Trans. Vis. Comput. Graph. 16(6), 1090\u20131099 (2010)","journal-title":"Proc. IEEE Trans. Vis. Comput. Graph."},{"key":"328_CR32","first-page":"146","volume":"347","author":"G Ringel","year":"1984","unstructured":"Ringel, G., Jackson, B.: Solution of Heawood\u2019s empire problem in the plane. J. Reine Angew. Math. 347, 146\u2013153 (1984)","journal-title":"J. Reine Angew. Math."},{"issue":"3","key":"328_CR33","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/0095-8956(83)90050-3","volume":"35","author":"ER Scheinerman","year":"1983","unstructured":"Scheinerman, E.R., West, D.B.: The interval number of a planar graph: three intervals suffice. J. Comb. Theory Ser. B 35(3), 224\u2013239 (1983)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"328_CR34","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1006\/jctb.2000.2013","volume":"81","author":"A Thomason","year":"2001","unstructured":"Thomason, A.: The extremal function for complete minors. J. Comb. Theory Ser. B 81(2), 318\u2013338 (2001)","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-017-0328-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0328-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0328-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T06:26:53Z","timestamp":1589696813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-017-0328-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,2]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["328"],"URL":"https:\/\/doi.org\/10.1007\/s00453-017-0328-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6,2]]},"assertion":[{"value":"30 June 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}