{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T08:02:33Z","timestamp":1768636953806,"version":"3.49.0"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,12,19]],"date-time":"2023-12-19T00:00:00Z","timestamp":1702944000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,19]],"date-time":"2023-12-19T00:00:00Z","timestamp":1702944000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s00493-023-00077-w","type":"journal-article","created":{"date-parts":[[2023,12,19]],"date-time":"2023-12-19T17:02:22Z","timestamp":1703005342000},"page":"417-427","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Tight Bound on Treedepth in Terms of Pathwidth and Longest Path"],"prefix":"10.1007","volume":"44","author":[{"given":"Meike","family":"Hatzel","sequence":"first","affiliation":[]},{"given":"Gwena\u00ebl","family":"Joret","sequence":"additional","affiliation":[]},{"given":"Piotr","family":"Micek","sequence":"additional","affiliation":[]},{"given":"Marcin","family":"Pilipczuk","sequence":"additional","affiliation":[]},{"given":"Torsten","family":"Ueckerdt","sequence":"additional","affiliation":[]},{"given":"Bartosz","family":"Walczak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,19]]},"reference":[{"issue":"2","key":"77_CR1","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0095-8956(91)90068-U","volume":"52","author":"D Bienstock","year":"1991","unstructured":"Bienstock, D., Robertson, N., Seymour, P., Thomas, R.: Quickly excluding a forest. J. Comb. Theory Ser. B 52(2), 274\u2013283 (1991)","journal-title":"J. Comb. Theory Ser. B"},{"key":"77_CR2","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Chuzhoy, J.: Polynomial bounds for the grid-minor theorem. J. ACM 63(5), Article 40, (2016). arXiv:1305.6577","DOI":"10.1145\/2820609"},{"key":"77_CR3","doi-asserted-by":"crossref","unstructured":"Czerwi\u0144ski, W., Nadara, W., Pilipczuk, M.: Improved bounds for the excluded-minor approximation of treedepth. SIAM J. Discret. Math. 35(2), 934\u2013947 (2021). arXiv:1904.13077","DOI":"10.1137\/19M128819X"},{"key":"77_CR4","doi-asserted-by":"crossref","unstructured":"Erde, J.: A unified treatment of linked and lean tree-decompositions. J. Comb. Theory Ser. B 130, 114\u2013143 (2018). arXiv:1703.03756","DOI":"10.1016\/j.jctb.2017.12.001"},{"key":"77_CR5","doi-asserted-by":"crossref","unstructured":"Groenland, C., Joret, G., Nadara, W., Walczak, B.: Approximating pathwidth for graphs of small treewidth. ACM Trans. Algorithms 19(2), Article 16 (2023). arXiv:2008.00779","DOI":"10.1145\/3576044"},{"issue":"4","key":"77_CR6","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.4171\/jems\/1133","volume":"24","author":"K Kawarabayashi","year":"2022","unstructured":"Kawarabayashi, K., Rossman, B.: A polynomial excluded-minor approximation of treedepth. J. Eur. Math. Soc. 24(4), 1449\u20131470 (2022)","journal-title":"J. Eur. Math. Soc."},{"key":"77_CR7","doi-asserted-by":"crossref","unstructured":"Ne\u0161et\u0159il, J., de Mendez, P.O.: Sparsity, volume 28 of Algorithms and Combinatorics. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-27875-4"},{"key":"77_CR8","doi-asserted-by":"crossref","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. V. Excluding a planar graph. J. Comb. Theory Ser. B 41(1), 92\u2013114 (1986)","DOI":"10.1016\/0095-8956(86)90030-4"},{"key":"77_CR9","unstructured":"Scheffler, P.: Die Baumweite von Graphen als ein Ma\u00df f\u00fcr die Kompliziertheit algorithmischer Probleme. PhD thesis, Akademie der Wissenschaften der DDR, Berlin, (1989)"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-023-00077-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-023-00077-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-023-00077-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,21]],"date-time":"2024-03-21T22:02:18Z","timestamp":1711058538000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-023-00077-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,19]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["77"],"URL":"https:\/\/doi.org\/10.1007\/s00493-023-00077-w","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,19]]},"assertion":[{"value":"6 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}