{"id":"https://openalex.org/W2949645178","doi":"https://doi.org/10.1007/s00453-019-00609-1","title":"Multi-budgeted Directed Cuts","display_name":"Multi-budgeted Directed Cuts","publication_year":2019,"publication_date":"2019-08-02","ids":{"openalex":"https://openalex.org/W2949645178","doi":"https://doi.org/10.1007/s00453-019-00609-1","mag":"2949645178"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-019-00609-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-019-00609-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-019-00609-1.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-019-00609-1.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050140825","display_name":"Stefan Kratsch","orcid":"https://orcid.org/0000-0002-0193-7239"},"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":false,"raw_author_name":"Stefan Kratsch","raw_affiliation_strings":["Institut f\u00fcr Informatik, Humboldt-Universit\u00e4t zu Berlin, Berlin, Germany","Institut f\u00fcr Informatik, Humboldt Universit\u00e4t zu Berlin, Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Humboldt-Universit\u00e4t zu Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]},{"raw_affiliation_string":"Institut f\u00fcr Informatik, Humboldt Universit\u00e4t zu Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100367940","display_name":"Shaohua Li","orcid":"https://orcid.org/0000-0001-8079-6405"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Shaohua Li","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Warsaw, Poland","Institute of Informatics University of Warsaw, Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"Institute of Informatics University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012849997","display_name":"D\u00e1niel Marx","orcid":"https://orcid.org/0000-0002-5686-8314"},"institutions":[{"id":"https://openalex.org/I4210117195","display_name":"HUN-REN Institute for Computer Science and Control","ror":"https://ror.org/0249v7n71","country_code":"HU","type":"facility","lineage":["https://openalex.org/I4210117195","https://openalex.org/I4387152226"]},{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"government","lineage":["https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"D\u00e1niel Marx","raw_affiliation_strings":["Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary","Institute for Computer Science and Control, Hungarian Academy of Sciences, (MTA SZTAKI), Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary","institution_ids":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]},{"raw_affiliation_string":"Institute for Computer Science and Control, Hungarian Academy of Sciences, (MTA SZTAKI), Budapest, Hungary","institution_ids":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059330513","display_name":"Marcin Pilipczuk","orcid":"https://orcid.org/0000-0001-5680-7397"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Marcin Pilipczuk","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Warsaw, Poland","Institute of Informatics University of Warsaw, Warsaw, Poland"],"raw_orcid":"https://orcid.org/0000-0001-5680-7397","affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"Institute of Informatics University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001475076","display_name":"Magnus Wahlstr\u00f6m","orcid":"https://orcid.org/0000-0002-0933-4504"},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Magnus Wahlstr\u00f6m","raw_affiliation_strings":["Royal Holloway, University of London, Egham, UK","Royal Holloway University of London Egham UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Royal Holloway, University of London, Egham, UK","institution_ids":["https://openalex.org/I184558857"]},{"raw_affiliation_string":"Royal Holloway University of London Egham UK","institution_ids":["https://openalex.org/I184558857"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5059330513"],"corresponding_institution_ids":["https://openalex.org/I4654613"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":{"value":2890,"currency":"USD","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09039837,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"82","issue":"8","first_page":"2135","last_page":"2155"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9959999918937683,"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.9959999918937683,"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.9905999898910522,"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.9790999889373779,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.7660365104675293},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6548309326171875},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5826805233955383},{"id":"https://openalex.org/keywords/skew","display_name":"Skew","score":0.5806511640548706},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4962061047554016},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4787715971469879},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.4542170464992523},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4391123652458191},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36806005239486694},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36624836921691895},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23742708563804626}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7660365104675293},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6548309326171875},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5826805233955383},{"id":"https://openalex.org/C43711488","wikidata":"https://www.wikidata.org/wiki/Q7534783","display_name":"Skew","level":2,"score":0.5806511640548706},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4962061047554016},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4787715971469879},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.4542170464992523},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4391123652458191},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36806005239486694},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36624836921691895},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23742708563804626},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","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":6,"locations":[{"id":"doi:10.1007/s00453-019-00609-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-019-00609-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-019-00609-1.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"mag:2949645178","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1810.06848v1","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:eprints.sztaki.hu:9987","is_oa":false,"landing_page_url":"http://eprints.sztaki.hu/9987/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401907","display_name":"SZTAKI Publication Repository (Hungarian Academy of Sciences)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I7597260","host_organization_name":"Hungarian Academy of Sciences","host_organization_lineage":["https://openalex.org/I7597260"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"doi:10.48550/arxiv.1810.06848","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1810.06848","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.60882/cispa.32780073","is_oa":true,"landing_page_url":"https://doi.org/10.60882/cispa.32780073","pdf_url":null,"source":{"id":"https://openalex.org/S7407050916","display_name":"CISPA Helmholtz Center","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"JournalArticle"},{"id":"doi:10.60882/cispa.32780073.v1","is_oa":true,"landing_page_url":"https://doi.org/10.60882/cispa.32780073.v1","pdf_url":null,"source":{"id":"https://openalex.org/S7407050916","display_name":"CISPA Helmholtz Center","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"JournalArticle"}],"best_oa_location":{"id":"doi:10.1007/s00453-019-00609-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-019-00609-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-019-00609-1.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Partnerships for the goals","score":0.41999998688697815,"id":"https://metadata.un.org/sdg/17"}],"awards":[{"id":"https://openalex.org/G1435867755","display_name":null,"funder_award_id":"EP/P007228/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G1811664709","display_name":"Systematic mapping of the complexity landscape of hard algorithmic graph problems","funder_award_id":"725978","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"},{"id":"https://openalex.org/G2710479047","display_name":"Cuts and decompositions: algorithms and combinatorial properties","funder_award_id":"714704","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"},{"id":"https://openalex.org/G3592075253","display_name":"Parameterized complexity and the search for tight complexity results","funder_award_id":"280152","funder_id":"https://openalex.org/F4320338352","funder_display_name":"FP7 Ideas: European Research Council"},{"id":"https://openalex.org/G434337789","display_name":null,"funder_award_id":"HORIZON2020","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5244030528","display_name":null,"funder_award_id":"714704","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8527260811","display_name":"Polytope methods in parameterized complexity","funder_award_id":"EP/P007228/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"},{"id":"https://openalex.org/F4320338352","display_name":"FP7 Ideas: European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2949645178.pdf","grobid_xml":"https://content.openalex.org/works/W2949645178.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W33845589","https://openalex.org/W1485150579","https://openalex.org/W1836455089","https://openalex.org/W1978447499","https://openalex.org/W1981591809","https://openalex.org/W1991579759","https://openalex.org/W2000311286","https://openalex.org/W2009924457","https://openalex.org/W2010004564","https://openalex.org/W2016590962","https://openalex.org/W2025304499","https://openalex.org/W2037479769","https://openalex.org/W2044343300","https://openalex.org/W2070745908","https://openalex.org/W2112306992","https://openalex.org/W2119741712","https://openalex.org/W2121641644","https://openalex.org/W2167236203","https://openalex.org/W2397439386","https://openalex.org/W2471129545","https://openalex.org/W2520406079","https://openalex.org/W2568986002","https://openalex.org/W2569542361","https://openalex.org/W2570081448","https://openalex.org/W2605514664","https://openalex.org/W2914414140","https://openalex.org/W2952219297","https://openalex.org/W2963267967","https://openalex.org/W2963780386","https://openalex.org/W3121576764"],"related_works":["https://openalex.org/W2896371654","https://openalex.org/W2401623444","https://openalex.org/W422101585","https://openalex.org/W2952587811","https://openalex.org/W2575324380","https://openalex.org/W2040155008","https://openalex.org/W2966167848","https://openalex.org/W2559964378","https://openalex.org/W3163471737","https://openalex.org/W3094505531","https://openalex.org/W1598087195","https://openalex.org/W2010930947","https://openalex.org/W1893425122","https://openalex.org/W2951329411","https://openalex.org/W2999430269","https://openalex.org/W3186633191","https://openalex.org/W3097074791","https://openalex.org/W2618212447","https://openalex.org/W106040466","https://openalex.org/W2963962070"],"abstract_inverted_index":{"In":[0,33],"this":[1,162,225],"paper,":[2],"we":[3,36,164,223,263],"study":[4],"multi-budgeted":[5,81,135,171,243,268],"variants":[6,269,272],"of":[7,71,73,83,179,193,201,219,239,266,273,301],"the":[8,69,80,93,129,134,170,177,180,191,199,206,228,237,253,267,274,279],"classic":[9,130],"minimum":[10,131,172],"cut":[11,132,173,276],"problem":[12,87,174],"and":[13,28,45,196,231,256,278],"graph":[14,85],"separation":[15,86,95],"problems":[16,277,296],"that":[17,116,175,208,294],"turned":[18],"out":[19,138],"to":[20,42,91,114,128,139,214,248,252],"be":[21,68,98,140],"important":[22,217,242,310],"in":[23],"parameterized":[24,152,286],"complexity:":[25],"Skew":[26,254],"Multicut":[27,255],"Directed":[29,257],"Feedback":[30,258],"Arc":[31,259],"Set.":[32],"our":[34,250],"generalization,":[35],"assign":[37],"colors":[38,53],"$$1,2,\\ldots":[39,54],",\\ell":[40,55,63,124],"$$":[41,56,282],"some":[43,194],"edges":[44,72,195],"give":[46],"separate":[47],"budgets":[48],"$$k_{1},k_{2},\\ldots":[49],",k_{\\ell":[50],"}$$":[51,156],"for":[52,79,120,143,157,169],".":[57,126,147],"For":[58],"every":[59,121],"color":[60,74],"$$i\\in":[61,122],"\\{1,\\ldots":[62,123],"\\}$$":[64,125],",":[65],"let":[66],"$$E_{i}$$":[67],"set":[70],"i.":[75],"The":[76],"solution":[77],"C":[78],"variant":[82,136],"a":[84,99,101,105,166,209,220,298,306],"not":[88,182],"only":[89],"needs":[90,113],"satisfy":[92,115],"usual":[94],"requirements":[96],"(i.e.,":[97],"cut,":[100],"skew":[102],"multicut,":[103],"or":[104],"directed":[106,275],"feedback":[107],"arc":[108],"set,":[109],"respectively),":[110],"but":[111,189],"also":[112],"$$|C\\cap":[117],"E_{i}|\\le":[118],"k_{i}$$":[119],"Contrary":[127],"problem,":[133,284],"turns":[137],"NP-hard":[141],"even":[142],"$$\\ell":[144,281],"=":[145],"2$$":[146],"We":[148,292],"propose":[149],"FPT":[150,234],"algorithms":[151],"by":[153,183,188],"$$k=k_{1}+\\cdots":[154],"+k_{\\ell":[155],"all":[158,216],"three":[159],"problems.":[160,261],"To":[161],"end,":[163],"develop":[165],"branching":[167,230],"procedure":[168],"measures":[176],"progress":[178],"algorithm":[181,251],"reducing":[184],"k":[185],"as":[186,309],"usual,":[187],"elevating":[190],"capacity":[192],"thus":[197],"increasing":[198],"size":[200],"maximum":[202],"source-to-sink":[203],"flow.":[204],"Using":[205],"fact":[207],"similar":[210,307],"strategy":[211],"is":[212],"used":[213],"enumerate":[215],"separators":[218,311],"given":[221],"size,":[222],"merge":[224],"process":[226],"with":[227,270],"flow-guided":[229],"show":[232,264,293],"an":[233,289],"bound":[235],"on":[236],"number":[238,300],"(appropriately":[240],"defined)":[241],"separators.":[244],"This":[245],"allows":[246],"us":[247],"extend":[249],"Set":[260],"Furthermore,":[262],"connections":[265],"weighted":[271],"Chain":[280],"-SAT":[283],"whose":[285],"complexity":[287],"remains":[288],"open":[290],"problem.":[291],"these":[295],"admit":[297],"bounded-in-parameter":[299],"\u201cmaximally":[302],"pushed\u201d":[303],"solutions":[304],"(in":[305],"spirit":[308],"are":[312],"maximally":[313],"pushed),":[314],"giving":[315],"somewhat":[316],"weak":[317],"evidence":[318],"towards":[319],"their":[320],"tractability.":[321]},"counts_by_year":[],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2019-06-27T00:00:00"}