{"id":"https://openalex.org/W1607118338","doi":"https://doi.org/10.1007/978-3-642-32589-2_34","title":"Fast Balanced Partitioning Is Hard Even on Grids and Trees","display_name":"Fast Balanced Partitioning Is Hard Even on Grids and Trees","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W1607118338","doi":"https://doi.org/10.1007/978-3-642-32589-2_34","mag":"1607118338"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-32589-2_34","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-32589-2_34","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/A5000019988","display_name":"Andreas Emil Feldmann","orcid":"https://orcid.org/0000-0001-6229-5332"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Andreas Emil Feldmann","raw_affiliation_strings":["Institute of Theoretical Computer Science, ETH Z\u00fcrich, Switzerland"],"affiliations":[{"raw_affiliation_string":"Institute of Theoretical Computer Science, ETH Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5000019988"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.3178,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.87244701,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"372","last_page":"382"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9988999962806702,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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"}}],"keywords":[{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.6691822409629822},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5980098247528076},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5552107691764832},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.5443292856216431},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5422142744064331},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5279934406280518},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5177963972091675},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.514809787273407},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.45820310711860657},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44482243061065674},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43294912576675415},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42851948738098145},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39681047201156616}],"concepts":[{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.6691822409629822},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5980098247528076},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5552107691764832},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.5443292856216431},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5422142744064331},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5279934406280518},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5177963972091675},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.514809787273407},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.45820310711860657},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44482243061065674},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43294912576675415},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42851948738098145},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39681047201156616},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-32589-2_34","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-32589-2_34","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W18869936","https://openalex.org/W110441439","https://openalex.org/W1022217070","https://openalex.org/W1168977942","https://openalex.org/W1568341440","https://openalex.org/W1571037334","https://openalex.org/W1866667937","https://openalex.org/W1920501755","https://openalex.org/W1971758446","https://openalex.org/W1975464357","https://openalex.org/W1977360022","https://openalex.org/W1982180670","https://openalex.org/W2011039300","https://openalex.org/W2020632401","https://openalex.org/W2022490362","https://openalex.org/W2024654848","https://openalex.org/W2029282358","https://openalex.org/W2030087828","https://openalex.org/W2042899161","https://openalex.org/W2049142782","https://openalex.org/W2091515017","https://openalex.org/W2132603077","https://openalex.org/W2133248904","https://openalex.org/W2150148016","https://openalex.org/W2161678741","https://openalex.org/W2165303918","https://openalex.org/W2169528477","https://openalex.org/W2301629032","https://openalex.org/W2619061098","https://openalex.org/W2699437914","https://openalex.org/W3098342588","https://openalex.org/W3139448511","https://openalex.org/W4249939137"],"related_works":["https://openalex.org/W3139829055","https://openalex.org/W2583811263","https://openalex.org/W2962917430","https://openalex.org/W1598028160","https://openalex.org/W2028468530","https://openalex.org/W3211941742","https://openalex.org/W4299801389","https://openalex.org/W2035944803","https://openalex.org/W2037387767","https://openalex.org/W2745252358"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}