{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T00:47:14Z","timestamp":1725756434731},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642450426"},{"type":"electronic","value":"9783642450433"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45043-3_19","type":"book-chapter","created":{"date-parts":[[2013,11,12]],"date-time":"2013-11-12T14:05:50Z","timestamp":1384265150000},"page":"213-224","source":"Crossref","is-referenced-by-count":2,"title":["Lower and Upper Bounds for Long Induced Paths in 3-Connected Planar Graphs"],"prefix":"10.1007","author":[{"given":"Emilio","family":"Di Giacomo","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Tamara","family":"Mchedlidze","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"105","DOI":"10.7151\/dmgt.1110","volume":"20","author":"J.L. Arocha","year":"2000","unstructured":"Arocha, J.L., Valencia, P.: Long induced paths in 3-connected planar graphs. Discuss. Math. Graph Theory\u00a020(1), 105\u2013107 (2000)","journal-title":"Discuss. Math. Graph Theory"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-31155-0_13","volume-title":"Algorithm Theory \u2013 SWAT 2012","author":"A. Atminas","year":"2012","unstructured":"Atminas, A., Lozin, V.V., Razgon, I.: Linear time algorithm for computing a small biclique in graphs without long induced paths. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol.\u00a07357, pp. 142\u2013152. Springer, Heidelberg (2012)"},{"issue":"4","key":"19_CR3","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1002\/jgt.10161","volume":"45","author":"T. B\u00f6hme","year":"2004","unstructured":"B\u00f6hme, T., Mohar, B., Skrekovski, R., Stiebitz, M.: Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs. Journal of Graph Theory\u00a045(4), 270\u2013274 (2004)","journal-title":"Journal of Graph Theory"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/PL00009264","volume":"23","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Tamassia, R., Vismara, L.: Output-sensitive reporting of disjoint paths. Algorithmica\u00a023, 302\u2013340 (1999)","journal-title":"Algorithmica"},{"issue":"1","key":"19_CR5","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0095-8956(86)90028-6","volume":"41","author":"P. Erd\u00f6s","year":"1986","unstructured":"Erd\u00f6s, P., Saks, M., S\u00f3s, V.T.: Maximum induced trees in graphs. Journal of Combinatorial Theory, Series B\u00a041(1), 61\u201379 (1986)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"1","key":"19_CR6","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s00454-007-9027-9","volume":"40","author":"S. Felsner","year":"2008","unstructured":"Felsner, S., Zickfeld, F.: Schnyder woods and orthogonal surfaces. Discrete & Computational Geometry\u00a040(1), 103\u2013126 (2008)","journal-title":"Discrete & Computational Geometry"},{"key":"19_CR7","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)"},{"issue":"4","key":"19_CR8","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0020-0190(01)00222-8","volume":"81","author":"F. Gavril","year":"2002","unstructured":"Gavril, F.: Algorithms for maximum weight induced paths. Inf. Process. Lett.\u00a081(4), 203\u2013208 (2002)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"19_CR9","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1006\/jagm.1994.1031","volume":"17","author":"F. Gavril","year":"1994","unstructured":"Gavril, F., Laredo, V.T., de Werra, D.: Chordless paths, odd holes, and kernels in graphs without m-obstructions. J. Algorithms\u00a017(2), 207\u2013221 (1994)","journal-title":"J. Algorithms"},{"issue":"4","key":"19_CR10","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/s00454-008-9130-6","volume":"42","author":"X. Goaoc","year":"2009","unstructured":"Goaoc, X., Kratochv\u00edl, J., Okamoto, Y., Shin, C.-S., Spillner, A., Wolff, A.: Untangling a planar graph. Discrete & Computational Geometry\u00a042(4), 542\u2013569 (2009)","journal-title":"Discrete & Computational Geometry"},{"issue":"15","key":"19_CR11","doi-asserted-by":"publisher","first-page":"3057","DOI":"10.1016\/j.dam.2008.01.019","volume":"156","author":"T. Ishizeki","year":"2008","unstructured":"Ishizeki, T., Otachi, Y., Yamazaki, K.: An improved algorithm for the longest induced path problem on k-chordal graphs. Discrete Applied Mathematics\u00a0156(15), 3057\u20133059 (2008)","journal-title":"Discrete Applied Mathematics"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-540-39890-5_27","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"D. Kratsch","year":"2003","unstructured":"Kratsch, D., M\u00fcller, H., Todinca, I.: Feedback vertex set and longest induced path on AT-free graphs. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 309\u2013321. Springer, Heidelberg (2003)"},{"issue":"4","key":"19_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.ipl.2003.07.004","volume":"88","author":"V.V. Lozin","year":"2003","unstructured":"Lozin, V.V., Rautenbach, D.: Some results on graphs without long induced paths. Inf. Process. Lett.\u00a088(4), 167\u2013171 (2003)","journal-title":"Inf. Process. Lett."},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-56939-1_60","volume-title":"Automata, Languages and Programming","author":"C. Lund","year":"1993","unstructured":"Lund, C., Yannakakis, M.: The approximation of maximum subgraph problems. In: Lingas, A., Carlsson, S., Karlsson, R. (eds.) ICALP 1993. LNCS, vol.\u00a0700, pp. 40\u201351. Springer, Heidelberg (1993)"},{"issue":"8","key":"19_CR15","doi-asserted-by":"publisher","first-page":"876","DOI":"10.2307\/2316481","volume":"78","author":"L. Mirsky","year":"1971","unstructured":"Mirsky, L.: A dual of Dilworth\u2019s decomposition theorem. The American Mathematical Monthly\u00a078(8), 876\u2013877 (1971)","journal-title":"The American Mathematical Monthly"},{"key":"19_CR16","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1990, pp. 138\u2013148 (1990)"},{"issue":"1","key":"19_CR17","first-page":"107","volume":"15","author":"G.J. Woeginger","year":"2001","unstructured":"Woeginger, G.J., Sgall, J.: The complexity of coloring graphs without long induced paths. Acta Cybern.\u00a015(1), 107 (2001)","journal-title":"Acta Cybern."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45043-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T06:15:13Z","timestamp":1558678513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45043-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450426","9783642450433"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45043-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}