{"id":"https://openalex.org/W1675722546","doi":"https://doi.org/10.1007/978-3-642-19222-7_14","title":"The Complexity Status of Problems Related to Sparsest Cuts","display_name":"The Complexity Status of Problems Related to Sparsest Cuts","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W1675722546","doi":"https://doi.org/10.1007/978-3-642-19222-7_14","mag":"1675722546"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-19222-7_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-19222-7_14","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/A5079322669","display_name":"Paul Bonsma","orcid":null},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Paul Bonsma","raw_affiliation_strings":["Computer Science Department, Humboldt Universit\u00e4t zu Berlin, Unter den Linden 6, 10099, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Humboldt Universit\u00e4t zu Berlin, Unter den Linden 6, 10099, Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068613759","display_name":"Hajo Broersma","orcid":"https://orcid.org/0000-0002-4678-3210"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hajo Broersma","raw_affiliation_strings":["School of Engineering and Computing Sciences, Science Laboratories, Durham University, South Road, Durham, DH1 3LE, U.K"],"affiliations":[{"raw_affiliation_string":"School of Engineering and Computing Sciences, Science Laboratories, Durham University, South Road, Durham, DH1 3LE, U.K","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031655569","display_name":"Viresh Patel","orcid":"https://orcid.org/0000-0001-8047-350X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Viresh Patel","raw_affiliation_strings":["School of Engineering and Computing Sciences, Science Laboratories, Durham University, South Road, Durham, DH1 3LE, U.K"],"affiliations":[{"raw_affiliation_string":"School of Engineering and Computing Sciences, Science Laboratories, Durham University, South Road, Durham, DH1 3LE, U.K","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089643426","display_name":"A. V. Pyatkin","orcid":"https://orcid.org/0000-0001-5355-411X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Artem Pyatkin","raw_affiliation_strings":["School of Engineering and Computing Sciences, Science Laboratories, Durham University, South Road, Durham, DH1 3LE, U.K"],"affiliations":[{"raw_affiliation_string":"School of Engineering and Computing Sciences, Science Laboratories, Durham University, South Road, Durham, DH1 3LE, U.K","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5079322669"],"corresponding_institution_ids":["https://openalex.org/I39343248"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.1674,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.78823529,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"125","last_page":"135"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7726696729660034},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6759355068206787},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.6352124810218811},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.6061128377914429},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5735517740249634},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5238960981369019},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.505085289478302},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.4536357522010803},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4312269687652588},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4166211783885956},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3409961462020874},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33907705545425415},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.17352226376533508},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07352516055107117}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7726696729660034},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6759355068206787},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6352124810218811},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.6061128377914429},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5735517740249634},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5238960981369019},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.505085289478302},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.4536357522010803},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4312269687652588},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4166211783885956},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3409961462020874},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33907705545425415},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.17352226376533508},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07352516055107117},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-642-19222-7_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-19222-7_14","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:ris.utwente.nl:openaire_cris_publications/15f97c0b-3a45-4b63-9bab-509f4d1a7bc0","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/15f97c0b-3a45-4b63-9bab-509f4d1a7bc0","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","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":"Bonsma, P S, Broersma, H J, Patel, V & Pyatkin, A 2011, The complexity status of problems related to sparsest cuts. in C S Iliopoulos & W F Smyth (eds), Proceedings of the 21st International Workshop on Combinatorial Algorithms, IWOCA 2010. Lecture Notes in Computer Science, vol. 6460, Springer, Berlin, Heidelberg, pp. 125-135, 21st International Workshop on Combinatorial Algorithms, IWOCA 2010, London, United Kingdom, 26/07/10. https://doi.org/10.1007/978-3-642-19222-7_14","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:ris.utwente.nl:publications/15f97c0b-3a45-4b63-9bab-509f4d1a7bc0","is_oa":false,"landing_page_url":"http://eprints.eemcs.utwente.nl/secure2/21344/01/fulltext-15.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/13","display_name":"Climate action","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W49490112","https://openalex.org/W1517365704","https://openalex.org/W1527664624","https://openalex.org/W1537449969","https://openalex.org/W1538293711","https://openalex.org/W1974785036","https://openalex.org/W1989720410","https://openalex.org/W2004791924","https://openalex.org/W2011039300","https://openalex.org/W2020632401","https://openalex.org/W2030087828","https://openalex.org/W2033961184","https://openalex.org/W2059372025","https://openalex.org/W2086959852","https://openalex.org/W2103444054","https://openalex.org/W2132750992","https://openalex.org/W2139531571","https://openalex.org/W2140566134","https://openalex.org/W2150148016","https://openalex.org/W2476096155","https://openalex.org/W2498316819","https://openalex.org/W2798579874","https://openalex.org/W4253120438","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4235911878","https://openalex.org/W4308732512","https://openalex.org/W4281684493","https://openalex.org/W2115772827","https://openalex.org/W115807216","https://openalex.org/W2184232537","https://openalex.org/W4200547882","https://openalex.org/W2088200711","https://openalex.org/W2005944337","https://openalex.org/W2062731608"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}