{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:45:19Z","timestamp":1767314719929,"version":"3.48.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032118349","type":"print"},{"value":"9783032118356","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-11835-6_18","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:42:01Z","timestamp":1767314521000},"page":"244-257","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Graphs Coverable by\u00a0Chubby Shortest Paths"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3249-1169","authenticated-orcid":false,"given":"Meike","family":"Hatzel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7891-1988","authenticated-orcid":false,"given":"Micha\u0142","family":"Pilipczuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"18_CR1","unstructured":"Abrishami, T., Czy\u017cewska, J., Kluk, K., Pilipczuk, M., Pilipczuk, M., Rza\u017cewski, P.: On coarse tree decompositions and coarse balanced separators. Preprint, arXiv:2502.20182 (2025). https:\/\/arxiv.org\/abs\/2502.20182"},{"key":"18_CR2","doi-asserted-by":"publisher","unstructured":"Ahn, J., Gollin, J.P., Huynh, T., Kwon, O.: A coarse Erd\u0151s-P\u00f3sa theorem. In: 36th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025, pp. 3363\u20133381. SIAM (2025). https:\/\/doi.org\/10.1137\/1.9781611978322.109","DOI":"10.1137\/1.9781611978322.109"},{"issue":"2","key":"18_CR3","doi-asserted-by":"publisher","first-page":"1438","DOI":"10.1137\/23M1573082","volume":"38","author":"S Albrechtsen","year":"2024","unstructured":"Albrechtsen, S., Huynh, T., Jacobs, R.W., Knappe, P., Wollan, P.: A Menger-type theorem for two induced paths. SIAM J. Discret. Math. 38(2), 1438\u20131450 (2024). https:\/\/doi.org\/10.1137\/23M1573082","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"18_CR4","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1007\/S00493-024-00088-1","volume":"44","author":"E Berger","year":"2024","unstructured":"Berger, E., Seymour, P.D.: Bounded-diameter tree-decompositions. Combinatorica 44(3), 659\u2013674 (2024). https:\/\/doi.org\/10.1007\/S00493-024-00088-1","journal-title":"Combinatorica"},{"issue":"1","key":"18_CR5","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s00454-011-9386-0","volume":"47","author":"V Chepoi","year":"2011","unstructured":"Chepoi, V., Dragan, F.F., Newman, I., Rabinovich, Y., Vax\u00e8s, Y.: Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs. Discrete Comput. Geom. 47(1), 187\u2013214 (2011). https:\/\/doi.org\/10.1007\/s00454-011-9386-0","journal-title":"Discrete Comput. Geom."},{"key":"18_CR6","doi-asserted-by":"publisher","unstructured":"Chepoi, V., Dragan, F.F., Vax\u00e8s, Y.: Core congestion is inherent in hyperbolic networks. In: Proceedings of the 28th annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, January 16\u201319, 2017, pp. 2264\u20132279. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (2017). https:\/\/doi.org\/10.1137\/1.9781611974782.149","DOI":"10.1137\/1.9781611974782.149"},{"key":"18_CR7","doi-asserted-by":"publisher","unstructured":"Chepoi, V., Estellon, B.: Packing and covering $$\\delta $$-hyperbolic spaces by balls. In: Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 10th international workshop, APPROX 2007, and 11th international workshop, RANDOM 2007, Princeton, NJ, USA, August 20\u201322, 2007. Proceedings, pp. 59\u201373. Berlin: Springer (2007). https:\/\/doi.org\/10.1007\/978-3-540-74208-1_5","DOI":"10.1007\/978-3-540-74208-1_5"},{"key":"18_CR8","unstructured":"Davies, J., Hickingbotham, R., Illingworth, F., McCarty, R.: Fat minors cannot be thinned (by quasi-isometries). Preprint, arXiv:2405.09383 (2024). https:\/\/arxiv.org\/abs\/2405.09383"},{"key":"18_CR9","unstructured":"Dujmovi\u0107, V., Joret, G., Micek, P., Morin, P.: Erd\u0151s-P\u00f3sa property of cycles that are far apart. Preprint, arXiv:2412.13893 (2024). https:\/\/arxiv.org\/abs\/2412.13893"},{"issue":"2","key":"18_CR10","doi-asserted-by":"publisher","first-page":"1840","DOI":"10.1137\/23M1564511","volume":"38","author":"M Dumas","year":"2024","unstructured":"Dumas, M., Foucaud, F., Perez, A., Todinca, I.: On graphs coverable by $$k$$ shortest paths. SIAM J. Discret. Math. 38(2), 1840\u20131862 (2024). https:\/\/doi.org\/10.1137\/23M1564511","journal-title":"SIAM J. Discret. Math."},{"key":"18_CR11","unstructured":"Georgakopoulos, A., Papasoglu, P.: Graph minors and metric spaces. Preprint, arXiv:2305.07456 (2023). https:\/\/arxiv.org\/abs\/2305.07456"},{"key":"18_CR12","unstructured":"Hatzel, M., Pilipczuk, M.: On graphs coverable by chubby shortest paths (2025). https:\/\/arxiv.org\/abs\/2503.02160"},{"key":"18_CR13","unstructured":"Hickingbotham, R.: Graphs quasi-isometric to graphs with bounded treewidth. Preprint, arXiv:2501.10840 (2025). https:\/\/arxiv.org\/abs\/2501.10840"},{"key":"18_CR14","unstructured":"Nguyen, T., Scott, A., Seymour, P.: Coarse tree-width. Preprint, arXiv:2501.09839 (2025). https:\/\/arxiv.org\/abs\/2501.09839"},{"key":"18_CR15","doi-asserted-by":"publisher","unstructured":"Nguyen, T., Scott, A., Seymour, P.: A counterexample to the coarse Menger conjecture. J. Comb. Theory Ser. B 173, 68\u201382 (2025). https:\/\/doi.org\/10.1016\/j.jctb.2025.01.004, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0095895625000061","DOI":"10.1016\/j.jctb.2025.01.004"},{"issue":"5","key":"18_CR16","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1016\/J.EJC.2008.11.010","volume":"30","author":"DR Wood","year":"2009","unstructured":"Wood, D.R.: On tree-partition-width. Eur. J. Comb. 30(5), 1245\u20131253 (2009). https:\/\/doi.org\/10.1016\/J.EJC.2008.11.010","journal-title":"Eur. J. Comb."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-11835-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:42:03Z","timestamp":1767314523000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11835-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032118349","9783032118356"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11835-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Otzenhausen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo.uni-trier.de\/wg2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}