{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:51:26Z","timestamp":1743025886604,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031834370"},{"type":"electronic","value":"9783031834387"}],"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-83438-7_14","type":"book-chapter","created":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T21:56:30Z","timestamp":1738706190000},"page":"160-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast FPT Algorithms for\u00a0Grundy Number on\u00a0Dense Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-9747-2121","authenticated-orcid":false,"given":"Sina","family":"Ghasemi Nezhad","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0008-1611-1633","authenticated-orcid":false,"given":"Maryam","family":"Moghaddas","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6213-8687","authenticated-orcid":false,"given":"Fahad","family":"Panolan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,5]]},"reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-022-01001-2","volume":"85","author":"P Aboulker","year":"2023","unstructured":"Aboulker, P., Bonnet, \u00c9., Kim, E.J., Sikora, F.: Grundy coloring and friends, half-graphs, bicliques. Algorithmica 85(1), 1\u201328 (2023)","journal-title":"Algorithmica"},{"issue":"3","key":"14_CR2","doi-asserted-by":"publisher","first-page":"1761","DOI":"10.1137\/20M1385779","volume":"36","author":"R Belmonte","year":"2022","unstructured":"Belmonte, R., Kim, E.J., Lampis, M., Mitsou, V., Otachi, Y.: Grundy distinguishes treewidth from pathwidth. SIAM J. Discret. Math. 36(3), 1761\u20131787 (2022)","journal-title":"SIAM J. Discret. Math."},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.dam.2017.12.022","volume":"243","author":"\u00c9 Bonnet","year":"2018","unstructured":"Bonnet, \u00c9., Foucaud, F., Kim, E.J., Sikora, F.: Complexity of grundy coloring and its variants. Discret. Appl. Math. 243, 99\u2013114 (2018)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"14_CR4","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0095-8956(79)90067-4","volume":"27","author":"CA Christen","year":"1979","unstructured":"Christen, C.A., Selkow, S.M.: Some perfect coloring properties of graphs. J. Comb. Theory Ser. B 27(1), 49\u201359 (1979)","journal-title":"J. Comb. Theory Ser. B"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Cygan, M., et al.: Parameterized Algorithms, vol.\u00a05. Springer (2015)","DOI":"10.1007\/978-3-319-21275-3"},{"issue":"4","key":"14_CR6","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"AV Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM 35(4), 921\u2013940 (1988). https:\/\/doi.org\/10.1145\/48014.61051","journal-title":"J. ACM"},{"issue":"1","key":"14_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13173-015-0036-x","volume":"21","author":"F Havet","year":"2015","unstructured":"Havet, F., Maia, A.K., Yu, M.-L.: Complexity of greedy edge-colouring. J. Braz. Comput. Soc. 21(1), 1\u20137 (2015). https:\/\/doi.org\/10.1186\/s13173-015-0036-x","journal-title":"J. Braz. Comput. Soc."},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/s00453-011-9604-4","volume":"65","author":"F Havet","year":"2013","unstructured":"Havet, F., Sampaio, L.: On the grundy and b-chromatic numbers of a graph. Algorithmica 65, 885\u2013899 (2013)","journal-title":"Algorithmica"},{"key":"14_CR9","first-page":"351","volume":"36","author":"SM Hedetniemi","year":"1982","unstructured":"Hedetniemi, S.M., Hedetniemi, S.T., Beyer, T.: A linear algorithm for the grundy (coloring) number of a tree. Congr. Numer. 36, 351\u2013363 (1982)","journal-title":"Congr. Numer."},{"key":"14_CR10","unstructured":"Sampaio, L.: Algorithmic aspects of graph colourings heuristics. Ph.D. thesis, Universit\u00e9 Nice Sophia Antipolis (2012)"},{"issue":"4","key":"14_CR11","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1137\/S0895480194275825","volume":"10","author":"JA Telle","year":"1997","unstructured":"Telle, J.A., Proskurowski, A.: Algorithms for vertex partitioning problems on partial k-trees. SIAM J. Discret. Math. 10(4), 529\u2013550 (1997)","journal-title":"SIAM J. Discret. Math."},{"key":"14_CR12","first-page":"325","volume":"31","author":"M Zaker","year":"2005","unstructured":"Zaker, M.: Grundy chromatic number of the complement of bipartite graphs. Australas. J Comb. 31, 325\u2013330 (2005)","journal-title":"Australas. J Comb."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-83438-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T21:56:33Z","timestamp":1738706193000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-83438-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031834370","9783031834387"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-83438-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Coimbatore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"12 February 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 February 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/caldam-2025-website.vercel.app\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}