{"id":"https://openalex.org/W1857509987","doi":"https://doi.org/10.1007/11534273_20","title":"Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms","display_name":"Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1857509987","doi":"https://doi.org/10.1007/11534273_20","mag":"1857509987"},"language":"en","primary_location":{"id":"doi:10.1007/11534273_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11534273_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/A5007961513","display_name":"Shlomo Moran","orcid":"https://orcid.org/0000-0003-3222-3308"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Shlomo Moran","raw_affiliation_strings":["Computer Science dept., Technion, Haifa, 32000, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science dept., Technion, Haifa, 32000, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063493591","display_name":"Sagi Snir","orcid":"https://orcid.org/0000-0001-5833-7659"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sagi Snir","raw_affiliation_strings":["Mathematics dept., University of California, Berkeley, CA, 94720, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematics dept., University of California, Berkeley, CA, 94720, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.8867,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.94224789,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"218","last_page":"232"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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.9991000294685364,"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/T13991","display_name":"Nuclear Receptors and Signaling","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/2804","display_name":"Cellular and Molecular Neuroscience"},"field":{"id":"https://openalex.org/fields/28","display_name":"Neuroscience"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9866999983787537,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6834043860435486},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.6140764951705933},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6000638604164124},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5990829467773438},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4976489841938019},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45375561714172363},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4224197268486023},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.41055893898010254},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38296884298324585},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3760073781013489},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3481861650943756},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.23951104283332825}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6834043860435486},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.6140764951705933},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6000638604164124},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5990829467773438},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4976489841938019},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45375561714172363},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4224197268486023},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.41055893898010254},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38296884298324585},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3760073781013489},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3481861650943756},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.23951104283332825},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/11534273_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11534273_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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.121.8595","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.8595","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.technion.ac.il/~moran/r/PS/jour05.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.83.5861","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.5861","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://math.berkeley.edu/~ssagi/papers/moran/jour-revised_Sep-29.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":21,"referenced_works":["https://openalex.org/W1572683371","https://openalex.org/W1579932957","https://openalex.org/W1651215666","https://openalex.org/W1974532785","https://openalex.org/W1988252299","https://openalex.org/W1999809115","https://openalex.org/W2042328724","https://openalex.org/W2048878652","https://openalex.org/W2065973977","https://openalex.org/W2074507113","https://openalex.org/W2075495614","https://openalex.org/W2075503802","https://openalex.org/W2078650268","https://openalex.org/W2089702026","https://openalex.org/W2098409879","https://openalex.org/W2134766004","https://openalex.org/W2155316689","https://openalex.org/W2222512263","https://openalex.org/W2913688336","https://openalex.org/W4292230561","https://openalex.org/W4388212639"],"related_works":["https://openalex.org/W3013085049","https://openalex.org/W1793337513","https://openalex.org/W2296389180","https://openalex.org/W3153687528","https://openalex.org/W4287212971","https://openalex.org/W4288324104","https://openalex.org/W940406003","https://openalex.org/W2941078816","https://openalex.org/W2166142773","https://openalex.org/W1621836093"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}