{"id":"https://openalex.org/W2257535006","doi":"https://doi.org/10.1007/978-3-319-28684-6_4","title":"An FPT 2-Approximation for Tree-cut Decomposition","display_name":"An FPT 2-Approximation for Tree-cut Decomposition","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2257535006","doi":"https://doi.org/10.1007/978-3-319-28684-6_4","mag":"2257535006"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-28684-6_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-28684-6_4","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/A5110747602","display_name":"Eun-Jung Kim","orcid":"https://orcid.org/0009-0005-7773-8198"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Eunjung Kim","raw_affiliation_strings":["CNRS, LAMSADE, Paris, France"],"affiliations":[{"raw_affiliation_string":"CNRS, LAMSADE, Paris, France","institution_ids":["https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082994085","display_name":"Sang\u2010il Oum","orcid":"https://orcid.org/0000-0002-6889-7286"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]},{"id":"https://openalex.org/I4210158432","display_name":"National Institute for Mathematical Sciences","ror":"https://ror.org/04n7py080","country_code":"KR","type":"education","lineage":["https://openalex.org/I4210158432"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Sang-il Oum","raw_affiliation_strings":["Department of Mathematical Sciences, KAIST, Daejeon, South Korea"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, KAIST, Daejeon, South Korea","institution_ids":["https://openalex.org/I4210158432","https://openalex.org/I157485424"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028652077","display_name":"Christophe Paul","orcid":"https://orcid.org/0000-0001-6519-975X"},"institutions":[{"id":"https://openalex.org/I4210101743","display_name":"Laboratoire d'Informatique, de Robotique et de Micro\u00e9lectronique de Montpellier","ror":"https://ror.org/013yean28","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I151295451","https://openalex.org/I19894307","https://openalex.org/I4210101743","https://openalex.org/I4210159245","https://openalex.org/I4412460525"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I19894307","display_name":"Universit\u00e9 de Montpellier","ror":"https://ror.org/051escj72","country_code":"FR","type":"education","lineage":["https://openalex.org/I19894307"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Christophe Paul","raw_affiliation_strings":["CNRS, Universit\u00e9 de Montpellier, LIRMM, Montpellier, France"],"affiliations":[{"raw_affiliation_string":"CNRS, Universit\u00e9 de Montpellier, LIRMM, Montpellier, France","institution_ids":["https://openalex.org/I19894307","https://openalex.org/I4210101743","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025941213","display_name":"Ignasi Sau","orcid":"https://orcid.org/0000-0002-8981-9287"},"institutions":[{"id":"https://openalex.org/I19894307","display_name":"Universit\u00e9 de Montpellier","ror":"https://ror.org/051escj72","country_code":"FR","type":"education","lineage":["https://openalex.org/I19894307"]},{"id":"https://openalex.org/I4210101743","display_name":"Laboratoire d'Informatique, de Robotique et de Micro\u00e9lectronique de Montpellier","ror":"https://ror.org/013yean28","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I151295451","https://openalex.org/I19894307","https://openalex.org/I4210101743","https://openalex.org/I4210159245","https://openalex.org/I4412460525"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Ignasi Sau","raw_affiliation_strings":["CNRS, Universit\u00e9 de Montpellier, LIRMM, Montpellier, France"],"affiliations":[{"raw_affiliation_string":"CNRS, Universit\u00e9 de Montpellier, LIRMM, Montpellier, France","institution_ids":["https://openalex.org/I19894307","https://openalex.org/I4210101743","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085447779","display_name":"Dimitrios M. Thilikos","orcid":null},"institutions":[{"id":"https://openalex.org/I200777214","display_name":"National and Kapodistrian University of Athens","ror":"https://ror.org/04gnjpq42","country_code":"GR","type":"education","lineage":["https://openalex.org/I200777214"]},{"id":"https://openalex.org/I4210101743","display_name":"Laboratoire d'Informatique, de Robotique et de Micro\u00e9lectronique de Montpellier","ror":"https://ror.org/013yean28","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I151295451","https://openalex.org/I19894307","https://openalex.org/I4210101743","https://openalex.org/I4210159245","https://openalex.org/I4412460525"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I19894307","display_name":"Universit\u00e9 de Montpellier","ror":"https://ror.org/051escj72","country_code":"FR","type":"education","lineage":["https://openalex.org/I19894307"]},{"id":"https://openalex.org/I120729142","display_name":"Research Academic Computer Technology Institute","ror":"https://ror.org/021nszj63","country_code":"GR","type":"facility","lineage":["https://openalex.org/I120729142","https://openalex.org/I4210154149"]}],"countries":["FR","GR"],"is_corresponding":true,"raw_author_name":"Dimitrios M. Thilikos","raw_affiliation_strings":["CNRS, Universit\u00e9 de Montpellier, LIRMM, Montpellier, France","Computer Technology Institute Press \u201cDiophantus\u201d, Patras, Greece","Department of Mathematics, University of Athens, Athens, Greece"],"affiliations":[{"raw_affiliation_string":"CNRS, Universit\u00e9 de Montpellier, LIRMM, Montpellier, France","institution_ids":["https://openalex.org/I19894307","https://openalex.org/I4210101743","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"Computer Technology Institute Press \u201cDiophantus\u201d, Patras, Greece","institution_ids":["https://openalex.org/I120729142"]},{"raw_affiliation_string":"Department of Mathematics, University of Athens, Athens, Greece","institution_ids":["https://openalex.org/I200777214"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5085447779"],"corresponding_institution_ids":["https://openalex.org/I120729142","https://openalex.org/I1294671590","https://openalex.org/I19894307","https://openalex.org/I200777214","https://openalex.org/I4210101743"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.8419,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.85150709,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"35","last_page":"46"},"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.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"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9930999875068665,"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/treewidth","display_name":"Treewidth","score":0.7911491394042969},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.7752853035926819},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6656689047813416},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.57973313331604},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5578302145004272},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5533716678619385},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.5382677316665649},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4855956435203552},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.4841480851173401},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.46881532669067383},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.46381160616874695},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4563565254211426},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44704511761665344},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4191347360610962},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4182650148868561},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40618208050727844},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3880043923854828},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.3330859839916229},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.29708462953567505},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.25512176752090454},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.22658401727676392},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.14893481135368347},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12598058581352234}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.7911491394042969},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.7752853035926819},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6656689047813416},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.57973313331604},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5578302145004272},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5533716678619385},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.5382677316665649},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4855956435203552},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.4841480851173401},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.46881532669067383},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.46381160616874695},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4563565254211426},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44704511761665344},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4191347360610962},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4182650148868561},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40618208050727844},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3880043923854828},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.3330859839916229},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29708462953567505},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.25512176752090454},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.22658401727676392},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.14893481135368347},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12598058581352234},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/978-3-319-28684-6_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-28684-6_4","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:HAL:lirmm-01225569v1","is_oa":false,"landing_page_url":"https://hal-lirmm.ccsd.cnrs.fr/lirmm-01225569","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"[Research Report] LIRMM. 2015","raw_type":"Reports"},{"id":"pmh:oai:HAL:lirmm-01264015v1","is_oa":false,"landing_page_url":"https://hal-lirmm.ccsd.cnrs.fr/lirmm-01264015","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"WAOA 2015 - 13th International Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.35-46, ⟨10.1007/978-3-319-28684-6_4⟩","raw_type":"Conference papers"},{"id":"pmh:oai:basepub.dauphine.fr:123456789/21013","is_oa":false,"landing_page_url":"https://basepub.dauphine.fr/handle/123456789/21013","pdf_url":null,"source":{"id":"https://openalex.org/S4306401007","display_name":"Base Institutionnelle de Recherche de l'universit\u00e9 Paris-Dauphine (BIRD) (University Paris-Dauphine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102197404","host_organization_name":"Universit\u00e9 Paris-Sud","host_organization_lineage":["https://openalex.org/I102197404"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Communication / Conf\u00e9rence"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1500603002","https://openalex.org/W1559054453","https://openalex.org/W1864385456","https://openalex.org/W1965012931","https://openalex.org/W1995561296","https://openalex.org/W2002722727","https://openalex.org/W2011039300","https://openalex.org/W2011911122","https://openalex.org/W2019137761","https://openalex.org/W2028357390","https://openalex.org/W2050719228","https://openalex.org/W2057826895","https://openalex.org/W2059372025","https://openalex.org/W2063554572","https://openalex.org/W2065528988","https://openalex.org/W2074101363","https://openalex.org/W2083103669","https://openalex.org/W2114769758","https://openalex.org/W2125058377","https://openalex.org/W2403583756","https://openalex.org/W4213368513","https://openalex.org/W6601721242"],"related_works":["https://openalex.org/W1485639265","https://openalex.org/W2995115154","https://openalex.org/W2611872667","https://openalex.org/W943012151","https://openalex.org/W2126464568","https://openalex.org/W2012939398","https://openalex.org/W2112686605","https://openalex.org/W1860059046","https://openalex.org/W3213813222","https://openalex.org/W2391304179"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}