{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T14:22:52Z","timestamp":1774362172186,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":14,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819571260","type":"print"},{"value":"9789819571277","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-981-95-7127-7_24","type":"book-chapter","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:06:56Z","timestamp":1770977216000},"page":"353-367","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Graph Irregularity via\u00a0Edge Deletions"],"prefix":"10.1007","author":[{"given":"Julien","family":"Bensmail","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"No\u00ebmie","family":"Catherinot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Foivos","family":"Fioravantes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Clara","family":"Marcille","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nacim","family":"Oijid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"issue":"2","key":"24_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1002\/jgt.3190110214","volume":"11","author":"Y Alavi","year":"1987","unstructured":"Alavi, Y., Chartrand, G., Chung, F., Erd\u0151s, P., Graham, R., Oellermann, O.: Highly irregular graph. J. Graph Theory 11(2), 235\u2013249 (1987)","journal-title":"J. Graph Theory"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.ejc.2015.02.031","volume":"49","author":"O Baudon","year":"2015","unstructured":"Baudon, O., Bensmail, J., Przyby\u0142o, J., Wo\u017aniak, M.: On decomposing regular graphs into locally irregular subgraphs. European J. Combin. 49, 90\u2013104 (2015)","journal-title":"European J. Combin."},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2021.04.020","volume":"873","author":"C Bazgan","year":"2021","unstructured":"Bazgan, C., Cazals, P., Chleb\u00edkov\u00e1, J.: Degree-anonymization using edge rotations. Theoretical Comput. Sci. 873, 1\u201315 (2021)","journal-title":"Theoretical Comput. Sci."},{"issue":"8","key":"24_CR4","doi-asserted-by":"publisher","first-page":"2351","DOI":"10.1007\/s00453-021-00830-x","volume":"83","author":"R Belmonte","year":"2021","unstructured":"Belmonte, R., Sau, I.: On the complexity of finding large odd induced subgraphs and odd colorings. Algorithmica 83(8), 2351\u20132373 (2021)","journal-title":"Algorithmica"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s00373-020-02252-y","volume":"37","author":"J Bensmail","year":"2021","unstructured":"Bensmail, J., Li, B., Li, B.: An injective version of the 1-2-3 conjecture. Graphs Combin. 37, 281\u2013311 (2021)","journal-title":"Graphs Combin."},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Bensmail, J., Catherinot, N., Fioravantes, F., Marcille, C., Oijid, N.: Graph Irregularity via Edge Deletions (2025). https:\/\/hal.science\/hal-05084434","DOI":"10.1007\/978-981-95-7127-7_24"},{"key":"24_CR7","first-page":"197","volume":"64","author":"G Chartrand","year":"1988","unstructured":"Chartrand, G., Jacobson, M., Lehel, J., Oellermann, O., Ruiz, S., Saba, F.: Irregular networks. Congr. Numer. 64, 197\u2013210 (1988)","journal-title":"Congr. Numer."},{"key":"24_CR8","doi-asserted-by":"publisher","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3","DOI":"10.1007\/978-3-319-21275-3"},{"key":"24_CR9","doi-asserted-by":"publisher","unstructured":"Diestel, R.: Graph Theory. GTM, vol. 173. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-53622-3","DOI":"10.1007\/978-3-662-53622-3"},{"key":"24_CR10","doi-asserted-by":"publisher","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. TCS, Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1","DOI":"10.1007\/978-1-4471-5559-1"},{"key":"24_CR11","unstructured":"Fioravantes, F., Melissinos, N., Triommatis, T.: Parameterised distance to local irregularity. In: 19th International Symposium on Parameterized and Exact Computation (IPEC 2024). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0321, pp. 18:1\u201318:15. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2024)"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.dam.2024.12.007","volume":"363","author":"F Fioravantes","year":"2025","unstructured":"Fioravantes, F., Melissinos, N., Triommatis, T.: Complexity of finding maximum locally irregular induced subgraphs. Discret. Appl. Math. 363, 168\u2013189 (2025)","journal-title":"Discret. Appl. Math."},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.jctb.2003.12.001","volume":"91","author":"M Karo\u0144ski","year":"2004","unstructured":"Karo\u0144ski, M., \u0141uczak, T., Thomason, A.: Edge weights and vertex colours. J. Combin. Theory Seri. B 91, 151\u2013157 (2004)","journal-title":"J. Combin. Theory Seri. B"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.jctb.2024.01.002","volume":"166","author":"R Keusch","year":"2024","unstructured":"Keusch, R.: A solution to the 1-2-3 conjecture. J. Comb. Theory Seri. B 166, 183\u2013202 (2024)","journal-title":"J. Comb. Theory Seri. B"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7127-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T04:13:44Z","timestamp":1774325624000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7127-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819571260","9789819571277"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7127-7_24","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":"14 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perugia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"4 March 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mozart.diei.unipg.it\/walcom2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}