{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T02:31:30Z","timestamp":1775097090031,"version":"3.50.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031969997","type":"print"},{"value":"9783031970009","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-97000-9_8","type":"book-chapter","created":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T06:51:45Z","timestamp":1751093505000},"page":"122-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Totally Greedy Sequences Defined by\u00a0Second-Order Linear Recurrences With Constant Coefficients"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3569-3885","authenticated-orcid":false,"given":"Hebert","family":"P\u00e9rez-Ros\u00e9s","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,29]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.ejc.2009.05.002","volume":"31","author":"A Adamaszek","year":"2010","unstructured":"Adamaszek, A., Adamaszek, M.: Combinatorics of the change-making problem. Eur. J. Comb. 31, 47\u201363 (2010)","journal-title":"Eur. J. Comb."},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Cai,\u00a0X.: Canonical coin systems for change-making problems. In: Proceedings of the 9th IEEE International Conference on Hybrid Intelligent Systems, pp. 499\u2013504 (2009)","DOI":"10.1109\/HIS.2009.103"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.jcss.2021.09.005","volume":"124","author":"TM Chan","year":"2022","unstructured":"Chan, T.M., He, Q.: More on change-making and related problems. J. Comput. Syst. Sci. 124, 159\u2013169 (2022)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Cowen,\u00a0L.J., Cowen, R., Steinberg, A.: Totally greedy coin sets and greedy obstructions. Electron. J. Comb. 15 (2008). #R90","DOI":"10.37236\/814"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1017\/S0025557200180921","volume":"91","author":"T Crilly","year":"2007","unstructured":"Crilly, T.: Interleaving Integer Sequences. Math. Gaz. 91, 27\u201333 (2007)","journal-title":"Math. Gaz."},{"key":"8_CR6","unstructured":"Lueker,\u00a0G.S.: Two NP-complete problems in nonnegative integer programming. Tech. Rep. 178, Computer Science Lab., Princeton University (1975)"},{"issue":"2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1287\/opre.23.2.207","volume":"23","author":"MJ Magazine","year":"1975","unstructured":"Magazine, M.J., Nemhauser, G.L., Trotter, L.E., Jr.: When the greedy solution solves a class of knapsack problems. Oper. Res. 23(2), 207\u2013217 (1975)","journal-title":"Oper. Res."},{"key":"8_CR8","unstructured":"OEIS: The On-Line Encyclopedia of Integer Sequences. http:\/\/oeis.org\/classic\/index.html"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.orl.2004.06.001","volume":"33","author":"D Pearson","year":"2005","unstructured":"Pearson, D.: A polynomial-time algorithm for the change-making problem. Oper. Res. Lett. 33, 231\u2013234 (2005)","journal-title":"Oper. Res. Lett."},{"key":"8_CR10","doi-asserted-by":"publisher","unstructured":"P\u00e9rez-Ros\u00e9s,\u00a0H. Bras, M., Serradilla-Merinero, J.M.: Greedy routing in circulant networks. Graphs Comb. 38(86) (2022). https:\/\/doi.org\/10.1007\/s00373-022-02489-9","DOI":"10.1007\/s00373-022-02489-9"},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"P\u00e9rez-Ros\u00e9s, H.: Totally greedy sequences generated by a class of second-order linear recurrences with constant coefficients. Procs. Discrete Math. Days 276\u2013281 (2024). https:\/\/doi.org\/10.37536\/TYSP5643","DOI":"10.37536\/TYSP5643"},{"key":"8_CR12","unstructured":"P\u00e9rez-Ros\u00e9s, H.: Totally Greedy Sequences Defined by Second-Order Linear Recurrences With Constant Coefficients. arXiv:2405.16609. https:\/\/arxiv.org\/abs\/2405.16609"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1017\/S0025557200174285","volume":"88","author":"V Rajesh","year":"2004","unstructured":"Rajesh, V., Leversha, G.: Some properties of odd terms of the Fibonacci sequence. Math. Gaz. 88, 85\u201386 (2004)","journal-title":"Math. Gaz."},{"issue":"2","key":"8_CR14","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/BF02984830","volume":"25","author":"J Shallit","year":"2003","unstructured":"Shallit, J.: What this country needs is an 18c Piece. Math. Intelligencer 25(2), 20\u201323 (2003)","journal-title":"Math. Intelligencer"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1017\/S0025557200179677","volume":"90","author":"JR Silvester","year":"2006","unstructured":"Silvester, J.R.: The r-subsequences of the Fibonacci sequence. Math. Gaz. 90, 263\u2013266 (2006)","journal-title":"Math. Gaz."},{"key":"8_CR16","doi-asserted-by":"publisher","unstructured":"Suzuki, Y., Miyashiro, R.: Characterization of canonical systems with six types of coins for the change-making problem. Theor. Comput. Sci. 955 (2023). https:\/\/doi.org\/10.1016\/j.tcs.2023.113822","DOI":"10.1016\/j.tcs.2023.113822"},{"key":"8_CR17","unstructured":"Zeckendorf,\u00a0E.: Repr\u00e9sentations des nombres naturels par un somme de nombres de Fibonacci ou de nombres de Lucas. Bulletin de La Society Royale des Sciences de Li\u00e8ge, 179\u2013182 (1972)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-97000-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T06:51:49Z","timestamp":1751093509000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97000-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031969997","9783031970009"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97000-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"29 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Istanbul","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"T\u00fcrkiye","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":"30 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 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":"iccsa2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}