{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:10:14Z","timestamp":1758586214175,"version":"3.44.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032046994","type":"print"},{"value":"9783032047007","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"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-04700-7_12","type":"book-chapter","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:42Z","timestamp":1758498342000},"page":"150-164","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Complexity of\u00a0Locally Rainbow Path"],"prefix":"10.1007","author":[{"given":"Hiroshi","family":"Eto","sequence":"first","affiliation":[]},{"given":"Tesshu","family":"Hanaka","sequence":"additional","affiliation":[]},{"given":"Eiji","family":"Miyano","sequence":"additional","affiliation":[]},{"given":"Shuya","family":"Yoshida","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,11]]},"reference":[{"issue":"4","key":"12_CR1","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844\u2013856 (1995). https:\/\/doi.org\/10.1145\/210332.210337","journal-title":"J. ACM"},{"issue":"2","key":"12_CR2","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"},{"issue":"4","key":"12_CR3","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/S00373-017-1808-1","volume":"33","author":"O Bendele","year":"2017","unstructured":"Bendele, O., Rautenbach, D.: Optimal colorings with rainbow paths. Graphs Comb. 33(4), 729\u2013734 (2017). https:\/\/doi.org\/10.1007\/S00373-017-1808-1","journal-title":"Graphs Comb."},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/J.TCS.2022.08.023","volume":"933","author":"M Bentert","year":"2022","unstructured":"Bentert, M., Kellerhals, L., Niedermeier, R.: The structural complexity landscape of finding balance-fair shortest paths. Theor. Comput. Sci. 933, 149\u2013162 (2022). https:\/\/doi.org\/10.1016\/J.TCS.2022.08.023","journal-title":"Theor. Comput. Sci."},{"key":"12_CR5","doi-asserted-by":"publisher","unstructured":"Bentert, M., Kellerhals, L., Niedermeier, R.: Fair short paths in vertex-colored graphs. In: Williams, B., Chen, Y., Neville, J. (eds.) Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023, pp. 12346\u201312354. AAAI Press (2023). https:\/\/doi.org\/10.1609\/AAAI.V37I10.26455","DOI":"10.1609\/AAAI.V37I10.26455"},{"issue":"5 &6","key":"12_CR6","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/BF01758777","volume":"7","author":"RB Borie","year":"1992","unstructured":"Borie, R.B., Parker, R.G., Tovey, C.A.: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica 7(5 &6), 555\u2013581 (1992). https:\/\/doi.org\/10.1007\/BF01758777","journal-title":"Algorithmica"},{"issue":"2","key":"12_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1002\/NET.20296","volume":"54","author":"G Chartrand","year":"2009","unstructured":"Chartrand, G., Johns, G.L., McKeon, K.A., Zhang, P.: The rainbow connectivity of a graph. Networks 54(2), 75\u201381 (2009). https:\/\/doi.org\/10.1002\/NET.20296","journal-title":"Networks"},{"issue":"35","key":"12_CR8","doi-asserted-by":"publisher","first-page":"4531","DOI":"10.1016\/J.TCS.2011.04.032","volume":"412","author":"L Chen","year":"2011","unstructured":"Chen, L., Li, X., Shi, Y.: The complexity of determining the rainbow vertex-connection of a graph. Theor. Comput. Sci. 412(35), 4531\u20134535 (2011). https:\/\/doi.org\/10.1016\/J.TCS.2011.04.032","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"12_CR9","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/S10878-019-00416-Y","volume":"42","author":"J Cohen","year":"2021","unstructured":"Cohen, J., Italiano, G.F., Manoussakis, Y., Nguyen, K.T., Pham, H.P.: Tropical paths in vertex-colored graphs. J. Comb. Optim. 42(3), 476\u2013498 (2021). https:\/\/doi.org\/10.1007\/S10878-019-00416-Y","journal-title":"J. Comb. Optim."},{"key":"12_CR10","doi-asserted-by":"publisher","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, https:\/\/doi.org\/10.1016\/0890-5401(90)90043-H","DOI":"10.1016\/0890-5401(90)90043-H"},{"key":"12_CR11","doi-asserted-by":"publisher","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","DOI":"10.1016\/0890-5401(90)90043-H"},{"key":"12_CR12","doi-asserted-by":"publisher","unstructured":"Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3","DOI":"10.1007\/978-3-319-21275-3"},{"key":"12_CR13","doi-asserted-by":"publisher","unstructured":"Eiben, E., Kanj, I.: A colored path problem and its applications. ACM Trans. Algorithms 16(4), 47:1\u201347:48 (2020). https:\/\/doi.org\/10.1145\/3396573","DOI":"10.1145\/3396573"},{"key":"12_CR14","doi-asserted-by":"publisher","unstructured":"Fluschnik, T., Kellerhals, L., Renken, M.: Locally rainbow paths. In: Wooldridge, M.J., Dy, J.G., Natarajan, S. (eds.) Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2024, Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence, IAAI 2024, Fourteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2014, February 20-27, 2024, Vancouver, Canada, pp. 8013\u20138021. AAAI Press (2024). https:\/\/doi.org\/10.1609\/AAAI.V38I8.28639","DOI":"10.1609\/AAAI.V38I8.28639"},{"key":"12_CR15","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Golovach, P.A., Korhonen, T., Simonov, K., Stamoulis, G.: Fixed-parameter tractability of maximum colored path and beyond. ACM Trans. Algorithms 20(4), 36:1\u201336:48 (2024). https:\/\/doi.org\/10.1145\/3674835","DOI":"10.1145\/3674835"},{"key":"12_CR16","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, W. H (1979)"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/J.TCS.2016.03.017","volume":"628","author":"L Kowalik","year":"2016","unstructured":"Kowalik, L., Lauri, J.: On finding rainbow and colorful paths. Theor. Comput. Sci. 628, 110\u2013114 (2016). https:\/\/doi.org\/10.1016\/J.TCS.2016.03.017","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"12_CR18","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1002\/JGT.20418","volume":"63","author":"M Krivelevich","year":"2010","unstructured":"Krivelevich, M., Yuster, R.: The rainbow connection of a graph is (at most) reciprocal to its minimum degree. J. Graph Theory 63(3), 185\u2013191 (2010). https:\/\/doi.org\/10.1002\/JGT.20418","journal-title":"J. Graph Theory"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/J.DAM.2015.07.041","volume":"201","author":"J Lauri","year":"2016","unstructured":"Lauri, J.: Further hardness results on rainbow and strong rainbow connectivity. Discret. Appl. Math. 201, 191\u2013200 (2016). https:\/\/doi.org\/10.1016\/J.DAM.2015.07.041","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"12_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/S00373-012-1243-2","volume":"29","author":"X Li","year":"2013","unstructured":"Li, X., Shi, Y., Sun, Y.: Rainbow connections of graphs: a survey. Graphs Comb. 29(1), 1\u201338 (2013). https:\/\/doi.org\/10.1007\/S00373-012-1243-2","journal-title":"Graphs Comb."},{"key":"12_CR21","doi-asserted-by":"publisher","unstructured":"Libkin, L.: Elements of finite model theory. texts in theoretical computer science. An EATCS Series, Springer (2004). https:\/\/doi.org\/10.1007\/978-3-662-07003-1, http:\/\/www.cs.toronto.edu\/%7Elibkin\/fmt","DOI":"10.1007\/978-3-662-07003-1"},{"key":"12_CR22","doi-asserted-by":"publisher","unstructured":"Sparsity. AC, vol. 28. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27875-4","DOI":"10.1007\/978-3-642-27875-4"},{"key":"12_CR23","unstructured":"Sorge1, M., Weller, M.: The graph parameter hierarchy (2019). https:\/\/manyu.pro\/assets\/parameter-hierarchy.pdf"},{"issue":"2","key":"12_CR24","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/S00453-012-9689-4","volume":"67","author":"K Uchizawa","year":"2013","unstructured":"Uchizawa, K., Aoki, T., Ito, T., Suzuki, A., Zhou, X.: On the rainbow connectivity of graphs: complexity and FPT algorithms. Algorithmica 67(2), 161\u2013179 (2013). https:\/\/doi.org\/10.1007\/S00453-012-9689-4","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-04700-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:43Z","timestamp":1758498343000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04700-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,11]]},"ISBN":["9783032046994","9783032047007"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04700-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,11]]},"assertion":[{"value":"11 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wroc\u0142aw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","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":"15 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/fct.ii.uni.wroc.pl","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}