{"id":"https://openalex.org/W2101212885","doi":"https://doi.org/10.1007/11611257_20","title":"Oriented Coloring: Complexity and Approximation","display_name":"Oriented Coloring: Complexity and Approximation","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2101212885","doi":"https://doi.org/10.1007/11611257_20","mag":"2101212885"},"language":"en","primary_location":{"id":"doi:10.1007/11611257_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11611257_20","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049888696","display_name":"Jean-Fran\u00e7ois Culus","orcid":null},"institutions":[{"id":"https://openalex.org/I4210147778","display_name":"Soci\u00e9t\u00e9 de Math\u00e9matiques Appliqu\u00e9es et de Sciences Humaines","ror":"https://ror.org/04d4dxm04","country_code":"FR","type":"facility","lineage":["https://openalex.org/I4210147778"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Jean-Fran\u00e7ois Culus","raw_affiliation_strings":["UTM, \u00e9quipe Grimm \u2013 SMASH, 5 All\u00e9e Antonio Machado, 31000 cedex 9, Toulouse, France"],"affiliations":[{"raw_affiliation_string":"UTM, \u00e9quipe Grimm \u2013 SMASH, 5 All\u00e9e Antonio Machado, 31000 cedex 9, Toulouse, France","institution_ids":["https://openalex.org/I4210147778"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089562675","display_name":"Marc Demange","orcid":"https://orcid.org/0000-0001-6195-2919"},"institutions":[{"id":"https://openalex.org/I124261006","display_name":"\u00c9cole Sup\u00e9rieure des Sciences \u00c9conomiques et Commerciales","ror":"https://ror.org/02dga6j42","country_code":"FR","type":"other","lineage":["https://openalex.org/I124261006"]},{"id":"https://openalex.org/I4210142324","display_name":"CY Cergy Paris Universit\u00e9","ror":"https://ror.org/043htjv09","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210142324"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Marc Demange","raw_affiliation_strings":["d\u00e9partement SID Avenue Bernard HIRSH, ESSEC, BP 105, 95021 cedex, Cergy Pontoise, France"],"affiliations":[{"raw_affiliation_string":"d\u00e9partement SID Avenue Bernard HIRSH, ESSEC, BP 105, 95021 cedex, Cergy Pontoise, France","institution_ids":["https://openalex.org/I4210142324","https://openalex.org/I124261006"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5049888696"],"corresponding_institution_ids":["https://openalex.org/I4210147778"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.2552,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.79854956,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"226","last_page":"236"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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.9993000030517578,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9965999722480774,"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/T12288","display_name":"Optimization and Search Problems","score":0.9914000034332275,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.8842145204544067},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8408174514770508},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7065272927284241},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.552568256855011},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.5433983206748962},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.47530850768089294},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44449013471603394},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41198480129241943},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3869086802005768},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27675047516822815},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21760806441307068},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.21522444486618042}],"concepts":[{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.8842145204544067},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8408174514770508},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7065272927284241},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.552568256855011},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.5433983206748962},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.47530850768089294},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44449013471603394},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41198480129241943},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3869086802005768},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27675047516822815},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21760806441307068},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.21522444486618042},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/11611257_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11611257_20","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W144954708","https://openalex.org/W655258421","https://openalex.org/W1866633992","https://openalex.org/W1980328919","https://openalex.org/W2040924621","https://openalex.org/W2041129145","https://openalex.org/W2077575555","https://openalex.org/W2086942674","https://openalex.org/W2089061537","https://openalex.org/W2095314925","https://openalex.org/W2101734619","https://openalex.org/W2103132901","https://openalex.org/W2105137385","https://openalex.org/W2143474538","https://openalex.org/W2153663865","https://openalex.org/W2165426231","https://openalex.org/W2912182072","https://openalex.org/W2994106552"],"related_works":["https://openalex.org/W2038088825","https://openalex.org/W1975203667","https://openalex.org/W2370328482","https://openalex.org/W4287882779","https://openalex.org/W99690574","https://openalex.org/W2790788195","https://openalex.org/W2962785705","https://openalex.org/W2121104987","https://openalex.org/W4293584096","https://openalex.org/W2084177987"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2015,"cited_by_count":5},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
