{"id":"https://openalex.org/W2071588464","doi":"https://doi.org/10.1007/978-3-642-15369-3_10","title":"Approximating Sparsest Cut in Graphs of Bounded Treewidth","display_name":"Approximating Sparsest Cut in Graphs of Bounded Treewidth","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2071588464","doi":"https://doi.org/10.1007/978-3-642-15369-3_10","mag":"2071588464"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-15369-3_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-15369-3_10","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/A5043851880","display_name":"Eden Chlamt\u00e1\u010d","orcid":"https://orcid.org/0000-0002-0296-0107"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Eden Chlamtac","raw_affiliation_strings":["Weizmann Institute of Science, Rehovot, Israel"],"affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037378898","display_name":"Robert Krauthgamer","orcid":"https://orcid.org/0009-0003-8154-3735"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Robert Krauthgamer","raw_affiliation_strings":["Weizmann Institute of Science, Rehovot, Israel"],"affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101701586","display_name":"Prasad Raghavendra","orcid":"https://orcid.org/0009-0009-7851-0653"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4400600948","display_name":"Microsoft Research New England (United States)","ror":"https://ror.org/010wkqn50","country_code":null,"type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4400600948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Prasad Raghavendra","raw_affiliation_strings":["Microsoft Research New England, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research New England, Cambridge, MA, USA","institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4400600948"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5043851880"],"corresponding_institution_ids":["https://openalex.org/I53964585"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.5636,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.89901639,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"124","last_page":"137"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10720","display_name":"Complexity and Algorithms in Graphs","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/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/T12288","display_name":"Optimization and Search Problems","score":0.9962000250816345,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.9588944315910339},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7901960611343384},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.6267436742782593},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6244382262229919},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5194494128227234},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.49360835552215576},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4480474889278412},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.423379123210907},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3993723392486572},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39916419982910156},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.39683011174201965},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.3418304920196533},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.242029070854187},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.21506452560424805},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07287144660949707}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.9588944315910339},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7901960611343384},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.6267436742782593},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6244382262229919},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5194494128227234},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.49360835552215576},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4480474889278412},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.423379123210907},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3993723392486572},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39916419982910156},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.39683011174201965},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3418304920196533},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.242029070854187},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.21506452560424805},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07287144660949707},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"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.1007/978-3-642-15369-3_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-15369-3_10","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:CiteSeerX.psu:10.1.1.750.1850","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.750.1850","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1006.3970.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W48861618","https://openalex.org/W1526777878","https://openalex.org/W1560551754","https://openalex.org/W1571037334","https://openalex.org/W1587123489","https://openalex.org/W1593162480","https://openalex.org/W1870858037","https://openalex.org/W1967821609","https://openalex.org/W2002025272","https://openalex.org/W2005059149","https://openalex.org/W2015577846","https://openalex.org/W2032684479","https://openalex.org/W2036322374","https://openalex.org/W2042899161","https://openalex.org/W2048256994","https://openalex.org/W2049143039","https://openalex.org/W2065139435","https://openalex.org/W2077397558","https://openalex.org/W2083858754","https://openalex.org/W2088844265","https://openalex.org/W2091399525","https://openalex.org/W2093171982","https://openalex.org/W2098492709","https://openalex.org/W2099022556","https://openalex.org/W2106264302","https://openalex.org/W2107052785","https://openalex.org/W2107881198","https://openalex.org/W2116926584","https://openalex.org/W2120358419","https://openalex.org/W2138322123","https://openalex.org/W2147668104","https://openalex.org/W2148012376","https://openalex.org/W2148872782","https://openalex.org/W2150148016","https://openalex.org/W2151395725","https://openalex.org/W2154014787","https://openalex.org/W2154876245","https://openalex.org/W2156792066","https://openalex.org/W2161719898","https://openalex.org/W2162898372","https://openalex.org/W2168669141","https://openalex.org/W2176446742","https://openalex.org/W2506642202","https://openalex.org/W2611804663","https://openalex.org/W2619061098","https://openalex.org/W2952158803","https://openalex.org/W3137884736","https://openalex.org/W4230561893","https://openalex.org/W4250613930"],"related_works":["https://openalex.org/W239742334","https://openalex.org/W2088441646","https://openalex.org/W1511821218","https://openalex.org/W2889180046","https://openalex.org/W2012687409","https://openalex.org/W1480846237","https://openalex.org/W1544821268","https://openalex.org/W1548014395","https://openalex.org/W3037533092","https://openalex.org/W1726008105"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}