{"id":"https://openalex.org/W1836455089","doi":"https://doi.org/10.1007/s00453-016-0139-6","title":"List H-Coloring a Graph by Removing Few Vertices","display_name":"List H-Coloring a Graph by Removing Few Vertices","publication_year":2016,"publication_date":"2016-04-27","ids":{"openalex":"https://openalex.org/W1836455089","doi":"https://doi.org/10.1007/s00453-016-0139-6","mag":"1836455089"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-016-0139-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-016-0139-6","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.birmingham.ac.uk/en/publications/d86b9ed4-cd5c-4f77-b849-acffd448f017","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012330722","display_name":"Rajesh Chitnis","orcid":"https://orcid.org/0000-0002-6098-7770"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Rajesh Chitnis","raw_affiliation_strings":["Weizmann Institute of Science, Rehovot, Israel","\u2021Weizmann Institute of Science, Rehovot, Israel;"],"affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]},{"raw_affiliation_string":"\u2021Weizmann Institute of Science, Rehovot, Israel;","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042337191","display_name":"L\u00e1szl\u00f3 Egri","orcid":null},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"L\u00e1szl\u00f3 Egri","raw_affiliation_strings":["Simon Fraser University, Burnaby, Canada","( Simon Fraser University Burnaby Canada )"],"affiliations":[{"raw_affiliation_string":"Simon Fraser University, Burnaby, Canada","institution_ids":["https://openalex.org/I18014758"]},{"raw_affiliation_string":"( Simon Fraser University Burnaby Canada )","institution_ids":["https://openalex.org/I18014758"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012849997","display_name":"D\u00e1niel Marx","orcid":"https://orcid.org/0000-0002-5686-8314"},"institutions":[{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"funder","lineage":["https://openalex.org/I7597260"]},{"id":"https://openalex.org/I4210117195","display_name":"Institute for Computer Science and Control","ror":"https://ror.org/0249v7n71","country_code":"HU","type":"facility","lineage":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"D\u00e1niel Marx","raw_affiliation_strings":["Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary"],"affiliations":[{"raw_affiliation_string":"Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary","institution_ids":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5012330722"],"corresponding_institution_ids":["https://openalex.org/I53964585"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.4375,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.82497873,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"78","issue":"1","first_page":"110","last_page":"146"},"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9843999743461609,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9624999761581421,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8874258399009705},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7606935501098633},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6783995628356934},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.678198516368866},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.562610924243927},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5535696148872375},{"id":"https://openalex.org/keywords/homomorphism","display_name":"Homomorphism","score":0.5215482711791992},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4828508496284485},{"id":"https://openalex.org/keywords/graph-homomorphism","display_name":"Graph homomorphism","score":0.4534454941749573},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4056379497051239},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.26897895336151123},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.21100151538848877}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8874258399009705},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7606935501098633},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6783995628356934},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.678198516368866},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.562610924243927},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5535696148872375},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.5215482711791992},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4828508496284485},{"id":"https://openalex.org/C7036158","wikidata":"https://www.wikidata.org/wiki/Q3385162","display_name":"Graph homomorphism","level":5,"score":0.4534454941749573},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4056379497051239},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.26897895336151123},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.21100151538848877}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s00453-016-0139-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-016-0139-6","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/d86b9ed4-cd5c-4f77-b849-acffd448f017","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/d86b9ed4-cd5c-4f77-b849-acffd448f017","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"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":"Chitnis, R, Egri, L & Marx, D 2017, 'List H-coloring a graph by removing few vertices', Algorithmica, vol. 78, no. 1, pp. 110-146. https://doi.org/10.1007/s00453-016-0139-6","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:publications/d86b9ed4-cd5c-4f77-b849-acffd448f017","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85014817745&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"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":"Chitnis , R , Egri , L & Marx , D 2017 , ' List H-coloring a graph by removing few vertices ' , Algorithmica , vol. 78 , no. 1 , pp. 110-146 . https://doi.org/10.1007/s00453-016-0139-6","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/d86b9ed4-cd5c-4f77-b849-acffd448f017","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/d86b9ed4-cd5c-4f77-b849-acffd448f017","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"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":"Chitnis, R, Egri, L & Marx, D 2017, 'List H-coloring a graph by removing few vertices', Algorithmica, vol. 78, no. 1, pp. 110-146. https://doi.org/10.1007/s00453-016-0139-6","raw_type":"article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1129333050","display_name":null,"funder_award_id":"N000141110662","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G4536344221","display_name":null,"funder_award_id":"CCF-11616226","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5539758277","display_name":null,"funder_award_id":"280152","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G7324173974","display_name":null,"funder_award_id":"NK105645","funder_id":"https://openalex.org/F4320321994","funder_display_name":"Hungarian Scientific Research Fund"},{"id":"https://openalex.org/G7717912469","display_name":null,"funder_award_id":"CAREER 1053605","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7808751303","display_name":null,"funder_award_id":"FA9550-12-1-0423","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320321994","display_name":"Hungarian Scientific Research Fund","ror":"https://ror.org/00v349e63"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W655258421","https://openalex.org/W1485150579","https://openalex.org/W1492330052","https://openalex.org/W1517036688","https://openalex.org/W1533487312","https://openalex.org/W1567556142","https://openalex.org/W1570425181","https://openalex.org/W1574344913","https://openalex.org/W1846185267","https://openalex.org/W1971826818","https://openalex.org/W1978447499","https://openalex.org/W1980809300","https://openalex.org/W1981591809","https://openalex.org/W1989905036","https://openalex.org/W1991579759","https://openalex.org/W2018547288","https://openalex.org/W2028556486","https://openalex.org/W2033470072","https://openalex.org/W2046652577","https://openalex.org/W2051856222","https://openalex.org/W2077575555","https://openalex.org/W2089657800","https://openalex.org/W2116087731","https://openalex.org/W2121641644","https://openalex.org/W2126491855","https://openalex.org/W2132911512","https://openalex.org/W2150339067","https://openalex.org/W2166115470","https://openalex.org/W2401216365","https://openalex.org/W2490706771","https://openalex.org/W2495593369","https://openalex.org/W2568613863","https://openalex.org/W2568986002","https://openalex.org/W2913688336","https://openalex.org/W2949738152","https://openalex.org/W4247305611","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W755952011","https://openalex.org/W2990042548","https://openalex.org/W4285056899","https://openalex.org/W3049229033","https://openalex.org/W2587433615","https://openalex.org/W1779359754","https://openalex.org/W1988771411","https://openalex.org/W4301487278","https://openalex.org/W2014735387","https://openalex.org/W2537038771"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":6},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}