{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:11:22Z","timestamp":1753884682398},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642145520"},{"type":"electronic","value":"9783642145537"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14553-7_25","type":"book-chapter","created":{"date-parts":[[2010,7,26]],"date-time":"2010-07-26T07:59:21Z","timestamp":1280131161000},"page":"262-273","source":"Crossref","is-referenced-by-count":2,"title":["Path Separability of Graphs"],"prefix":"10.1007","author":[{"given":"Emilie","family":"Diot","sequence":"first","affiliation":[]},{"given":"Cyril","family":"Gavoille","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Gavoille, C.: Object location using path separators. In: 25 th Annual ACM Symp. on Principles of Distributed Comp. (PODC), pp. 188\u2013197 (2006)","DOI":"10.1145\/1146381.1146411"},{"key":"25_CR2","unstructured":"Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Langston, M.A., Suters, W.H., Symons, C.T.: Kernelization algorithms for the vertex cover problem: Theory and experiments. In: 6 th Workshop ALENEX, pp. 62\u201369 (2004)"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Chepoi, V.D., Dragan, F.F., Estellon, B., Habib, M., Vax\u00e8s, Y.: Diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs. In: 24 st Annual ACM Symposium on Computational Geometry (SoCG), pp. 59\u201368 (2008)","DOI":"10.1145\/1377676.1377687"},{"issue":"16","key":"25_CR4","doi-asserted-by":"publisher","first-page":"2008","DOI":"10.1016\/j.disc.2005.12.060","volume":"307","author":"Y. Dourisboure","year":"2007","unstructured":"Dourisboure, Y., Gavoille, C.: Tree-decompositions with bags of small diameter. Discrete Mathematics\u00a0307(16), 2008\u20132029 (2007)","journal-title":"Discrete Mathematics"},{"key":"25_CR5","volume-title":"Parametrized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parametrized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"25_CR6","first-page":"54","volume-title":"Elsevier (ed.) 1 st Cologne-Twente Workshop on Graphs and Combinatorial Optimization","author":"A.M.C.A. Koster","year":"2001","unstructured":"Koster, A.M.C.A., Bodlaender, H.L., van Hoesel, S.P.M.: Treewidth: Computational experiments. In: Elsevier (ed.) 1 st Cologne-Twente Workshop on Graphs and Combinatorial Optimization, vol.\u00a08, pp. 54\u201357. ENDM, Amsterdam (2001)"},{"issue":"2","key":"25_CR7","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R.J. Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM Journal on Applied Mathematics\u00a036(2), 177\u2013189 (1979)","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"1","key":"25_CR8","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N. Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. Journal of Combinatorial Theory, Series B\u00a063(1), 65\u2013110 (1995)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"1","key":"25_CR9","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0095-8956(03)00042-X","volume":"89","author":"N. Robertson","year":"2003","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XVI. Excluding a non-planar graph. Journal of Combinatorial Theory, Series B\u00a089(1), 43\u201376 (2003)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"2","key":"25_CR10","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.jctb.2004.08.001","volume":"92","author":"N. Robertson","year":"2004","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XX. Wagner\u2019s conjecture. Journal of Combinatorial Theory, Series B\u00a092(2), 325\u2013357 (2004)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"6","key":"25_CR11","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1145\/1039488.1039493","volume":"51","author":"M. Thorup","year":"2004","unstructured":"Thorup, M.: Compact oracles for reachability and approximate distances in planar digraphs. Journal of the ACM\u00a051(6), 993\u20131024 (2004)","journal-title":"Journal of the ACM"},{"issue":"13","key":"25_CR12","doi-asserted-by":"publisher","first-page":"4656","DOI":"10.1016\/j.disc.2009.01.009","volume":"309","author":"K. Umezawa","year":"2009","unstructured":"Umezawa, K., Yamazaki, K.: Tree-length equals branch-length. Discrete Mathematics\u00a0309(13), 4656\u20134660 (2009)","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14553-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T16:30:19Z","timestamp":1559320219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14553-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642145520","9783642145537"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14553-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}