{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:40:46Z","timestamp":1743054046015,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030967307"},{"type":"electronic","value":"9783030967314"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-96731-4_15","type":"book-chapter","created":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:03:49Z","timestamp":1647389029000},"page":"175-186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Complexity of L(p,\u00a0q)-Edge-Labelling"],"prefix":"10.1007","author":[{"given":"Ga\u00e9tan","family":"Berthe","sequence":"first","affiliation":[]},{"given":"Barnaby","family":"Martin","sequence":"additional","affiliation":[]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]},{"given":"Siani","family":"Smith","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,16]]},"reference":[{"key":"15_CR1","unstructured":"Berthe, G., Martin, B., Paulusma, D., Smith, S.: The complexity of l(p, q)-edge-labelling. CoRR abs\/2008.12226 (2020). https:\/\/arxiv.org\/abs\/2008.12226"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-030-79416-3_2","volume-title":"Computer Science \u2013 Theory and Applications","author":"J Bok","year":"2021","unstructured":"Bok, J., Jedli\u010dkov\u00e1, N., Martin, B., Paulusma, D., Smith, S.: Injective colouring for H-free graphs. In: Santhanam, R., Musatov, D. (eds.) CSR 2021. LNCS, vol. 12730, pp. 18\u201330. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79416-3_2"},{"key":"15_CR3","unstructured":"Bok, J., Jedlic\u0306kov\u00e1, N., Martin, B., Paulusma, D., Smith, S.: Acyclic, star and injective colouring: a complexity picture for H-free graphs. In: Proceedings of ESA 2020, LIPIcs, vol. 173, pp. 22:1\u201322:22 (2020)"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-030-86838-3_26","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"C Brause","year":"2021","unstructured":"Brause, C., Golovach, P., Martin, B., Paulusma, D., Smith, S.: Acyclic, star, and injective colouring: bounding the diameter. In: Kowalik, \u0141, et al. (eds.) WG 2021. LNCS, vol. 12911, pp. 336\u2013348. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86838-3_26"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"1344","DOI":"10.1093\/comjnl\/bxr037","volume":"54","author":"T Calamoneri","year":"2011","unstructured":"Calamoneri, T.: The $${L}(h, k)$$-labelling problem: an updated survey and annotated bibliography. Comput. J. 54, 1344\u20131371 (2011)","journal-title":"Comput. J."},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-70575-8_25","volume-title":"Automata, Languages and Programming","author":"J Fiala","year":"2008","unstructured":"Fiala, J., Golovach, P.A., Kratochv\u00edl, J.: Computational complexity of the distance constrained labeling problem for trees (Extended abstract). In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5125, pp. 294\u2013305. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70575-8_25"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Fiala, J., Kloks, T., Kratochv\u00edl, J.: Fixed-parameter complexity of lambda-labelings. Discret. Appl. Math. 113, 59\u201372 (2001)","DOI":"10.1016\/S0166-218X(00)00387-5"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"JR Griggs","year":"1992","unstructured":"Griggs, J.R., Yeh, R.K.: Labelling graphs with a condition at distance 2. SIAM J. Discret. Math. 5, 586\u2013595 (1992)","journal-title":"SIAM J. Discret. Math."},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0012-365X(01)00466-6","volume":"256","author":"G Hahn","year":"2002","unstructured":"Hahn, G., Kratochv\u00edl, J., \u0160ir\u00e1\u0148, J., Sotteau, D.: On the injective chromatic number of graphs. Discret. Math. 256, 179\u2013192 (2002)","journal-title":"Discret. Math."},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of edge-coloring. SIAM J. Comput. 10, 718\u2013720 (1981)","journal-title":"SIAM J. Comput."},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"3270","DOI":"10.1016\/j.disc.2008.09.028","volume":"309","author":"R Janczewski","year":"2009","unstructured":"Janczewski, R., Kosowski, A., Ma\u0142afiejski, M.: The complexity of the $${L}(p, q)$$-labeling problem for bipartite planar graphs of small degree. Discret. Math. 309, 3270\u20133279 (2009)","journal-title":"Discret. Math."},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.dam.2017.01.007","volume":"246","author":"D Knop","year":"2018","unstructured":"Knop, D., Masar\u00edk, T.: Computational complexity of distance edge labeling. Discret. Appl. Math. 246, 80\u201398 (2018)","journal-title":"Discret. Appl. Math."},{"key":"15_CR13","first-page":"71","volume":"1992","author":"EL Lloyd","year":"1992","unstructured":"Lloyd, E.L., Ramanathan, S.: On the complexity of distance-$$2$$ coloring. Proc. ICCI 1992, 71\u201374 (1992)","journal-title":"Proc. ICCI"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0166-218X(01)00237-2","volume":"118","author":"M Mahdian","year":"2002","unstructured":"Mahdian, M.: On the computational complexity of strong edge coloring. Discret. Appl. Math. 118, 239\u2013248 (2002)","journal-title":"Discret. Appl. Math."},{"key":"15_CR15","unstructured":"Masar\u00edk, T.: Private communication (2020)"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF02592052","volume":"26","author":"S McCormick","year":"1983","unstructured":"McCormick, S.: Optimal approximation of sparse hessians and its equivalence to a graph coloring problem. Math. Program. 26, 153\u2013171 (1983)","journal-title":"Math. Program."},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: STOC 1978, pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"}],"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-3-030-96731-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:05:30Z","timestamp":1647389130000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-96731-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030967307","9783030967314"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-96731-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"16 March 2022","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":"Jember","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Indonesia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 March 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2022","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":"walcom2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/walcom2022.unej.ac.id\/","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":"89","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":"34% - 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","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":"2-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 proceedings also include 3 invited papers.","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)"}}]}}