{"id":"https://openalex.org/W2088647669","doi":"https://doi.org/10.1137/s009753970139567x","title":"Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs","display_name":"Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2088647669","doi":"https://doi.org/10.1137/s009753970139567x","mag":"2088647669"},"language":"en","primary_location":{"id":"doi:10.1137/s009753970139567x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s009753970139567x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","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/A5071305115","display_name":"Klaus Jansen","orcid":"https://orcid.org/0000-0001-8358-6796"},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Christian-Albrechts-Universit\u00e4t zu Kiel","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Klaus Jansen","raw_affiliation_strings":["Institute of Computer Science and Applied Mathematics, Christian-Albrechts-University of Kiel, Kiel, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer Science and Applied Mathematics, Christian-Albrechts-University of Kiel, Kiel, Germany#TAB#","institution_ids":["https://openalex.org/I32021983"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108090276","display_name":"Marek Karpi\u0144ski","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Marek Karpinski","raw_affiliation_strings":["Dept. of Comput. Sci., Univ. of Bonn, Bonn, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Comput. Sci., Univ. of Bonn, Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016509031","display_name":"Andrzej Lingas","orcid":"https://orcid.org/0000-0003-4998-9844"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Andrzej Lingas","raw_affiliation_strings":["Department of Computer Science, Lund University, Lund, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062470620","display_name":"Eike Seidel","orcid":null},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Christian-Albrechts-Universit\u00e4t zu Kiel","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Eike Seidel","raw_affiliation_strings":["Institute of Computer Science and Applied Mathematics, Christian-Albrechts-University of Kiel, Kiel, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer Science and Applied Mathematics, Christian-Albrechts-University of Kiel, Kiel, Germany#TAB#","institution_ids":["https://openalex.org/I32021983"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.3257,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.92573217,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"35","issue":"1","first_page":"110","last_page":"119"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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":1.0,"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.9994999766349792,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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/combinatorics","display_name":"Combinatorics","score":0.7043118476867676},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.6958909034729004},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6836787462234497},{"id":"https://openalex.org/keywords/bisection-method","display_name":"Bisection method","score":0.5289706587791443},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5282394289970398},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5207179188728333},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.503065288066864},{"id":"https://openalex.org/keywords/bisection","display_name":"Bisection","score":0.4731774628162384},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.47135108709335327},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4629918038845062},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.44288238883018494},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.43216589093208313},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4248381555080414},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.40818437933921814},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4038538336753845},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2950870990753174},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.19360527396202087},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.15403643250465393},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06967601180076599}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7043118476867676},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6958909034729004},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6836787462234497},{"id":"https://openalex.org/C157544257","wikidata":"https://www.wikidata.org/wiki/Q866300","display_name":"Bisection method","level":2,"score":0.5289706587791443},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5282394289970398},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5207179188728333},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.503065288066864},{"id":"https://openalex.org/C31599958","wikidata":"https://www.wikidata.org/wiki/Q3128632","display_name":"Bisection","level":2,"score":0.4731774628162384},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.47135108709335327},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4629918038845062},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.44288238883018494},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.43216589093208313},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4248381555080414},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.40818437933921814},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4038538336753845},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2950870990753174},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.19360527396202087},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.15403643250465393},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06967601180076599},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s009753970139567x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s009753970139567x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:lup.lub.lu.se:97428ca8-276a-4de4-afcc-7e5dbdaf8c54","is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/216779","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 0097-5397","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W59816656","https://openalex.org/W1512148653","https://openalex.org/W1601503375","https://openalex.org/W1798831264","https://openalex.org/W1985123706","https://openalex.org/W2011039300","https://openalex.org/W2013520638","https://openalex.org/W2019044741","https://openalex.org/W2028738060","https://openalex.org/W2029448190","https://openalex.org/W2034501206","https://openalex.org/W2038643780","https://openalex.org/W2059372025","https://openalex.org/W2065641139","https://openalex.org/W2073705438","https://openalex.org/W2074210283","https://openalex.org/W2079751294","https://openalex.org/W2081957612","https://openalex.org/W2087083200","https://openalex.org/W2113292309","https://openalex.org/W2129027842","https://openalex.org/W2156760067","https://openalex.org/W2986773320"],"related_works":["https://openalex.org/W2329494729","https://openalex.org/W41290553","https://openalex.org/W3112697985","https://openalex.org/W1986919722","https://openalex.org/W2585516632","https://openalex.org/W2093663313","https://openalex.org/W4296983618","https://openalex.org/W2158390333","https://openalex.org/W40332083","https://openalex.org/W4298846451"],"abstract_inverted_index":{"The":[0,56],"max-bisection":[1,45,98],"and":[2,77],"min-bisection":[3],"problems":[4],"are":[5],"to":[6,109],"find":[7],"a":[8,14,52,86],"partition":[9],"of":[10,13,28,58,70,82],"the":[11,26,37,44,92],"vertices":[12],"graph":[15],"into":[16],"two":[17],"equal":[18],"size":[19],"subsets":[20],"that,":[21],"respectively,":[22],"maximizes":[23],"or":[24],"minimizes":[25],"number":[27],"edges":[29],"with":[30],"endpoints":[31],"in":[32,74],"both":[33],"subsets.":[34],"We":[35],"design":[36,90],"first":[38,93],"polynomial":[39,63,94],"time":[40,64],"approximation":[41],"scheme":[42,96],"for":[43,66,97],"problem":[46],"on":[47,99],"arbitrary":[48],"planar":[49],"graphs":[50,102],"solving":[51],"long-standing":[53],"open":[54],"problem.":[55],"method":[57,88],"solution":[59],"involves":[60],"designing":[61],"exact":[62],"algorithms":[65],"computing":[67],"optimal":[68],"partitions":[69],"bounded":[71],"treewidth":[72],"graphs,":[73],"particular":[75],"max-":[76],"min-bisection,":[78],"which":[79],"could":[80,104],"be":[81,106],"independent":[83],"interest.":[84],"Using":[85],"similar":[87],"we":[89],"also":[91,105],"timeapproximation":[95],"unit":[100],"disk":[101],"(which":[103],"easily":[107],"extended":[108],"other":[110],"geometrically":[111],"defined":[112],"graphs).":[113]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}