{"id":"https://openalex.org/W4207062810","doi":"https://doi.org/10.1007/978-3-030-95018-7_17","title":"Approximation and\u00a0Parameterized Algorithms for\u00a0Balanced Connected Partition Problems","display_name":"Approximation and\u00a0Parameterized Algorithms for\u00a0Balanced Connected Partition Problems","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4207062810","doi":"https://doi.org/10.1007/978-3-030-95018-7_17"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-95018-7_17","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-95018-7_17","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/A5062469450","display_name":"Phablo F. S. Moura","orcid":"https://orcid.org/0000-0002-8176-0874"},"institutions":[{"id":"https://openalex.org/I110200422","display_name":"Universidade Federal de Minas Gerais","ror":"https://ror.org/0176yjw32","country_code":"BR","type":"education","lineage":["https://openalex.org/I110200422"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Phablo F. S. Moura","raw_affiliation_strings":["Departamento de Ci\u00eancia da Computa\u00e7\u00e3o, Universidade Federal de Minas Gerais, Belo Horizonte, Brazil"],"raw_orcid":"https://orcid.org/0000-0002-8176-0874","affiliations":[{"raw_affiliation_string":"Departamento de Ci\u00eancia da Computa\u00e7\u00e3o, Universidade Federal de Minas Gerais, Belo Horizonte, Brazil","institution_ids":["https://openalex.org/I110200422"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090909690","display_name":"Matheus J. Ota","orcid":"https://orcid.org/0000-0002-3730-6420"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Matheus Jun Ota","raw_affiliation_strings":["Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada"],"raw_orcid":"https://orcid.org/0000-0002-3730-6420","affiliations":[{"raw_affiliation_string":"Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054139790","display_name":"Yoshiko Wakabayashi","orcid":"https://orcid.org/0000-0002-8229-3139"},"institutions":[{"id":"https://openalex.org/I17974374","display_name":"Universidade de S\u00e3o Paulo","ror":"https://ror.org/036rp1748","country_code":"BR","type":"education","lineage":["https://openalex.org/I17974374"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Yoshiko Wakabayashi","raw_affiliation_strings":["Instituto de Matem\u00e1tica e Estat\u00edstica, Universidade de S\u00e3o Paulo, S\u00e3o Paulo, Brazil"],"raw_orcid":"https://orcid.org/0000-0002-8229-3139","affiliations":[{"raw_affiliation_string":"Instituto de Matem\u00e1tica e Estat\u00edstica, Universidade de S\u00e3o Paulo, S\u00e3o Paulo, Brazil","institution_ids":["https://openalex.org/I17974374"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5090909690"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.3275,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.78317798,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"211","last_page":"223"},"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.9990000128746033,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.773471474647522},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7300888299942017},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5550767779350281},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5512337684631348},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4867362976074219},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.48486456274986267},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.48130881786346436},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4459802806377411},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38612738251686096},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3450886905193329}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.773471474647522},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7300888299942017},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5550767779350281},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5512337684631348},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4867362976074219},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.48486456274986267},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.48130881786346436},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4459802806377411},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38612738251686096},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3450886905193329}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-030-95018-7_17","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-95018-7_17","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:lirias2repo.kuleuven.be:20.500.12942/767114","is_oa":false,"landing_page_url":"https://lirias.kuleuven.be/handle/20.500.12942/767114","pdf_url":null,"source":{"id":"https://openalex.org/S7407055369","display_name":"Lirias","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":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"8th International Conference on Algorithms and Discrete Applied Mathematics, INDIA, Puducherry, 10-12 February 2022","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1485295947","https://openalex.org/W1967968533","https://openalex.org/W1969849690","https://openalex.org/W1970194957","https://openalex.org/W1970776799","https://openalex.org/W1971764118","https://openalex.org/W1977623721","https://openalex.org/W1993150073","https://openalex.org/W2002805364","https://openalex.org/W2052757794","https://openalex.org/W2053181263","https://openalex.org/W2083409154","https://openalex.org/W2890176466","https://openalex.org/W2979185190","https://openalex.org/W3006133478","https://openalex.org/W3118973667","https://openalex.org/W4235515293"],"related_works":["https://openalex.org/W3210693467","https://openalex.org/W2369348675","https://openalex.org/W4307106633","https://openalex.org/W4288091021","https://openalex.org/W4226484513","https://openalex.org/W1974201616","https://openalex.org/W2949883286","https://openalex.org/W4300822877","https://openalex.org/W4287021602","https://openalex.org/W3194327368"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2}],"updated_date":"2026-04-24T08:23:43.765630","created_date":"2025-10-10T00:00:00"}