{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:28:35Z","timestamp":1726410515248},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319125671"},{"type":"electronic","value":"9783319125688"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45803-7_1","type":"book-chapter","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T06:12:53Z","timestamp":1417414373000},"page":"1-12","source":"Crossref","is-referenced-by-count":0,"title":["Planar Induced Subgraphs of Sparse Graphs"],"prefix":"10.1007","author":[{"given":"Glencora","family":"Borradaile","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Eppstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pingan","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Alon, N., Mubayi, D., Thomas, R.: Large induced forests in sparse graphs. J. Graph Theory\u00a0113, 113\u2013123 (2001) MR 1859785","key":"1_CR1","DOI":"10.1002\/jgt.1028"},{"unstructured":"Borradaile, G., Eppstein, D., Zhu, P.: Planar induced subgraphs of sparse graphs (2014), arXiv:1408.5939","key":"1_CR2"},{"issue":"10","key":"1_CR3","first-page":"36","volume":"3","author":"G. Borradaile","year":"2014","unstructured":"Borradaile, G., Klein, P., Marx, D., Mathieu, C.: Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 13421). Dagstuhl Reports\u00a03(10), 36\u201357 (2014)","journal-title":"Dagstuhl Reports"},{"doi-asserted-by":"crossref","unstructured":"C\u0103linescu, G., Fernandes, C.G., Finkler, U., Karloff, H.: A better approximation algorithm for finding planar subgraphs. J. Algorithms\u00a027(2), 269\u2013302 (1998) MR 1622397","key":"1_CR4","DOI":"10.1006\/jagm.1997.0920"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-25870-1_11","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"C. Cheng","year":"2011","unstructured":"Cheng, C., McDermid, E., Suzuki, I.: Planarization and acyclic colorings of subcubic claw-free graphs. In: Kolman, P., Kratochv\u00edl, J. (eds.) WG 2011. LNCS, vol.\u00a06986, pp. 107\u2013118. Springer, Heidelberg (2011) MR 2914703"},{"unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs, 1st edn. Prentice-Hall (1998)","key":"1_CR6"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/3-540-45848-4_6","volume-title":"Graph Drawing","author":"K. Edwards","year":"2002","unstructured":"Edwards, K., Farr, G.: An algorithm for finding large induced planar subgraphs. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol.\u00a02265, pp. 75\u201380. Springer, Heidelberg (2002) MR 2410446"},{"doi-asserted-by":"crossref","unstructured":"Edwards, K., Farr, G.: Planarization and fragmentability of some classes of graphs. Discrete Math.\u00a0308(12), 2396\u20132406 (2008) MR 2410446","key":"1_CR8","DOI":"10.1016\/j.disc.2007.05.007"},{"doi-asserted-by":"crossref","unstructured":"Edwards, K., Farr, G.: Improved upper bounds for planarization and series-parallelization of degree-bounded graphs. Electron. J. Combin.\u00a019(2), 25 (2012) MR 2928640","key":"1_CR9","DOI":"10.37236\/2378"},{"issue":"3","key":"1_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00003","volume":"1","author":"M.M. Halld\u00f3rsson","year":"1997","unstructured":"Halld\u00f3rsson, M.M., Lau, H.C.: Low-degree graph partitioning via local search with applications to constraint satisfaction, max cut, and coloring. J. Graph Algorithms Appl.\u00a01(3), 1\u201313 (1997) MR 1600712","journal-title":"J. Graph Algorithms Appl."},{"doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K.-I.: Planarity allowing few error vertices in linear time. In: 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2009), pp. 639\u2013648 (2009) MR 2648441","key":"1_CR11","DOI":"10.1109\/FOCS.2009.45"},{"doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K.-i., Reed, B.: Computing crossing number in linear time. In: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing (STOC 2007), pp. 382\u2013390 (2007) MR 2402463","key":"1_CR12","DOI":"10.1145\/1250790.1250848"},{"key":"1_CR13","first-page":"37","volume":"38","author":"A.V. Kostochka","year":"1982","unstructured":"Kostochka, A.V.: The minimum Hadwiger number for graphs with a given mean degree of vertices. Metody Diskret. Analiz\u00a038, 37\u201358 (1982) MR 0713722","journal-title":"Metody Diskret. Analiz"},{"issue":"4","key":"1_CR14","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02579141","volume":"4","author":"A.V. Kostochka","year":"1984","unstructured":"Kostochka, A.V.: Lower bound of the Hadwiger number of graphs by their average degree. Combinatorica\u00a04(4), 307\u2013316 (1984) MR 0779891","journal-title":"Combinatorica"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotzky","year":"1988","unstructured":"Lubotzky, A., Philips, R., Sarnak, R.: Ramanujan graphs. Combinatorica\u00a08, 261\u2013277 (1988) MR 0963118","journal-title":"Combinatorica"},{"doi-asserted-by":"crossref","unstructured":"Morgan, K., Farr, G.: Approximation algorithms for the maximum induced planar and outerplanar subgraph problems. J. Graph Algorithms Appl.\u00a011(1), 165\u2013193 (2007) MR 2354168","key":"1_CR16","DOI":"10.7155\/jgaa.00141"},{"doi-asserted-by":"crossref","unstructured":"Thomason, A.: An extremal function for contractions of graphs. Math. Proc. Cambridge Philos. Soc.\u00a095(2), 261\u2013265 (1984) MR 0735367","key":"1_CR17","DOI":"10.1017\/S0305004100061521"},{"doi-asserted-by":"crossref","unstructured":"Thomason, A.: The extremal function for complete minors. J. Combinatorial Theory, Series B\u00a081(2), 318\u2013338 (2001) MR 1814910","key":"1_CR18","DOI":"10.1006\/jctb.2000.2013"}],"container-title":["Lecture Notes in Computer Science","Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45803-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T06:27:23Z","timestamp":1598509643000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45803-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319125671","9783319125688"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45803-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}