{"id":"https://openalex.org/W2180270269","doi":"https://doi.org/10.1007/11682462_26","title":"The Computational Complexity of the Parallel Knock-Out Problem","display_name":"The Computational Complexity of the Parallel Knock-Out Problem","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2180270269","doi":"https://doi.org/10.1007/11682462_26","mag":"2180270269"},"language":"en","primary_location":{"id":"doi:10.1007/11682462_26","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11682462_26","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":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://durham-repository.worktribe.com/output/1162493","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068613759","display_name":"Hajo Broersma","orcid":"https://orcid.org/0000-0002-4678-3210"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Hajo Broersma","raw_affiliation_strings":["Department of Computer Science, Durham University,Science Laboratories, South Road, Durham, DH1 3LE, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University,Science Laboratories, South Road, Durham, DH1 3LE, UK","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029365650","display_name":"Matthew Johnson","orcid":"https://orcid.org/0000-0002-7295-2663"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Matthew Johnson","raw_affiliation_strings":["Department of Computer Science, Durham University,Science Laboratories, South Road, Durham, DH1 3LE, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University,Science Laboratories, South Road, Durham, DH1 3LE, UK","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027487467","display_name":"Dani\u00ebl Paulusma","orcid":"https://orcid.org/0000-0001-5945-9287"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Dani\u00ebl Paulusma","raw_affiliation_strings":["Department of Computer Science, Durham University,Science Laboratories, South Road, Durham, DH1 3LE, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University,Science Laboratories, South Road, Durham, DH1 3LE, UK","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061350983","display_name":"Iain A. Stewart","orcid":"https://orcid.org/0000-0002-0752-1971"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Iain A. Stewart","raw_affiliation_strings":["Department of Computer Science, Durham University,Science Laboratories, South Road, Durham, DH1 3LE, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University,Science Laboratories, South Road, Durham, DH1 3LE, UK","institution_ids":["https://openalex.org/I190082696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I190082696"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.5888,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.63578327,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"250","last_page":"261"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9919000267982483,"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.9919000267982483,"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.9868000149726868,"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.9760000109672546,"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/computational-complexity-theory","display_name":"Computational complexity theory","score":0.6339460015296936},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6186459064483643},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5840761065483093},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5657830834388733},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5634281635284424},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5125934481620789},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4949955344200134},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.4667283296585083},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4491460621356964},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3718627691268921},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22989684343338013}],"concepts":[{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.6339460015296936},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6186459064483643},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5840761065483093},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5657830834388733},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5634281635284424},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5125934481620789},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4949955344200134},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.4667283296585083},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4491460621356964},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3718627691268921},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22989684343338013},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/11682462_26","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11682462_26","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:ris.utwente.nl:openaire_cris_publications/a9a15a15-b53a-4579-9420-26b991605c9e","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/a9a15a15-b53a-4579-9420-26b991605c9e","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Broersma, H, Johnson, M, Paulusma, D & Stewart, I A 2006, The Computational Complexity of the Parallel Knock-Out Problem. in J R Correa, A Hevia & M Kiwi (eds), LATIN 2006: Theoretical Informatics : 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006. Proceedings. Lecture Notes in Computer Science, vol. 3887, Springer, Berlin, pp. 250-261, 7th Latin American Symposium on Theoretical Informatics, LATIN 2006, Valdivia, Chile, 20/03/06. https://doi.org/10.1007/11682462_26","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:6130","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/6130/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Correa, J. R. & Hevia, A. & Kiwi, M. (Eds.). (2006). LATIN 2006 : theoretical informatics: : 7th Latin American symposium, Valdivia, Chile, March 20-24, 2006 : proceedings. Berlin: Springer, pp. 250-261, Lecture notes in computer science(3887)","raw_type":"Book chapter"},{"id":"pmh:oai:durham-repository.worktribe.com:1162493","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1162493","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Presentation / Conference Contribution"}],"best_oa_location":{"id":"pmh:oai:durham-repository.worktribe.com:1162493","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1162493","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Presentation / Conference Contribution"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1484040084","https://openalex.org/W1601764037","https://openalex.org/W1985061810","https://openalex.org/W2011039300","https://openalex.org/W2028357390","https://openalex.org/W2040814793","https://openalex.org/W2071675546","https://openalex.org/W2177120687","https://openalex.org/W4233485246","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W961142965","https://openalex.org/W2810583502","https://openalex.org/W2062731608","https://openalex.org/W4392856484","https://openalex.org/W4312809402","https://openalex.org/W2606468876","https://openalex.org/W4399652722","https://openalex.org/W1547393828","https://openalex.org/W4392543953","https://openalex.org/W2384822215"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}