{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:06:49Z","timestamp":1757311609772,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100007655","name":"Cesk\u00e9 Vysok\u00e9 Ucen\u00ed Technick\u00e9 v Praze","doi-asserted-by":"publisher","award":["CZ.02.1.01\/0.0\/0.0\/16_019\/0000765","SGS20\/212\/OHK3\/3T\/18"],"award-info":[{"award-number":["CZ.02.1.01\/0.0\/0.0\/16_019\/0000765","SGS20\/212\/OHK3\/3T\/18"]}],"id":[{"id":"10.13039\/100007655","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s00453-022-01006-x","type":"journal-article","created":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T06:02:47Z","timestamp":1659333767000},"page":"762-782","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters"],"prefix":"10.1007","volume":"85","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2546-5344","authenticated-orcid":false,"given":"Martin","family":"Ku\u010dera","sequence":"first","affiliation":[]},{"given":"Ond\u0159ej","family":"Such\u00fd","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,1]]},"reference":[{"key":"1006_CR1","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-319-21840-3_23","volume-title":"Algorithms and Data Structures","author":"FF Dragan","year":"2015","unstructured":"Dragan, F.F., Leitert, A.: On the minimum eccentricity shortest path problem. In: Dehne, F., Sack, J.-R., Stege, U. (eds.) Algorithms and Data Structures, pp. 276\u2013288. Springer, Cham (2015)"},{"unstructured":"V\u00f6lkel, F., Bapteste, E., Habib, M., Lopez, P., Vigliotti, C.: Read networks and k-laminar graphs. CoRR abs\/1603.01179 (2016) arXiv:1603.01179","key":"1006_CR2"},{"doi-asserted-by":"crossref","unstructured":"Tenenbaum, J.B., Silva, V.d., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290 (5500), 2319\u20132323 (2000) https:\/\/science.sciencemag.org\/content\/290\/5500\/2319.full.pdf","key":"1006_CR3","DOI":"10.1126\/science.290.5500.2319"},{"doi-asserted-by":"crossref","unstructured":"Indyk, P.: Algorithmic applications of low-distortion geometric embeddings. In: FOCS 2001, pp. 10\u201333. IEEE Computer Society, Newport Beach, CA, USA (2001)","key":"1006_CR4","DOI":"10.1109\/SFCS.2001.959878"},{"doi-asserted-by":"crossref","unstructured":"Indyk, P., Matousek, J.: Low-distortion embeddings of finite metric spaces. In: Handbook of Discrete and Computational Geometry, pp. 177\u2013196. CRC, New York (2004)","key":"1006_CR5","DOI":"10.1201\/9781420035315.ch8"},{"key":"1006_CR6","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-319-48749-6_16","volume-title":"Combinatorial Optimization and Applications","author":"\u00c9 Birmel\u00e9","year":"2016","unstructured":"Birmel\u00e9, \u00c9., de Montgolfier, F., Planche, L.: Minimum eccentricity shortest path problem: An approximation algorithm and relation with the k-laminarity problem. In: Chan, T.-H.H., Li, M., Wang, L. (eds.) Combinatorial Optimization and Applications, pp. 216\u2013229. Springer, Cham (2016)"},{"issue":"2","key":"1006_CR7","doi-asserted-by":"publisher","first-page":"299","DOI":"10.7155\/jgaa.00394","volume":"20","author":"FF Dragan","year":"2016","unstructured":"Dragan, F.F., Leitert, A.: Minimum eccentricity shortest paths in some structured graph classes. J. Graph Algorithms Appl. 20(2), 299\u2013322 (2016)","journal-title":"J. Graph Algorithms Appl."},{"key":"1006_CR8","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.tcs.2017.07.004","volume":"694","author":"FF Dragan","year":"2017","unstructured":"Dragan, F.F., Leitert, A.: On the minimum eccentricity shortest path problem. Theor. Comput. Sci. 694, 66\u201378 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"1006_CR9","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/j.dam.2020.03.060","volume":"284","author":"E Birmel\u00e9","year":"2020","unstructured":"Birmel\u00e9, E., de Montgolfier, F., Planche, L., Viennot, L.: Decomposing a graph into shortest paths with bounded eccentricity. Discret. Appl. Math. 284, 353\u2013374 (2020)","journal-title":"Discret. Appl. Math."},{"doi-asserted-by":"publisher","unstructured":"Birmel\u00e9, E., de Montgolfier, F., Planche, L., Viennot, L.: Decomposing a Graph into Shortest Paths with Bounded Eccentricity. In: Okamoto, Y., Tokuyama, T. (eds.) 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol. 92, pp. 15\u201311513. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2017.15. http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2017\/8262","key":"1006_CR10","DOI":"10.4230\/LIPIcs.ISAAC.2017.15"},{"unstructured":"Sorge, M., Weller, M.: The Graph Parameter Hierarchy (2016). https:\/\/manyu.pro\/assets\/parameter-hierarchy.pdf","key":"1006_CR11"},{"doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, 5th Edition. Graduate texts in mathematics, vol. 173. Springer, Berlin, Heidelberg (2016)","key":"1006_CR12","DOI":"10.1007\/978-3-662-53622-3_7"},{"key":"1006_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Cham (2015)"},{"key":"1006_CR14","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-319-03898-8_15","volume-title":"Parameterized and Exact Computation","author":"J Gajarsk\u00fd","year":"2013","unstructured":"Gajarsk\u00fd, J., Lampis, M., Ordyniak, S.: Parameterized algorithms for modular-width. In: Gutin, G., Szeider, S. (eds.) Parameterized and Exact Computation, pp. 163\u2013176. Springer, Cham (2013)"},{"key":"1006_CR15","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1007\/978-3-540-70575-8_52","volume-title":"Automata, Languages and Programming","author":"M Tedder","year":"2008","unstructured":"Tedder, M., Corneil, D., Habib, M., Paul, C.: Simpler linear-time modular decomposition via recursive factorizing permutations. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) Automata, Languages and Programming, pp. 634\u2013645. Springer, Berlin, Heidelberg (2008)"},{"issue":"2","key":"1006_CR16","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s00224-015-9631-7","volume":"58","author":"A Boral","year":"2016","unstructured":"Boral, A., Cygan, M., Kociumaka, T., Pilipczuk, M.: A fast branching algorithm for cluster vertex deletion. Theory Comput. Syst. 58(2), 357\u2013376 (2016)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"1006_CR17","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. i. recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990). https:\/\/doi.org\/10.1016\/0890-5401(90)90043-H","journal-title":"Inf. Comput."},{"issue":"2","key":"1006_CR18","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12(2), 308\u2013340 (1991). https:\/\/doi.org\/10.1016\/0196-6774(91)90006-K","journal-title":"J. Algorithms"},{"unstructured":"Bouland, A.M.: Parameterized complexity and graph isomorphism. Master\u2019s thesis, University of Cambridge (2011)","key":"1006_CR19"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-01006-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-022-01006-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-01006-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,3]],"date-time":"2023-03-03T15:05:46Z","timestamp":1677855946000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-022-01006-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,1]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["1006"],"URL":"https:\/\/doi.org\/10.1007\/s00453-022-01006-x","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2022,8,1]]},"assertion":[{"value":"18 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}