{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:59:40Z","timestamp":1743094780783,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031745799"},{"type":"electronic","value":"9783031745805"}],"license":[{"start":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T00:00:00Z","timestamp":1735257600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T00:00:00Z","timestamp":1735257600000},"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-74580-5_4","type":"book-chapter","created":{"date-parts":[[2024,12,26]],"date-time":"2024-12-26T15:36:33Z","timestamp":1735227393000},"page":"46-60","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Channel Allocation Revisited Through 1-Extendability of\u00a0Graphs"],"prefix":"10.1007","author":[{"given":"Anthony","family":"Busson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Malory","family":"Marin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00e9mi","family":"Watrigant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,27]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Berge, C.: Some common properties for regularizable graphs, edge-critical graphs and B-graphs. In: Peter,\u00a0L.H., Alexander, R., Gert, S., Jean, T. (ed.) Theory and Practice of Combinatorics, volume\u00a060 of North-Holland Mathematics Studies, pp. 31\u201344. North-Holland (1982)","DOI":"10.1016\/S0304-0208(08)73488-1"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Berg\u00e9, P., Busson, A., Feghali, C., Watrigant, R.: 1-extendability of independent sets. In: Bazgan, C., Fernau, H. (ed.) Combinatorial Algorithms, pp. 172\u2013185. Springer International Publishing, Cham (2022)","DOI":"10.1007\/978-3-031-06678-8_13"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BFb0054129","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201998","author":"V Boyko","year":"1998","unstructured":"Boyko, V., Peinado, M., Venkatesan, R.: Speeding up discrete log and factoring based schemes via precomputations. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 221\u2013235. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054129"},{"issue":"3","key":"4_CR4","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s00607-002-1461-1","volume":"69","author":"H Broersma","year":"2002","unstructured":"Broersma, H., Fomin, F.V., Ne\u0161et\u0159il, J., Woeginger, G.J.: More about subcolorings. Computing 69(3), 187\u2013203 (2002)","journal-title":"Computing"},{"key":"4_CR5","unstructured":"Busson, A., Marin, M., Watrigant, R.: Aaachannel allocation revisited through 1-extendability of graphs. CoRR, abs\/2408.14633 (2024). arXiv:2408.1463d3"},{"issue":"3","key":"4_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.ipl.2006.08.007","volume":"101","author":"MJ Collins","year":"2007","unstructured":"Collins, M.J., Kempe, D., Saia, J., Young, M.: Nonnegative integral subset representations of integer sets. Inf. Process. Lett. 101(3), 129\u2013133 (2007)","journal-title":"Inf. Process. Lett."},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Coron, J.-S., Gini, A.: A polynomial-time algorithm for solving the hidden subset sum problem. In: Advances in Cryptology - CRYPTO 2020, pp. 3\u201331. Springer (2020)","DOI":"10.1007\/978-3-030-56880-1_1"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Cygan, M., et al.: Parameterized Algorithms, 1st edition. Springer Publishing Company, Berlin (2015). Incorporated","DOI":"10.1007\/978-3-319-21275-3"},{"issue":"1","key":"4_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0012-365X(94)90253-4","volume":"126","author":"N Dean","year":"1994","unstructured":"Dean, N., Zito, J.: Well-covered graphs and extendability. Discret. Math. 126(1), 67\u201380 (1994)","journal-title":"Discret. Math."},{"key":"4_CR10","unstructured":"Feghali, C., Marin, M., Watrigant, R.: Beyond recognizing well-covered graphs. In: 50th International Workshop on Graph-Theoretic Concepts in Computer Science (WG) (2024)"},{"issue":"1","key":"4_CR11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.cosrev.2010.01.001","volume":"4","author":"M Habib","year":"2010","unstructured":"Habib, M., Paul, C.: A survey of the algorithmic aspects of modular decomposition. Comput. Sci. Rev. 4(1), 41\u201359 (2010)","journal-title":"Comput. Sci. Rev."},{"issue":"3","key":"4_CR12","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/s00373-011-1123-1","volume":"29","author":"S Klein","year":"2013","unstructured":"Klein, S., de Mello, C.P., Morgana, A.: Recognizing well covered graphs of families with special $$p_4$$-components. Graphs Combinatorics 29(3), 553\u2013567 (2013)","journal-title":"Graphs Combinatorics"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Liew, S.C., Kai, C., Leung, H.C., Wong, P.B.: Back-of-the-envelope computation of throughput distributions in CSMA wireless networks. In: 2009 IEEE International Conference on Communications, pp. 1\u20136 (2007)","DOI":"10.1109\/ICC.2009.5198774"},{"issue":"1","key":"4_CR14","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"RM McConnell","year":"1999","unstructured":"McConnell, R.M., Spinrad, J.P.: Modular decomposition and transitive orientation. Discret. Math. 201(1), 189\u2013241 (1999)","journal-title":"Discret. Math."},{"issue":"8","key":"4_CR15","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/s40314-023-02502-8","volume":"42","author":"M Milanic","year":"2023","unstructured":"Milanic, M., Pivac, N.: Computing well-covered vector spaces of graphs using modular decomposition. Comput. Appl. Math. 42(8), 360 (2023)","journal-title":"Comput. Appl. Math."},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Nguyen, P.Q., Stern, J.: The hardness of the hidden subset sum problem and its cryptographic implications. In: Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology, CRYPTO 1999, pp. 31-46 (1999). Springer-Verlag, Berlin","DOI":"10.1007\/3-540-48405-1_3"},{"issue":"1","key":"4_CR17","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0021-9800(70)80011-4","volume":"8","author":"MD Plummer","year":"1970","unstructured":"Plummer, M.D.: Some covering concepts in graphs. J. Comb. Theory 8(1), 91\u201398 (1970)","journal-title":"J. Comb. Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithmics of Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-74580-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,26]],"date-time":"2024-12-26T16:02:31Z","timestamp":1735228951000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-74580-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,27]]},"ISBN":["9783031745799","9783031745805"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-74580-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,27]]},"assertion":[{"value":"27 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALGOWIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmics of Wireless Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Egham","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2024","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":"algosensors2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo-conference.org\/2024\/algowin\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}