{"id":"https://openalex.org/W1568993744","doi":"https://doi.org/10.1007/978-3-642-02882-3_39","title":"Convex Recoloring Revisited: Complexity and Exact Algorithms","display_name":"Convex Recoloring Revisited: Complexity and Exact Algorithms","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W1568993744","doi":"https://doi.org/10.1007/978-3-642-02882-3_39","mag":"1568993744"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-02882-3_39","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-02882-3_39","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/A5009111693","display_name":"Iyad Kanj","orcid":"https://orcid.org/0000-0003-1698-8829"},"institutions":[{"id":"https://openalex.org/I118353179","display_name":"DePaul University","ror":"https://ror.org/04xtx5t16","country_code":"US","type":"education","lineage":["https://openalex.org/I118353179"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Iyad A. Kanj","raw_affiliation_strings":["School of Computing, DePaul University, 243 S.\u00a0Wabash Avenue, Chicago, IL, 60604, USA"],"affiliations":[{"raw_affiliation_string":"School of Computing, DePaul University, 243 S.\u00a0Wabash Avenue, Chicago, IL, 60604, USA","institution_ids":["https://openalex.org/I118353179"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109894460","display_name":"Dieter Kratsch","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dieter Kratsch","raw_affiliation_strings":["LITA, Universit\u00e9 Paul Verlaine Metz, 57045, Metz Cedex 01, France"],"affiliations":[{"raw_affiliation_string":"LITA, Universit\u00e9 Paul Verlaine Metz, 57045, Metz Cedex 01, France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5009111693"],"corresponding_institution_ids":["https://openalex.org/I118353179"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.9766,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.7689769,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"388","last_page":"397"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.998199999332428,"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.998199999332428,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9399999976158142,"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/T11618","display_name":"Cholesterol and Lipid Metabolism","score":0.9125000238418579,"subfield":{"id":"https://openalex.org/subfields/2746","display_name":"Surgery"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6472575664520264},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6230328679084778},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5500444769859314},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5445213317871094},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4788368046283722},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.46901410818099976},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4600870609283447},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4398251175880432},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.41786640882492065},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.4160367250442505},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4132468104362488},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4052177369594574},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39387625455856323},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.24205967783927917}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6472575664520264},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6230328679084778},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5500444769859314},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5445213317871094},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4788368046283722},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.46901410818099976},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4600870609283447},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4398251175880432},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.41786640882492065},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.4160367250442505},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4132468104362488},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4052177369594574},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39387625455856323},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.24205967783927917},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-02882-3_39","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-02882-3_39","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.157.205","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.205","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://lita.sciences.univ-metz.fr/~kratsch/publications/cocoon09.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W144954708","https://openalex.org/W1523101460","https://openalex.org/W1577433976","https://openalex.org/W1617085997","https://openalex.org/W1975960975","https://openalex.org/W2029029999","https://openalex.org/W2078024271","https://openalex.org/W2099474653","https://openalex.org/W2143474538","https://openalex.org/W2561728979","https://openalex.org/W2748096547","https://openalex.org/W3176255773","https://openalex.org/W4251769540"],"related_works":["https://openalex.org/W587735977","https://openalex.org/W1978142926","https://openalex.org/W3157395178","https://openalex.org/W184455116","https://openalex.org/W963756281","https://openalex.org/W2028768252","https://openalex.org/W3153687528","https://openalex.org/W4287212971","https://openalex.org/W2296729072","https://openalex.org/W2187700168"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}