{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:05:56Z","timestamp":1742997956716,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030394783"},{"type":"electronic","value":"9783030394790"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-39479-0_11","type":"book-chapter","created":{"date-parts":[[2020,1,24]],"date-time":"2020-01-24T20:03:47Z","timestamp":1579896227000},"page":"154-169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximate Strong Edge-Colouring of Unit Disk Graphs"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Grelier","sequence":"first","affiliation":[]},{"given":"R\u00e9mi","family":"de Joannis de Verclos","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4219-593X","authenticated-orcid":false,"given":"Ross J.","family":"Kang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1392-9623","authenticated-orcid":false,"given":"Fran\u00e7ois","family":"Pirot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,25]]},"reference":[{"key":"11_CR1","unstructured":"Barrett, C.L., Istrate, G., Anil Kumar, V.S., Marathe, M.V., Thite, S., Thulasidasan, S.: Strong edge coloring for channel assignment in wireless radio networks. In: 2006 Pervasive Computing and Communications Workshops, p. 5. IEEE (2006)"},{"key":"11_CR2","unstructured":"Bonamy, M., Perrett, T., Postle, L.: Colouring graphs with sparse neighbourhoods: bounds and applications. arXiv e-prints:1810.06704 (2018)"},{"issue":"1","key":"11_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1017\/S0963548317000244","volume":"27","author":"H Bruhn","year":"2018","unstructured":"Bruhn, H., Joos, F.: A stronger bound for the strong chromatic index. Combin. Probab. Comput. 27(1), 21\u201343 (2018). \nhttps:\/\/doi.org\/10.1017\/S0963548317000244","journal-title":"Combin. Probab. Comput."},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-642-54423-1_36","volume-title":"LATIN 2014: Theoretical Informatics","author":"P Chalermsook","year":"2014","unstructured":"Chalermsook, P., Laekhanukit, B., Nanongkai, D.: Coloring graph powers: graph product bounds and hardness of approximation. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol. 8392, pp. 409\u2013420. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-642-54423-1_36"},{"issue":"1\u20133","key":"11_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"BN Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Math. 86(1\u20133), 165\u2013177 (1990)","journal-title":"Discrete Math."},{"key":"11_CR6","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3","volume-title":"Graph Theory","author":"Reinhard Diestel","year":"2017","unstructured":"Diestel, R.: Graph theory, Graduate Texts in Mathematics, 5th edn, vol. 173. Springer, Berlin (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-662-53622-3"},{"issue":"1-3","key":"11_CR7","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0012-365X(88)90196-3","volume":"72","author":"Paul Erd\u00f6os","year":"1988","unstructured":"Erd\u0151s, P.: Problems and results in combinatorial analysis and graph theory. In: Proceedings of the First Japan Conference on Graph Theory and Applications, Hakone, 1986, vol. 72, pp. 81\u201392 (1988). \nhttps:\/\/doi.org\/10.1016\/0012-365X(88)90196-3","journal-title":"Discrete Mathematics"},{"issue":"3","key":"11_CR8","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/PL00009196","volume":"20","author":"A Gr\u00e4f","year":"1998","unstructured":"Gr\u00e4f, A., Stumpf, M., Wei\u00dfenfels, G.: On coloring unit disk graphs. Algorithmica 20(3), 277\u2013293 (1998)","journal-title":"Algorithmica"},{"issue":"12","key":"11_CR9","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"WK Hale","year":"1980","unstructured":"Hale, W.K.: Frequency assignment: theory and applications. Proc. IEEE 68(12), 1497\u20131514 (1980). \nhttps:\/\/doi.org\/10.1109\/PROC.1980.11899","journal-title":"Proc. IEEE"},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1017\/S0963548313000473","volume":"23","author":"T Kaiser","year":"2014","unstructured":"Kaiser, T., Kang, R.J.: The distance-$$t$$ chromatic index of graphs. Combin. Probab. Comput. 23(1), 90\u2013101 (2014). \nhttps:\/\/doi.org\/10.1017\/S0963548313000473","journal-title":"Combin. Probab. Comput."},{"issue":"3","key":"11_CR11","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/s00454-012-9394-8","volume":"47","author":"RJ Kang","year":"2012","unstructured":"Kang, R.J., M\u00fcller, T.: Sphere and dot product representations of graphs. Discrete Comput. Geom. 47(3), 548\u2013568 (2012). \nhttps:\/\/doi.org\/10.1007\/s00454-012-9394-8","journal-title":"Discrete Comput. Geom."},{"issue":"35","key":"11_CR12","doi-asserted-by":"publisher","first-page":"4704","DOI":"10.1016\/j.tcs.2011.05.005","volume":"412","author":"Iyad A. Kanj","year":"2011","unstructured":"Kanj, I.A., Wiese, A., Zhang, F.: Local algorithms for edge colorings in UDGs. Theor. Comput. Sci. 412(35), 4704\u20134714 (2011). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2011.05.005","journal-title":"Theoretical Computer Science"},{"key":"11_CR13","unstructured":"Mahdian, M.: The strong chromatic index of graphs. Master\u2019s thesis, University of Toronto (2000)"},{"issue":"3","key":"11_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. Discrete Appl. Math. 118(3), 239\u2013248 (2002). \nhttps:\/\/doi.org\/10.1016\/S0166-218X(01)00237-2","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"11_CR15","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1002\/(SICI)1097-0037(199808)32:1<13::AID-NET2>3.0.CO;2-M","volume":"32","author":"E Malesi\u0144ska","year":"1998","unstructured":"Malesi\u0144ska, E., Piskorz, S., Wei\u00dfenfels, G.: On the chromatic number of disk graphs. Networks 32(1), 13\u201322 (1998)","journal-title":"Networks"},{"issue":"2","key":"11_CR16","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/net.3230250205","volume":"25","author":"MV Marathe","year":"1995","unstructured":"Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple heuristics for unit disk graphs. Networks 25(2), 59\u201368 (1995)","journal-title":"Networks"},{"issue":"2","key":"11_CR17","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1006\/jctb.1997.1724","volume":"69","author":"M Molloy","year":"1997","unstructured":"Molloy, M., Reed, B.: A bound on the strong chromatic index of a graph. J. Combin. Theory Ser. B 69(2), 103\u2013109 (1997). \nhttps:\/\/doi.org\/10.1006\/jctb.1997.1724","journal-title":"J. Combin. Theory Ser. B"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Nandagopal, T., Kim, T.E., Gao, X., Bharghavan, V.: Achieving MAC layer fairness in wireless packet networks. In: Proceedings of the 6th Annual International Conference on Mobile Computing and Networking, pp. 87\u201398. ACM (2000)","DOI":"10.1145\/345910.345925"},{"key":"11_CR19","unstructured":"Peeters, R.: On coloring j-unit sphere graphs. Technical report, Tilburg University (1991)"},{"issue":"2","key":"11_CR20","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1109\/90.222924","volume":"1","author":"S Ramanathan","year":"1993","unstructured":"Ramanathan, S., Lloyd, E.L.: Scheduling algorithms for multihop radio networks. IEEE\/ACM Trans. Netw. (TON) 1(2), 166\u2013177 (1993)","journal-title":"IEEE\/ACM Trans. Netw. (TON)"},{"issue":"1","key":"11_CR21","doi-asserted-by":"publisher","first-page":"113","DOI":"10.4153\/CJM-2017-029-9","volume":"71","author":"R\u00e9mi de Joannis de Verclos","year":"2019","unstructured":"de Joannis de Verclos, R., Kang, R.J., Pastor, L.: Colouring squares of claw-free graphs. Can. J. Math. 71(1), 113\u2013129 (2019). \nhttps:\/\/doi.org\/10.4153\/CJM-2017-029-9","journal-title":"Canadian Journal of Mathematics"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39479-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T08:04:23Z","timestamp":1583741063000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39479-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030394783","9783030394790"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39479-0_11","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":"25 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo2019.ak.in.tum.de\/index.php\/menue-waoa\/waoa-overview","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}