{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,24]],"date-time":"2026-10-24T02:12:27Z","timestamp":1792807947752,"version":"4.5.0"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031555978","type":"print"},{"value":"9783031555985","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-55598-5_3","type":"book-chapter","created":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T13:01:53Z","timestamp":1709643713000},"page":"35-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Enumerating m-Length Walks in\u00a0Directed Graphs with\u00a0Constant Delay"],"prefix":"10.1007","author":[{"given":"Duncan","family":"Adamson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pawe\u0142","family":"Gawrychowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Florin","family":"Manea","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,3,6]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-02882-3_19","volume-title":"Computing and Combinatorics","author":"M Ackerman","year":"2009","unstructured":"Ackerman, M., M\u00e4kinen, E.: Three new algorithms for regular language enumeration. In: Ngo, H.Q. (ed.) COCOON 2009. LNCS, vol. 5609, pp. 178\u2013191. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02882-3_19"},{"issue":"37","key":"3_CR2","doi-asserted-by":"publisher","first-page":"3461","DOI":"10.1016\/j.tcs.2009.03.018","volume":"410","author":"M Ackerman","year":"2009","unstructured":"Ackerman, M., Shallit, J.: Efficient enumeration of words in regular languages. Theoret. Comput. Sci. 410(37), 3461\u20133470 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Adamson, D., Gawrychowski, P., Manea, F.: Enumerating m-length walks in directed graphs with constant delay (2024)","DOI":"10.1007\/978-3-031-55598-5_3"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Amarilli, A., Bourhis, P., Mengel, S., Niewerth, M.: Constant-delay enumeration for nondeterministic document spanners. ACM Trans. Database Syst. 46(1), 2:1\u20132:30 (2021)","DOI":"10.1145\/3436487"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Amarilli, A., Jachiet, L., Mu\u00f1oz, M., Riveros, C.: Efficient enumeration for annotated grammars. In: PODS 2022, pp. 291\u2013300. ACM (2022)","DOI":"10.1145\/3517804.3526232"},{"key":"3_CR6","unstructured":"Amarilli, A., Monet, M.: Enumerating regular languages with bounded delay. In: STACS 2023. LIPIcs, vol.\u00a0254, pp. 8:1\u20138:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/10719839_9","volume-title":"LATIN 2000: Theoretical Informatics","author":"MA Bender","year":"2000","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88\u201394. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10719839_9"},{"issue":"1","key":"3_CR8","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.tcs.2003.05.002","volume":"321","author":"MA Bender","year":"2004","unstructured":"Bender, M.A., Farach-Colton, M.: The level ancestor problem simplified. Theoret. Comput. Sci. 321(1), 5\u201312 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Birmel\u00e9, E., et al.: Optimal listing of cycles and st-Paths in undirected graphs. In: SODA 2013, pp. 1884\u20131896. SIAM (2013)","DOI":"10.1137\/1.9781611973105.134"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Cevorov\u00e1, K., Jir\u00e1skov\u00e1, G., Mlyn\u00e1rcik, P., Palmovsk\u00fd, M., Sebej, J.: Operations on automata with all states final. In: AFL 2014. EPTCS, vol.\u00a0151, pp. 201\u2013215 (2014)","DOI":"10.4204\/EPTCS.151.14"},{"issue":"7657","key":"3_CR11","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1038\/nature22374","volume":"546","author":"C Collins","year":"2017","unstructured":"Collins, C., et al.: Accelerated discovery of two crystal structure types in a complex inorganic phase field. Nature 546(7657), 280\u2013284 (2017)","journal-title":"Nature"},{"issue":"3","key":"3_CR12","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1109\/TCT.1968.1082837","volume":"15","author":"G Danielson","year":"1968","unstructured":"Danielson, G.: On finding the simple paths and circuits in a graph. IEEE Trans. Circuit Theory 15(3), 294\u2013295 (1968)","journal-title":"IEEE Trans. Circuit Theory"},{"issue":"3","key":"3_CR13","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/s00453-012-9683-x","volume":"68","author":"ED Demaine","year":"2014","unstructured":"Demaine, E.D., Landau, G.M., Weimann, O.: On Cartesian trees and range minimum queries. Algorithmica 68(3), 610\u2013625 (2014)","journal-title":"Algorithmica"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/978-3-319-77404-6_40","volume-title":"LATIN 2018: Theoretical Informatics","author":"R Grossi","year":"2018","unstructured":"Grossi, R., Marino, A., Versari, L.: Efficient algorithms for listing k disjoint st-Paths in graphs. In: Bender, M.A., Farach-Colton, M., Mosteiro, M.A. (eds.) LATIN 2018. LNCS, vol. 10807, pp. 544\u2013557. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77404-6_40"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"459","DOI":"10.4171\/automata-1\/13","volume-title":"Handbook of Automata Theory","author":"H Gruber","year":"2021","unstructured":"Gruber, H., Lee, J., Shallit, J.O.: Enumerating regular expressions and their languages. In: Pin, J. (ed.) Handbook of Automata Theory, pp. 459\u2013491. European Mathematical Society Publishing House, Z\u00fcrich, Switzerland (2021)"},{"issue":"7968","key":"3_CR16","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1038\/s41586-023-06071-y","volume":"619","author":"VV Gusev","year":"2023","unstructured":"Gusev, V.V., et al.: Optimality guarantees for crystal structure prediction. Nature 619(7968), 68\u201372 (2023)","journal-title":"Nature"},{"key":"3_CR17","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, London (1979)"},{"issue":"2","key":"3_CR18","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1109\/TCT.1967.1082699","volume":"14","author":"T Kamae","year":"1967","unstructured":"Kamae, T.: A systematic method of finding all directed circuits and enumerating all directed paths. IEEE Trans. Circuit Theory 14(2), 166\u2013171 (1967)","journal-title":"IEEE Trans. Circuit Theory"},{"issue":"47\u201349","key":"3_CR19","doi-asserted-by":"publisher","first-page":"5010","DOI":"10.1016\/j.tcs.2009.07.049","volume":"410","author":"J Kao","year":"2009","unstructured":"Kao, J., Rampersad, N., Shallit, J.O.: On NFAs where all states are final, initial, or both. Theoret. Comput. Sci. 410(47\u201349), 5010\u20135021 (2009)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"3_CR20","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1137\/0205007","volume":"5","author":"P Mateti","year":"1976","unstructured":"Mateti, P., Deo, N.: On algorithms for enumerating all circuits of a graph. SIAM J. Comput. 5(1), 90\u201399 (1976)","journal-title":"SIAM J. Comput."},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1039\/C8FD90033G","volume":"211","author":"AR Oganov","year":"2018","unstructured":"Oganov, A.R.: Crystal structure prediction: reflections on present status and challenges. Faraday Discuss. 211, 643\u2013660 (2018)","journal-title":"Faraday Discuss."},{"issue":"3","key":"3_CR22","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1002\/net.1975.5.3.237","volume":"5","author":"RC Read","year":"1975","unstructured":"Read, R.C., Tarjan, R.E.: Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks 5(3), 237\u2013252 (1975)","journal-title":"Networks"},{"issue":"8","key":"3_CR23","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1109\/TCS.1978.1084515","volume":"25","author":"F Rubin","year":"1978","unstructured":"Rubin, F.: Enumerating all simple paths in a graph. IEEE Trans. Circuits Syst. 25(8), 641\u2013642 (1978)","journal-title":"IEEE Trans. Circuits Syst."},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/3-540-44968-X_33","volume-title":"Computing and Combinatorics","author":"F Ruskey","year":"2000","unstructured":"Ruskey, F., Sawada, J.: Generating necklaces and strings with forbidden substrings. In: Du, D.-Z.-Z., Eades, P., Estivill-Castro, V., Lin, X., Sharma, A. (eds.) COCOON 2000. LNCS, vol. 1858, pp. 330\u2013339. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44968-X_33"},{"issue":"1","key":"3_CR25","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1137\/S0097539700377037","volume":"31","author":"J Sawada","year":"2001","unstructured":"Sawada, J.: Generating bracelets in constant amortized time. SIAM J. Comput. 31(1), 259\u2013268 (2001)","journal-title":"SIAM J. Comput."},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Schmid, M.L., Schweikardt, N.: Spanner evaluation over SLP-compressed documents. In: PODS 2021, pp. 153\u2013165. ACM (2021)","DOI":"10.1145\/3452021.3458325"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Schmid, M.L., Schweikardt, N.: Query evaluation over SLP-represented document databases with complex document editing. In: PODS 2022, pp. 79\u201389. ACM (2022)","DOI":"10.1145\/3517804.3524158"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Segoufin, L.: Enumerating with constant delay the answers to a query. In: ICDT 2013, pp. 10\u201320. ACM (2013)","DOI":"10.1145\/2448496.2448498"},{"key":"3_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-38536-0_5","volume-title":"Computer Science \u2013 Theory and Applications","author":"J Shallit","year":"2013","unstructured":"Shallit, J.: Decidability and enumeration for automatic sequences: a survey. In: Bulatov, A.A., Shur, A.M. (eds.) CSR 2013. LNCS, vol. 7913, pp. 49\u201363. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38536-0_5"},{"key":"3_CR30","doi-asserted-by":"publisher","unstructured":"Uno, T.: Amortized analysis on enumeration algorithms. In: Kao, M.Y. (ed.) Encyclopedia of Algorithms. Springer, New York (2016). https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_730","DOI":"10.1007\/978-1-4939-2864-4_730"},{"key":"3_CR31","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-319-11812-3_27","volume-title":"Discovery Science","author":"T Uno","year":"2014","unstructured":"Uno, T., Satoh, H.: An efficient algorithm for enumerating chordless cycles and chordless paths. In: D\u017eeroski, S., Panov, P., Kocev, D., Todorovski, L. (eds.) DS 2014. LNCS (LNAI), vol. 8777, pp. 313\u2013324. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11812-3_27"},{"key":"3_CR32","unstructured":"Wasa, K.: Enumeration of enumeration algorithms. CoRR abs\/1605.05102 (2016)"},{"issue":"1","key":"3_CR33","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.jda.2007.01.005","volume":"6","author":"M Wild","year":"2008","unstructured":"Wild, M.: Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion. J. Discrete Algorithms 6(1), 93\u2013102 (2008)","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"3_CR34","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1109\/TCT.1967.1082662","volume":"14","author":"S Yau","year":"1967","unstructured":"Yau, S.: Generation of all Hamiltonian circuits, paths, and centers of a graph, and related problems. IEEE Trans. Circuit Theory 14(1), 79\u201381 (1967)","journal-title":"IEEE Trans. Circuit Theory"}],"container-title":["Lecture Notes in Computer Science","LATIN 2024: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-55598-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,13]],"date-time":"2024-11-13T16:30:15Z","timestamp":1731515415000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-55598-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031555978","9783031555985"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-55598-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"6 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Puerto Varas","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chile","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/latin2024.cmm.uchile.cl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"92","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}