{"id":"https://openalex.org/W1532861364","doi":"https://doi.org/10.1007/978-3-642-03351-3_15","title":"Partitioning Graphs into Connected Parts","display_name":"Partitioning Graphs into Connected Parts","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W1532861364","doi":"https://doi.org/10.1007/978-3-642-03351-3_15","mag":"1532861364"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-03351-3_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-03351-3_15","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/1161004","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":true,"raw_author_name":"Pim van \u2019t Hof","raw_affiliation_strings":["Department of Computer Science, University of Durham, Science Laboratories, South Road, Durham, DH1 3LE, England"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Durham, Science Laboratories, South Road, Durham, DH1 3LE, England","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, University of Durham, Science Laboratories, South Road, Durham, DH1 3LE, England"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Durham, Science Laboratories, South Road, Durham, DH1 3LE, England","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":["Dept. of Mathematics and Computer Science, Eindhoven University of Technology, P.O.\u00a0Box 513, 5600 MB, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Dept. of Mathematics and Computer Science, Eindhoven University of Technology, P.O.\u00a0Box 513, 5600 MB, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5017522059"],"corresponding_institution_ids":["https://openalex.org/I190082696"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.9593,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.91664947,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"143","last_page":"154"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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.9994000196456909,"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.9987999796867371,"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.991599977016449,"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.8102381229400635},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7206323146820068},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5483657717704773},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4553963243961334},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44926685094833374},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4414016306400299},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4278610050678253},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.4218023121356964},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.41123417019844055},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3989313840866089},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.2561817765235901}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8102381229400635},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7206323146820068},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5483657717704773},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4553963243961334},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44926685094833374},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4414016306400299},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4278610050678253},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.4218023121356964},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.41123417019844055},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3989313840866089},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.2561817765235901},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/978-3-642-03351-3_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-03351-3_15","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:pure.tue.nl:openaire_cris_publications/1a401200-31c1-496e-bfb1-1db6ace73881","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/1a401200-31c1-496e-bfb1-1db6ace73881","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":null,"license_id":null,"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. in A Frid, A S Morozov, A Rybalchenko & K W Wagner (eds), Computer Science: Theory and Applications (Fourth International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009, Proceedings). Lecture Notes in Computer Science, vol. 5675, Springer, Berlin, pp. 143-154. https://doi.org/10.1007/978-3-642-03351-3_15","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:6135","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/6135/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196258","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":"Frid, A. & Morozov, A. & Rybalchenko, A. & Wagner, K. W. (Eds.). (2009). Computer science - theory and applications. Heidelberg: Springer, pp. 143-154, Lecture notes in computer science(5675)","raw_type":"Book chapter"},{"id":"pmh:oai:durham-repository.worktribe.com:1161004","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1161004","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"},{"id":"pmh:tue:oai:pure.tue.nl:publications/1a401200-31c1-496e-bfb1-1db6ace73881","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/1a401200-31c1-496e-bfb1-1db6ace73881","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science: Theory and Applications (Fourth International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009, Proceedings), 143 - 154","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":{"id":"pmh:oai:durham-repository.worktribe.com:1161004","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1161004","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":13,"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/W2011039300","https://openalex.org/W2040813792","https://openalex.org/W2059639406","https://openalex.org/W2105722028","https://openalex.org/W2282776087","https://openalex.org/W2798588639","https://openalex.org/W2923846427","https://openalex.org/W2987461903"],"related_works":["https://openalex.org/W2499670206","https://openalex.org/W132109778","https://openalex.org/W1989984537","https://openalex.org/W2995523799","https://openalex.org/W2132921321","https://openalex.org/W2065006817","https://openalex.org/W2129550502","https://openalex.org/W2116465486","https://openalex.org/W2101572961","https://openalex.org/W1995629993"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}