乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T15:03:06Z","timestamp":1693666986168},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,5,6]],"date-time":"2014-05-06T00:00:00Z","timestamp":1399334400000},"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":["Discrete Comput Geom"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s00454-014-9594-5","type":"journal-article","created":{"date-parts":[[2014,5,5]],"date-time":"2014-05-05T23:34:02Z","timestamp":1399332842000},"page":"979-996","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Covering Nearly Surface-Embedded Graphs with a Fixed Number of Balls"],"prefix":"10.1007","volume":"51","author":[{"given":"Glencora","family":"Borradaile","sequence":"first","affiliation":[]},{"given":"Erin Wolf","family":"Chambers","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,6]]},"reference":[{"issue":"1","key":"9594_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01196127","volume":"17","author":"P Agarwal","year":"1997","unstructured":"Agarwal, P., Aronov, B., Pach, J., Pollack, R., Sharir, M.: Quasi-planar graphs have a linear number of edges. Combinatorica 17(1), 1\u20139 (1997)","journal-title":"Combinatorica"},{"issue":"2","key":"9594_CR2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s00454-006-1260-0","volume":"37","author":"V Chepoi","year":"2007","unstructured":"Chepoi, V., Estellon, B., Vaxes, Y.: Covering planar graphs with a fixed number of balls. Discrete Comput. Geom. 37(2), 237\u2013244 (2007)","journal-title":"Discrete Comput. Geom."},{"issue":"6","key":"9594_CR3","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1145\/1101821.1101823","volume":"52","author":"ED Demaine","year":"2005","unstructured":"Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Subexponential parameterized algorithms on graphs of bounded-genus and $$h$$ h -minor-free graphs. J. ACM 52(6), 866\u2013893 (2005)","journal-title":"J. ACM"},{"issue":"2","key":"9594_CR4","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1006\/jagm.1993.1013","volume":"14","author":"K Diks","year":"1993","unstructured":"Diks, K., Djidjev, H., S\u00fdkora, O., Vrt\u2019o, I.: Edge separators of planar and outerplanar graphs with applications. J. Algorithms 14(2), 258\u2013279 (1993)","journal-title":"J. Algorithms"},{"key":"9594_CR5","first-page":"646","volume":"7","author":"J Edmonds","year":"1960","unstructured":"Edmonds, J.: A combinatorial representation for polyhedral surfaces. Not. Am. Math. Soc. 7, 646 (1960)","journal-title":"Not. Am. Math. Soc."},{"key":"9594_CR6","series-title":"Advanced Lectures in Mathematics","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/978-3-322-80303-0_3","volume-title":"Geometric Graphs and Arrangements","author":"S Felsner","year":"2004","unstructured":"Felsner, S.: Topological graphs: crossing lemma and applications. In: Felsner, S. (ed.) Geometric Graphs and Arrangements. Advanced Lectures in Mathematics, pp. 43\u201352. Vieweg+Teubner, Wiesbaden (2004)"},{"key":"9594_CR7","unstructured":"Fox, J., Pach, J., Suk, A.: The number of edges in $$k$$ k -quasi-planar graphs. SIAM J. Discret. Math. 27(1), 550\u2013561 (2013)"},{"key":"9594_CR8","doi-asserted-by":"crossref","unstructured":"Gavoille, C., Peleg, D., Raspaud, A., Sopena, E.: Small $$k$$ k -dominating sets in planar graphs with applications. In: Brandstdt, A., Le, V. (eds.) Graph-Theoretic Concepts in Computer Science. Lecture Notes in Computer Science, vol. 2204, pp. 201\u2013216. Springer, Berlin (2001)","DOI":"10.1007\/3-540-45477-2_19"},{"key":"9594_CR9","doi-asserted-by":"crossref","unstructured":"Gazit, H., Miller, G.L.: Planar separators and the Euclidean norm. In: SIGAL International Symposium on Algorithms, pp. 338\u2013347. Information Processing Society of Japan, Springer, Tokyo (1990)","DOI":"10.1007\/3-540-52921-7_83"},{"issue":"4","key":"9594_CR10","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/S0021-9800(68)80063-8","volume":"4","author":"RK Guy","year":"1968","unstructured":"Guy, R.K., Jenkyns, T., Schaer, J.: The toroidal crossing number of the complete graph. J. Comb. Theory 4(4), 376\u2013390 (1968)","journal-title":"J. Comb. Theory"},{"key":"9594_CR11","volume-title":"Algebraic Topology","author":"A Hatcher","year":"2002","unstructured":"Hatcher, A.: Algebraic Topology. Cambridge University Press, Cambridge (2002)"},{"key":"9594_CR12","unstructured":"Helly, E.: \u00dcber Mengen konvexer K\u00f6rper mit gemeinschaftlichen Punkten. Jahresbericht der Deutschen Mathematiker-Vereinigung 32, 175\u2013176 (1923)"},{"key":"9594_CR13","unstructured":"Matou\u0306sek, J.: Bounded VC-dimension implies a fractional Helly theorem. Discrete Comput. Geom. 31(2), 251\u2013255 (2004)"},{"issue":"3","key":"9594_CR14","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0022-0000(86)90030-9","volume":"32","author":"GL Miller","year":"1986","unstructured":"Miller, G.L.: Finding small simple cycle separators for 2-connected planar graphs. J. Comput. Syst. Sci. 32(3), 265\u2013279 (1986)","journal-title":"J. Comput. Syst. Sci."},{"key":"9594_CR15","doi-asserted-by":"crossref","DOI":"10.56021\/9780801866890","volume-title":"Graphs on Surfaces, Chap. 4","author":"B Mohar","year":"2001","unstructured":"Mohar, B., Thomassen, C.: Graphs on Surfaces, Chap. 4. Johns Hopkins University Press, Baltimore (2001)"},{"key":"9594_CR16","volume-title":"Topology","author":"JR Munkres","year":"2000","unstructured":"Munkres, J.R.: Topology, 2nd edn. Prentice-Hall, Englewood Cliffs (2000)","edition":"2"},{"key":"9594_CR17","doi-asserted-by":"crossref","unstructured":"Pach, J., Shahrokhi, F., Szegedy, M.: Applications of the crossing number. In: Proceedings of the Tenth Annual Symposium on Computational geometry. SCG \u201994, pp. 198\u2013202. ACM, New York, NY (1994)","DOI":"10.1145\/177424.177629"},{"key":"9594_CR18","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1073\/pnas.60.2.438","volume":"60","author":"G Ringel","year":"1968","unstructured":"Ringel, G., Youngs, J.W.T.: Solution of the Heawood map-coloring problem. Proc. Natl. Acad. Sci. USA 60, 438\u2013445 (1968)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"issue":"1","key":"9594_CR19","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0095-8956(03)00042-X","volume":"89","author":"N Robertson","year":"2003","unstructured":"Robertson, N., Seymour, P.: Graph minors. XVI. Excluding a non-planar graph. J. Comb. Theory B 89(1), 43\u201376 (2003)","journal-title":"J. Comb. Theory B"},{"key":"9594_CR20","unstructured":"Shahrokhi, F., S\u00fdkora, O., Sz\u00e9kely, L., Vrt\u2019o, I.: The crossing number of a graph on a compact 2-manifold. Adv. Math. 123(2), 105\u2013119 (1996)"},{"key":"9594_CR21","doi-asserted-by":"crossref","unstructured":"Shahrokhi, F., Sz\u00e9kely, L., S\u00fdkora, O., Vrt\u2019o, I.: Improved bounds for the crossing numbers on surfaces of genus $$g$$ g . In: Leeuwen, J. (ed.) Graph-Theoretic Concepts in Computer Science. Lecture Notes in Computer Science, vol. 790, pp. 388\u2013395. Springer, Berlin (1994)","DOI":"10.1007\/3-540-57899-4_68"},{"key":"9594_CR22","doi-asserted-by":"crossref","unstructured":"Suk, A., Walczak, B.: New bounds on the maximum number of edges in $$k$$ k -quasi-planar graphs. In: Proceedings of the International Symposium on Graph Drawing (2013)","DOI":"10.1007\/978-3-319-03841-4_9"},{"key":"9594_CR23","unstructured":"Thomass\u00e9, S.: Invited talk, canaDAM. University of Victoria (2011) (personal communication)"},{"key":"9594_CR24","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1002\/jgt.3190010105","volume":"1","author":"P Tur\u00e1n","year":"1977","unstructured":"Tur\u00e1n, P.: A note of welcome. J. Graph Theory 1, 7\u20139 (1977)","journal-title":"J. Graph Theory"},{"issue":"2","key":"9594_CR25","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"V Vapnik","year":"1971","unstructured":"Vapnik, V., Chervonenkis, A.: On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl. 16(2), 264\u2013280 (1971)","journal-title":"Theory Probab. Appl."},{"key":"9594_CR26","first-page":"303","volume":"12","author":"J Youngs","year":"1963","unstructured":"Youngs, J.: Minimal imbeddings and the genus of a graph. J. Math. Mech. 12, 303\u2013315 (1963)","journal-title":"J. Math. Mech."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-014-9594-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-014-9594-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-014-9594-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T21:44:38Z","timestamp":1689198278000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-014-9594-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,6]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["9594"],"URL":"https:\/\/doi.org\/10.1007\/s00454-014-9594-5","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,6]]}}}