{"id":"https://openalex.org/W2177120687","doi":"https://doi.org/10.1007/978-3-540-72951-8_26","title":"Upper Bounds and Algorithms for Parallel Knock-Out Numbers","display_name":"Upper Bounds and Algorithms for Parallel Knock-Out Numbers","publication_year":2007,"publication_date":"2007-07-01","ids":{"openalex":"https://openalex.org/W2177120687","doi":"https://doi.org/10.1007/978-3-540-72951-8_26","mag":"2177120687"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-72951-8_26","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-72951-8_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":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://durham-repository.worktribe.com/output/1154444","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":true,"raw_author_name":"Hajo Broersma","raw_affiliation_strings":["Department of Computer Science, Durham University, Science Laboratories, South Road, Durham DH1 3LE, U.K"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, Science Laboratories, South Road, Durham DH1 3LE, U.K","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, U.K"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, Science Laboratories, South Road, Durham DH1 3LE, U.K","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"last","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, U.K"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, Science Laboratories, South Road, Durham DH1 3LE, U.K","institution_ids":["https://openalex.org/I190082696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5068613759"],"corresponding_institution_ids":["https://openalex.org/I190082696"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.3411,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.64410215,"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":"328","last_page":"340"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10829","display_name":"Interconnection Networks and Systems","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.79469895362854},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5952276587486267},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5908112525939941},{"id":"https://openalex.org/keywords/independence-number","display_name":"Independence number","score":0.5831166505813599},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5377623438835144},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5043319463729858},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.48079076409339905},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.469698429107666},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4493541717529297}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.79469895362854},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5952276587486267},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5908112525939941},{"id":"https://openalex.org/C2984853995","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independence number","level":3,"score":0.5831166505813599},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5377623438835144},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5043319463729858},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.48079076409339905},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.469698429107666},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4493541717529297},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-540-72951-8_26","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-72951-8_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/f05b738b-cd74-4297-9728-677d53b83820","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/f05b738b-cd74-4297-9728-677d53b83820","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 J, Johnson, M & Paulusma, D 2007, Upper bounds and algorithms for parallel knock-out numbers. in G Prencipe & S Zaks (eds), SIROCCO 2007: 14th International Colloquium on Structural Information and Communication Complexity. Lecture Notes in Computer Science, no. 1, vol. 4474, Springer, Berlin, pp. 328-340. https://doi.org/10.1007/978-3-540-72951-8_26","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:durham-repository.worktribe.com:1154444","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1154444","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:1154444","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1154444","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":[{"id":"https://openalex.org/G3476746706","display_name":null,"funder_award_id":"EP/D053633/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1484040084","https://openalex.org/W1527122081","https://openalex.org/W2040814793","https://openalex.org/W2071675546","https://openalex.org/W2092366448","https://openalex.org/W2180270269","https://openalex.org/W3022336920","https://openalex.org/W4233485246"],"related_works":["https://openalex.org/W2767039348","https://openalex.org/W4300899577","https://openalex.org/W3194471551","https://openalex.org/W4375956809","https://openalex.org/W1581373162","https://openalex.org/W4393325717","https://openalex.org/W72870998","https://openalex.org/W1973053550","https://openalex.org/W3148147474","https://openalex.org/W2963167154"],"abstract_inverted_index":null,"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2026-03-17T09:09:15.849793","created_date":"2025-10-10T00:00:00"}