{"id":"https://openalex.org/W4213168420","doi":"https://doi.org/10.1016/j.tcs.2009.06.028","title":"Partitioning graphs into connected parts","display_name":"Partitioning graphs into connected parts","publication_year":2009,"publication_date":"2009-06-24","ids":{"openalex":"https://openalex.org/W4213168420","doi":"https://doi.org/10.1016/j.tcs.2009.06.028"},"language":"en","primary_location":{"id":"doi:10.1016/j.tcs.2009.06.028","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2009.06.028","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0304397509004198/pdf","source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.sciencedirect.com/science/article/pii/S0304397509004198/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017522059","display_name":"Pim van \u2019t Hof","orcid":"https://orcid.org/0000-0002-1778-7212"},"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":"Pim van \u2019t Hof","raw_affiliation_strings":["Department of Computer Science, Durham University, Science Laboratories, South Road, Durham DH1 3LE, England, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, Science Laboratories, South Road, Durham DH1 3LE, England, United Kingdom","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":true,"raw_author_name":"Dani\u00ebl Paulusma","raw_affiliation_strings":["Department of Computer Science, Durham University, Science Laboratories, South Road, Durham DH1 3LE, England, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, Science Laboratories, South Road, Durham DH1 3LE, England, United Kingdom","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080746477","display_name":"Gerhard J. Woeginger","orcid":"https://orcid.org/0000-0001-8816-2693"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Gerhard J. Woeginger","raw_affiliation_strings":["Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5027487467"],"corresponding_institution_ids":["https://openalex.org/I190082696"],"apc_list":{"value":2600,"currency":"USD","value_usd":2600},"apc_paid":null,"fwci":1.9285,"has_fulltext":true,"cited_by_count":31,"citation_normalized_percentile":{"value":0.86582727,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"410","issue":"47-49","first_page":"4834","last_page":"4843"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9988999962806702,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8404861688613892},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6927379369735718},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6292761564254761},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5314074158668518},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49136343598365784},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4214092791080475},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41220593452453613}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8404861688613892},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6927379369735718},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6292761564254761},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5314074158668518},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49136343598365784},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4214092791080475},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41220593452453613}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1016/j.tcs.2009.06.028","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2009.06.028","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0304397509004198/pdf","source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/6b52d007-c13f-43b2-9fab-e4df98bf2b32","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/6b52d007-c13f-43b2-9fab-e4df98bf2b32","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Hof, van 't, P, Paulusma, D & Woeginger, G J 2009, 'Partitioning graphs into connected parts', Theoretical Computer Science, vol. 410, no. 47-49, pp. 4834-4843. https://doi.org/10.1016/j.tcs.2009.06.028","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:6131","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/6131/","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":"Theoretical computer science, 2009, Vol.410(47-49), pp.4834-4843 [Peer Reviewed Journal]","raw_type":"Article"},{"id":"pmh:oai:durham-repository.worktribe.com:1523871","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1523871","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":"Journal Article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/6b52d007-c13f-43b2-9fab-e4df98bf2b32","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/6b52d007-c13f-43b2-9fab-e4df98bf2b32","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"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":"Theoretical Computer Science, 410(47-49), 4834 - 4843. Elsevier","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1016/j.tcs.2009.06.028","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2009.06.028","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0304397509004198/pdf","source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"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"},{"id":"https://openalex.org/G4975011052","display_name":"Exact algorithms for NP-hard problems","funder_award_id":"EP/D053633/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G5724249324","display_name":null,"funder_award_id":"639.033.403","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320308458","display_name":"American Surgical Association Foundation","ror":"https://ror.org/05grbyt82"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4213168420.pdf","grobid_xml":"https://content.openalex.org/works/W4213168420.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W1509433326","https://openalex.org/W1550397373","https://openalex.org/W1666834859","https://openalex.org/W1983504800","https://openalex.org/W2005079828","https://openalex.org/W2040813792","https://openalex.org/W2059639406","https://openalex.org/W2105722028","https://openalex.org/W2987461903","https://openalex.org/W4297330257","https://openalex.org/W6632780324"],"related_works":["https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W4256429076","https://openalex.org/W2012063272","https://openalex.org/W2348092930","https://openalex.org/W1553466895","https://openalex.org/W1519201794","https://openalex.org/W1629505938","https://openalex.org/W2767824041","https://openalex.org/W1987322712"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":4}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2022-02-24T00:00:00"}