{"id":"https://openalex.org/W2481017292","doi":"https://doi.org/10.1007/978-3-642-40450-4_27","title":"List H-Coloring a Graph by Removing Few Vertices","display_name":"List H-Coloring a Graph by Removing Few Vertices","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2481017292","doi":"https://doi.org/10.1007/978-3-642-40450-4_27","mag":"2481017292"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-40450-4_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-40450-4_27","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/A5012330722","display_name":"Rajesh Chitnis","orcid":"https://orcid.org/0000-0002-6098-7770"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Rajesh Chitnis","raw_affiliation_strings":["Department of Computer Science, University of Maryland at College Park, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland at College Park, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042337191","display_name":"L\u00e1szl\u00f3 Egri","orcid":null},"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":"L\u00e1szl\u00f3 Egri","raw_affiliation_strings":["Computer and Automation Research Institute, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary"],"affiliations":[{"raw_affiliation_string":"Computer and Automation Research Institute, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary","institution_ids":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]}]},{"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/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"]},{"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"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"D\u00e1niel Marx","raw_affiliation_strings":["Computer and Automation Research Institute, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary"],"affiliations":[{"raw_affiliation_string":"Computer and Automation Research Institute, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary","institution_ids":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5012330722"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.823,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.75217563,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"313","last_page":"324"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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.9776999950408936,"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.9592999815940857,"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.8531813621520996},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6737279295921326},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6649075746536255},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5722776651382446},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5640970468521118},{"id":"https://openalex.org/keywords/homomorphism","display_name":"Homomorphism","score":0.542384922504425},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5360380411148071},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.47337859869003296},{"id":"https://openalex.org/keywords/graph-homomorphism","display_name":"Graph homomorphism","score":0.42949339747428894},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.419619619846344},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.2852481007575989},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.22488224506378174}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8531813621520996},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6737279295921326},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6649075746536255},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5722776651382446},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5640970468521118},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.542384922504425},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5360380411148071},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.47337859869003296},{"id":"https://openalex.org/C7036158","wikidata":"https://www.wikidata.org/wiki/Q3385162","display_name":"Graph homomorphism","level":5,"score":0.42949339747428894},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.419619619846344},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.2852481007575989},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.22488224506378174}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-40450-4_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-40450-4_27","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W655258421","https://openalex.org/W1517036688","https://openalex.org/W1533487312","https://openalex.org/W1545803195","https://openalex.org/W1567556142","https://openalex.org/W1570425181","https://openalex.org/W1689320375","https://openalex.org/W1981591809","https://openalex.org/W1989905036","https://openalex.org/W2018547288","https://openalex.org/W2028556486","https://openalex.org/W2033470072","https://openalex.org/W2051856222","https://openalex.org/W2065803871","https://openalex.org/W2077575555","https://openalex.org/W2089452528","https://openalex.org/W2089657800","https://openalex.org/W2106959995","https://openalex.org/W2121641644","https://openalex.org/W2126491855","https://openalex.org/W2132911512","https://openalex.org/W2150339067","https://openalex.org/W2401216365","https://openalex.org/W2569542361","https://openalex.org/W2949738152","https://openalex.org/W2951199065","https://openalex.org/W4247305611"],"related_works":["https://openalex.org/W4375869854","https://openalex.org/W2782277909","https://openalex.org/W1548348759","https://openalex.org/W2126491855","https://openalex.org/W2951237623","https://openalex.org/W2148608710","https://openalex.org/W4321649496","https://openalex.org/W2053242449","https://openalex.org/W4298569003","https://openalex.org/W2068446330"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}