{"id":"https://openalex.org/W2906865940","doi":"https://doi.org/10.23638/dmtcs-21-3-24","title":"Backbone colouring and algorithms for TDMA scheduling","display_name":"Backbone colouring and algorithms for TDMA scheduling","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2906865940","doi":"https://doi.org/10.23638/dmtcs-21-3-24","mag":"2906865940"},"language":"en","primary_location":{"id":"pmh:oai:HAL:hal-01851600v4","is_oa":true,"landing_page_url":"https://hal.science/hal-01851600","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Discrete Mathematics and Theoretical Computer Science, 2019, Vol. 21 no. 3 (3), pp.#24. ⟨10.23638/DMTCS-21-3-24⟩","raw_type":"info:eu-repo/semantics/article"},"type":"article","indexed_in":["doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-01851600","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032196380","display_name":"Julien Bensmail","orcid":"https://orcid.org/0000-0002-9292-394X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Julien Bensmail","raw_affiliation_strings":["COATI - Combinatorics, Optimization and Algorithms for Telecommunications (2004 route des Lucioles BP 93 F-06902 Sophia Antipolis (France) - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"COATI - Combinatorics, Optimization and Algorithms for Telecommunications (2004 route des Lucioles BP 93 F-06902 Sophia Antipolis (France) - France)","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015685991","display_name":"Thibaut Blanc","orcid":null},"institutions":[{"id":"https://openalex.org/I4210146044","display_name":"\u00c9cole Normale Sup\u00e9rieure de Rennes","ror":"https://ror.org/03rxtdc22","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210146044","https://openalex.org/I56067802"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Thibaut Blanc","raw_affiliation_strings":["\u00c9cole normale sup\u00e9rieure - Rennes"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\u00c9cole normale sup\u00e9rieure - Rennes","institution_ids":["https://openalex.org/I4210146044"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112385998","display_name":"Nathann Cohen","orcid":"https://orcid.org/0000-0002-3341-3712"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nathann Cohen","raw_affiliation_strings":["Graphes, Algorithmes et Combinatoire (LRI)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graphes, Algorithmes et Combinatoire (LRI)","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031575825","display_name":"Fr\u00e9d\u00e9ric Havet","orcid":"https://orcid.org/0000-0002-3447-8112"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fr\u00e9d\u00e9ric Havet","raw_affiliation_strings":["COATI - Combinatorics, Optimization and Algorithms for Telecommunications (2004 route des Lucioles BP 93 F-06902 Sophia Antipolis (France) - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"COATI - Combinatorics, Optimization and Algorithms for Telecommunications (2004 route des Lucioles BP 93 F-06902 Sophia Antipolis (France) - France)","institution_ids":[]}]},{"author_position":"last","author":{"id":null,"display_name":"Leonardo Rocha","orcid":null},"institutions":[{"id":"https://openalex.org/I102939073","display_name":"Universidade Estadual do Cear\u00e1","ror":"https://ror.org/00sec1m50","country_code":"BR","type":"education","lineage":["https://openalex.org/I102939073"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Leonardo Rocha","raw_affiliation_strings":["Universidade Estadual do Cear\u00e1 [Brasil] = State University of Cear\u00e1 [Brazil]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universidade Estadual do Cear\u00e1 [Brasil] = State University of Cear\u00e1 [Brazil]","institution_ids":["https://openalex.org/I102939073"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3552,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.59716279,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6793767213821411},{"id":"https://openalex.org/keywords/time-division-multiple-access","display_name":"Time division multiple access","score":0.5995320677757263},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5628666877746582},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5207940936088562},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.40489092469215393},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.35084959864616394},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.33912235498428345},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2681407928466797},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19411182403564453}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6793767213821411},{"id":"https://openalex.org/C117313154","wikidata":"https://www.wikidata.org/wiki/Q878344","display_name":"Time division multiple access","level":2,"score":0.5995320677757263},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5628666877746582},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5207940936088562},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.40489092469215393},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.35084959864616394},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.33912235498428345},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2681407928466797},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19411182403564453}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:HAL:hal-01851600v4","is_oa":true,"landing_page_url":"https://hal.science/hal-01851600","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Discrete Mathematics and Theoretical Computer Science, 2019, Vol. 21 no. 3 (3), pp.#24. ⟨10.23638/DMTCS-21-3-24⟩","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:doaj.org/article:b1caf398051642138690717f02ed1b9b","is_oa":true,"landing_page_url":"https://doaj.org/article/b1caf398051642138690717f02ed1b9b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Discrete Mathematics & Theoretical Computer Science, Vol Vol. 21 no. 3, Iss Graph Theory (2019)","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01851600v4","is_oa":true,"landing_page_url":"https://hal.science/hal-01851600","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Discrete Mathematics and Theoretical Computer Science, 2019, Vol. 21 no. 3 (3), pp.#24. ⟨10.23638/DMTCS-21-3-24⟩","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W179240016","https://openalex.org/W1487522841","https://openalex.org/W1497617529","https://openalex.org/W2030087828","https://openalex.org/W2038603123","https://openalex.org/W2057904195","https://openalex.org/W2063078918","https://openalex.org/W2166566648","https://openalex.org/W4235305974","https://openalex.org/W4240720231","https://openalex.org/W4301890399"],"related_works":["https://openalex.org/W2160222453","https://openalex.org/W2121800375","https://openalex.org/W2362971132","https://openalex.org/W2020063395","https://openalex.org/W2371687215","https://openalex.org/W1521875845","https://openalex.org/W1967958706","https://openalex.org/W2048312709","https://openalex.org/W2536828918","https://openalex.org/W2087981621"],"abstract_inverted_index":{"International":[0],"audience":[1]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-16T13:24:37.021932","created_date":"2025-10-10T00:00:00"}