{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T22:49:08Z","timestamp":1774910948427,"version":"3.50.1"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032205360","type":"print"},{"value":"9783032205377","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-20537-7_5","type":"book-chapter","created":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T14:33:04Z","timestamp":1773757984000},"page":"68-84","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Methods for\u00a0Finding Paths of\u00a0a\u00a0Prescribed Length in\u00a0Weighted Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-3974-0262","authenticated-orcid":false,"given":"Daniel","family":"Hambly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1046-811X","authenticated-orcid":false,"given":"Rhyd","family":"Lewis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Padraig","family":"Corcoran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,18]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Aggarwal, S., Kumar, N.: Path planning techniques for unmanned aerial vehicles: a review, solutions, and challenges. Comput. Commun. 149, 270\u2013299 (2020). https:\/\/doi.org\/10.1016\/j.comcom.2019.10.014. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0140366419308539","DOI":"10.1016\/j.comcom.2019.10.014"},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs. In: Leighton, F.T., Goodrich, M.T. (eds.) Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, Montr\u00e9al, Qu\u00e9bec, Canada, 23\u201325 May 1994, pp. 326\u2013335. ACM (1994). https:\/\/doi.org\/10.1145\/195058.195179","DOI":"10.1145\/195058.195179"},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Azaron, A., Katagiri, H., Kato, K., Sakawa, M.: Longest path analysis in networks of queues: dynamic scheduling problems. Eur. J. Oper. Res. 174(1), 132\u2013149 (2006). https:\/\/doi.org\/10.1016\/j.ejor.2005.02.018. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221705002122","DOI":"10.1016\/j.ejor.2005.02.018"},{"issue":"5","key":"5_CR4","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1051\/ita\/1997310504291","volume":"31","author":"S Basagni","year":"1997","unstructured":"Basagni, S., Bruschi, D., Ravasio, F.: On the difficulty of finding walks of length k. RAIRO Theor. Inform. Appl. 31(5), 429\u2013435 (1997). https:\/\/doi.org\/10.1051\/ita\/1997310504291","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.jcss.2017.03.003","volume":"87","author":"A Bj\u00f6rklund","year":"2017","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Narrow sieves for parameterized paths and packings. J. Comput. Syst. Sci. 87, 119\u2013139 (2017). https:\/\/doi.org\/10.1016\/j.jcss.2017.03.003","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1993.1001","volume":"14","author":"HL Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: On linear time minor tests with depth-first search. J. Algorithms 14(1), 1\u201323 (1993). https:\/\/doi.org\/10.1006\/jagm.1993.1001","journal-title":"J. Algorithms"},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Boeing, G.: Modeling and analyzing urban networks and amenities with osmnx. Geographical Analysis (2025). https:\/\/doi.org\/10.1111\/gean.70009, published online ahead of print","DOI":"10.1111\/gean.70009"},{"key":"5_CR8","unstructured":"Chen, J., Lu, S., Sze, S., Zhang, F.: Improved algorithms for path, matching, and packing problems. In: Bansal, N., Pruhs, K., Stein, C. (eds.) Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, 7\u20139 January 2007, vol.\u00a07, pp. 298\u2013307. Citeseer, SIAM (2007). http:\/\/dl.acm.org\/citation.cfm?id=1283383.1283415"},{"key":"5_CR9","doi-asserted-by":"publisher","unstructured":"Dueck, G.: New optimization heuristics: the great deluge algorithm and the record-to-record travel. J. Comput. Phys. 104(1), 86\u201392 (1993). https:\/\/doi.org\/10.1006\/jcph.1993.1010. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0021999183710107","DOI":"10.1006\/jcph.1993.1010"},{"key":"5_CR10","doi-asserted-by":"publisher","unstructured":"Eppstein, D.: Finding the k shortest paths. SIAM J. Comput. 28(2), 652\u2013673 (1998). https:\/\/doi.org\/10.1137\/S0097539795290477. https:\/\/doi.org\/10.1137\/S0097539795290477","DOI":"10.1137\/S0097539795290477"},{"issue":"4","key":"5_CR11","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1137\/S0097539703427203","volume":"33","author":"J Flum","year":"2004","unstructured":"Flum, J., Grohe, M.: The parameterized complexity of counting problems. SIAM J. Comput. 33(4), 892\u2013922 (2004). https:\/\/doi.org\/10.1137\/S0097539703427203","journal-title":"SIAM J. Comput."},{"issue":"2","key":"5_CR12","doi-asserted-by":"publisher","first-page":"878","DOI":"10.1137\/130936816","volume":"28","author":"FV Fomin","year":"2014","unstructured":"Fomin, F.V., Golovach, P.A.: Long circuits and large Euler subgraphs. SIAM J. Discret. Math. 28(2), 878\u2013892 (2014). https:\/\/doi.org\/10.1137\/130936816","journal-title":"SIAM J. Discret. Math."},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Lokshtanov, D., Panolan, F., Saurabh, S.: Efficient computation of representative families with applications in parameterized and exact algorithms. J. ACM 63(4), 29:1\u201329:60 (2016). https:\/\/doi.org\/10.1145\/2886094","DOI":"10.1145\/2886094"},{"key":"5_CR14","doi-asserted-by":"publisher","unstructured":"Gao, Y., Na, J., Zhang, B., Yang, L., Gong, Q.: Optimal web services selection using dynamic programming. In: Proceedings of the 11th IEEE Symposium on Computers and Communications, ISCC 2006, pp. 365\u2013370. IEEE Computer Society, USA (2006). https:\/\/doi.org\/10.1109\/ISCC.2006.116","DOI":"10.1109\/ISCC.2006.116"},{"key":"5_CR15","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, USA (1979)"},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Hambly, D., Lewis, R., Corcoran, P.: Determining fixed-length paths in directed and undirected edge-weighted graphs. In: Liberti, L. (ed.) 22nd International Symposium on Experimental Algorithms (SEA 2024). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0301, pp. 15:1\u201315:11. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2024). https:\/\/doi.org\/10.4230\/LIPIcs.SEA.2024.15. https:\/\/drops.dagstuhl.de\/entities\/document\/10.4230\/LIPIcs.SEA.2024.15","DOI":"10.4230\/LIPIcs.SEA.2024.15"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Hetland, M.: Python Algorithms: Mastering Basic Algorithms in the Python Language. Professional and Applied Computing. Apress (2011). https:\/\/books.google.co.uk\/books?id=4cytGpIPYsAC","DOI":"10.1007\/978-1-4302-3238-4"},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"Kelley, B.P., et al.: Conserved pathways within bacteria and yeast as revealed by global protein network alignment. Proc. Natl. Acad. Sci. 100(20), 11394\u201311399 (2003). https:\/\/doi.org\/10.1073\/pnas.1534710100. https:\/\/www.pnas.org\/doi\/abs\/10.1073\/pnas.1534710100","DOI":"10.1073\/pnas.1534710100"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/11917496_6","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J Kneis","year":"2006","unstructured":"Kneis, J., M\u00f6lle, D., Richter, S., Rossmanith, P.: Divide-and-color. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 58\u201367. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11917496_6"},{"key":"5_CR20","doi-asserted-by":"publisher","unstructured":"Kocay, W., Kreher, D.: Graphs, Algorithms, and Optimization, 2nd edn. CRC Press (2016). https:\/\/doi.org\/10.1201\/9781315372563","DOI":"10.1201\/9781315372563"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/978-3-540-70575-8_47","volume-title":"Automata, Languages and Programming","author":"I Koutis","year":"2008","unstructured":"Koutis, I.: Faster algebraic algorithms for path and packing problems. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5125, pp. 575\u2013586. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70575-8_47"},{"issue":"3","key":"5_CR22","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10732-022-09493-5","volume":"28","author":"R Lewis","year":"2022","unstructured":"Lewis, R., Corcoran, P.: Finding fixed-length circuits and cycles in undirected edge-weighted graphs: an application with street networks. J. Heuristics 28(3), 259\u2013285 (2022). https:\/\/doi.org\/10.1007\/s10732-022-09493-5","journal-title":"J. Heuristics"},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Lewis, R., Corcoran, P.: Fast algorithms for computing fixed-length round trips in real-world street networks. SN Comput. Sci. 5 (2024). https:\/\/doi.org\/10.1007\/s42979-024-03223-3","DOI":"10.1007\/s42979-024-03223-3"},{"issue":"5","key":"5_CR24","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10878-023-01091-w","volume":"46","author":"R Lewis","year":"2023","unstructured":"Lewis, R., Corcoran, P., Gagarin, A.V.: Methods for determining cycles of a specific length in undirected graphs with edge weights. J. Comb. Optim. 46(5), 29 (2023). https:\/\/doi.org\/10.1007\/s10878-023-01091-w","journal-title":"J. Comb. Optim."},{"key":"5_CR25","doi-asserted-by":"publisher","unstructured":"Monien, B.: How to find long paths efficiently. In: Ausiello, G., Lucertini, M. (eds.) Analysis and Design of Algorithms for Combinatorial Problems, North-Holland Mathematics Studies, vol.\u00a0109, pp. 239\u2013254. North-Holland (1985). https:\/\/doi.org\/10.1016\/S0304-0208(08)73110-4. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304020808731104","DOI":"10.1016\/S0304-0208(08)73110-4"},{"issue":"2","key":"5_CR26","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1006\/jcss.1996.0058","volume":"53","author":"CH Papadimitriou","year":"1996","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On limited nondeterminism and the complexity of the V-C dimension. J. Comput. Syst. Sci. 53(2), 161\u2013170 (1996). https:\/\/doi.org\/10.1006\/jcss.1996.0058","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"5_CR27","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1089\/cmb.2006.13.133","volume":"13","author":"J Scott","year":"2006","unstructured":"Scott, J., Ideker, T., Karp, R.M., Sharan, R.: Efficient algorithms for detecting signaling pathways in protein interaction networks. J. Comput. Biol. 13(2), 133\u2013144 (2006). https:\/\/doi.org\/10.1089\/cmb.2006.13.133","journal-title":"J. Comput. Biol."},{"key":"5_CR28","unstructured":"Sedgewick, R., Schidlowsky, M.: Algorithms in Java, Part 5: Graph Algorithms, 3rd edn. Addison-Wesley Longman Publishing Co., Inc., USA (2003)"},{"key":"5_CR29","unstructured":"Sedgewick, R., Wayne, K.: Algorithms, 4th edn. Addison-Wesley (2011)"},{"key":"5_CR30","doi-asserted-by":"publisher","unstructured":"Suurballe, J.W.: Disjoint paths in a network. Networks 4(2), 125\u2013145 (1974). https:\/\/doi.org\/10.1002\/net.3230040204. https:\/\/onlinelibrary.wiley.com\/doi\/abs\/10.1002\/net.3230040204","DOI":"10.1002\/net.3230040204"},{"key":"5_CR31","unstructured":"Tamassia, R.: Handbook of Graph Drawing and Visualization, 1st edn. Chapman & Hall\/CRC (2016)"},{"key":"5_CR32","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.tcs.2019.04.024","volume":"790","author":"D Tsur","year":"2019","unstructured":"Tsur, D.: Faster deterministic parameterized algorithm for k-path. Theor. Comput. Sci. 790, 96\u2013104 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2019.04.024","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"5_CR33","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8(3), 410\u2013421 (1979). https:\/\/doi.org\/10.1137\/0208032","journal-title":"SIAM J. Comput."},{"key":"5_CR34","series-title":"Operations Research Proceedings","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-319-89920-6_45","volume-title":"Operations Research Proceedings 2017","author":"D Willems","year":"2018","unstructured":"Willems, D., Zehner, O., Ruzika, S.: On a technique for finding running tracks of specific length in a road network. In: Kliewer, N., Ehmke, J.F., Bornd\u00f6rfer, R. (eds.) Operations Research Proceedings 2017. ORP, pp. 333\u2013338. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89920-6_45"},{"key":"5_CR35","doi-asserted-by":"publisher","unstructured":"Williams, R.: Finding paths of length k in o$$ ^{\\text{*}}$$(2$$ ^{\\text{k }}$$) time. Inf. Process. Lett. 109(6), 315\u2013318 (2009). https:\/\/doi.org\/10.1016\/j.ipl.2008.11.004","DOI":"10.1016\/j.ipl.2008.11.004"},{"key":"5_CR36","doi-asserted-by":"publisher","unstructured":"Wong, W.Y., Lau, T.P., King, I.: Information retrieval in P2P networks using genetic algorithm. In: Special Interest Tracks and Posters of the 14th International Conference on World Wide Web, WWW 2005, pp. 922\u2013923. Association for Computing Machinery, New York, NY, USA (2005). https:\/\/doi.org\/10.1145\/1062745.1062799","DOI":"10.1145\/1062745.1062799"},{"key":"5_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1007\/978-3-662-48350-3_86","volume-title":"Algorithms - ESA 2015","author":"M Zehavi","year":"2015","unstructured":"Zehavi, M.: Mixing color coding-related techniques. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 1037\u20131049. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48350-3_86"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-20537-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T22:03:02Z","timestamp":1774908182000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-20537-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032205360","9783032205377"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-20537-7_5","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":"18 March 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":"EvoCOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2026\/evocop\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}