{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T03:57:19Z","timestamp":1763092639533,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030489656"},{"type":"electronic","value":"9783030489663"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-48966-3_5","type":"book-chapter","created":{"date-parts":[[2020,5,28]],"date-time":"2020-05-28T13:04:23Z","timestamp":1590671063000},"page":"56-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On Proper Labellings of Graphs with\u00a0Minimum Label Sum"],"prefix":"10.1007","author":[{"given":"Julien","family":"Bensmail","sequence":"first","affiliation":[]},{"given":"Foivos","family":"Fioravantes","sequence":"additional","affiliation":[]},{"given":"Nicolas","family":"Nisse","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,29]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.dam.2019.07.019","volume":"270","author":"O Baudon","year":"2019","unstructured":"Baudon, O., Bensmail, J., Hocquard, H., Senhaji, M., Sopena, E.: Edge weights and vertex colours: minimizing sum count. Discrete Appl. Math. 270, 13\u201324 (2019)","journal-title":"Discrete Appl. Math."},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.dam.2017.01.031","volume":"222","author":"O Baudon","year":"2017","unstructured":"Baudon, O., Pil\u015bniak, M., Przyby\u0142o, J., Senhaji, M., Sopena, E., Wo\u017aniak, M.: Equitable neighbour-sum-distinguishing edge and total colourings. Discrete Appl. Math. 222, 40\u201353 (2017)","journal-title":"Discrete Appl. Math."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Bensmail, J., Fioravantes, F., Nisse, N.: On proper labellings of graphs with minimum label sum. Research report (2020). https:\/\/hal.archives-ouvertes.fr\/hal-02450521","DOI":"10.1007\/978-3-030-48966-3_5"},{"key":"5_CR4","unstructured":"Bensmail, J., Li, B., Li, B., Nisse, N.: On minimizing the maximum color for the 1-2-3 conjecture. Research report (2019). https:\/\/hal.archives-ouvertes.fr\/hal-02330418"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"1807","DOI":"10.11650\/twjm\/1500406380","volume":"15","author":"G Chang","year":"2011","unstructured":"Chang, G., Lu, C., Wu, J., Yu, Q.: Vertex-coloring edge-weightings of graphs. Taiwanese J. Math. 15, 1807\u20131813 (2011)","journal-title":"Taiwanese J. Math."},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1080\/07468342.1988.11973088","volume":"19","author":"G Chartrand","year":"1998","unstructured":"Chartrand, G., Erd\u0151s, P., Oellermann, O.: How to define an irregular graph. Coll. Math. J. 19, 36\u201342 (1998)","journal-title":"Coll. Math. J."},{"key":"5_CR7","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R Diestel","year":"2012","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg (2012)","edition":"4"},{"key":"5_CR8","first-page":"45","volume":"13","author":"A Dudek","year":"2011","unstructured":"Dudek, A., Wajc, D.: On the complexity of vertex-coloring edge-weightings. Discrete Math. Theoret. Comput. Sci. 13, 45\u201350 (2011)","journal-title":"Discrete Math. Theoret. Comput. Sci."},{"issue":"3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.jctb.2009.06.002","volume":"100","author":"M Kalkowski","year":"2010","unstructured":"Kalkowski, M., Karo\u0144ski, M., Pfender, F.: Vertex-coloring edge-weightings: towards the 1-2-3-conjecture. J. Comb. Theory Ser. B 100(3), 347\u2013349 (2010)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"5_CR10","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. Comb. Theory Ser. B 91(1), 151\u2013157 (2004)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"11:1","DOI":"10.1145\/1346330.1346336","volume":"55","author":"W Mulzer","year":"2008","unstructured":"Mulzer, W., Rote, G.: Minimum-weight triangulation is NP-hard. J. ACM 55(2), 11:1\u201311:29 (2008)","journal-title":"J. ACM"},{"key":"5_CR12","unstructured":"Przyby\u0142o, J.: The 1-2-3 conjecture almost holds for regular graphs (2018)"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/j.jctb.2016.06.010","volume":"121","author":"C Thomassen","year":"2016","unstructured":"Thomassen, C., Wu, Y., Zhang, C.Q.: The 3-flow conjecture, factors modulo $$k$$, and the 1-2-3-conjecture. J. Comb. Theory Ser. B 121, 308\u2013325 (2016)","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-48966-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T15:14:52Z","timestamp":1710256492000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-48966-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030489656","9783030489663"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48966-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bordeaux","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2020.labri.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"62","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":"30","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,8","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":"5,9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","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)"}},{"value":"The conference had to be postponed due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}