{"id":"https://openalex.org/W110017694","doi":"https://doi.org/10.1007/978-3-319-04657-0_27","title":"Complexity of Disjoint \u03a0-Vertex Deletion for Disconnected Forbidden Subgraphs","display_name":"Complexity of Disjoint \u03a0-Vertex Deletion for Disconnected Forbidden Subgraphs","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W110017694","doi":"https://doi.org/10.1007/978-3-319-04657-0_27","mag":"110017694"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-04657-0_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-04657-0_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/A5104688098","display_name":"Jiong Guo","orcid":"https://orcid.org/0000-0003-2137-205X"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Jiong Guo","raw_affiliation_strings":["Universit\u00e4t des Saarlandes, Campus E 1.7, 66123, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t des Saarlandes, Campus E 1.7, 66123, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043846392","display_name":"Yash Raj Shrestha","orcid":"https://orcid.org/0000-0002-2699-4723"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Yash Raj Shrestha","raw_affiliation_strings":["Universit\u00e4t des Saarlandes, Campus E 1.7, 66123, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t des Saarlandes, Campus E 1.7, 66123, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5104688098"],"corresponding_institution_ids":["https://openalex.org/I91712215"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.03955029,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"286","last_page":"297"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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.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.9991999864578247,"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/computer-science","display_name":"Computer science","score":0.7460699677467346},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7378169298171997},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6520501375198364},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4536045491695404},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4300040602684021},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40932270884513855},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3107648491859436},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.24166899919509888},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1801028847694397}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7460699677467346},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7378169298171997},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6520501375198364},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4536045491695404},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4300040602684021},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40932270884513855},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3107648491859436},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.24166899919509888},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1801028847694397}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-319-04657-0_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-04657-0_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"},{"id":"pmh:oai:iris.unil.ch:iris/58022","is_oa":false,"landing_page_url":"https://iris.unil.ch/handle/iris/58022","pdf_url":null,"source":{"id":"https://openalex.org/S7407055444","display_name":"IRIS","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"book part"},{"id":"pmh:oai:serval.unil.ch:BIB_6A0B782A8849","is_oa":false,"landing_page_url":"https://serval.unil.ch/notice/serval:BIB_6A0B782A8849","pdf_url":null,"source":{"id":"https://openalex.org/S4306401797","display_name":"SERVAL (Universit\u00e9 de Lausanne)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210093590","host_organization_name":"Swiss School of Archaeology in Greece","host_organization_lineage":["https://openalex.org/I4210093590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms and Computation, pp. 286-297","raw_type":"incollection"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.550000011920929}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1505397334","https://openalex.org/W1516576670","https://openalex.org/W1517036688","https://openalex.org/W1586744224","https://openalex.org/W1969357318","https://openalex.org/W1971393213","https://openalex.org/W1997477404","https://openalex.org/W2004181701","https://openalex.org/W2011039300","https://openalex.org/W2024517697","https://openalex.org/W2051856222","https://openalex.org/W2052227003","https://openalex.org/W2054396313","https://openalex.org/W2126383829","https://openalex.org/W2134628243","https://openalex.org/W2147466109","https://openalex.org/W2157295389","https://openalex.org/W2166566648","https://openalex.org/W2188633810","https://openalex.org/W2798588639","https://openalex.org/W2886475100","https://openalex.org/W2913688336","https://openalex.org/W4285719527","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W4256429076","https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W2348092930","https://openalex.org/W2012063272","https://openalex.org/W3129272755","https://openalex.org/W2138685729","https://openalex.org/W26693340","https://openalex.org/W3111310291"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}