{"id":"https://openalex.org/W7167039948","doi":"https://doi.org/10.4230/lipics.wg.2026.30","title":"Preventing Small Global Cuts by Protecting Edges","display_name":"Preventing Small Global Cuts by Protecting Edges","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7167039948","doi":"https://doi.org/10.4230/lipics.wg.2026.30"},"language":"en","primary_location":{"id":"doi:10.4230/lipics.wg.2026.30","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.wg.2026.30","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"type":"conference-paper","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.4230/lipics.wg.2026.30","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087168202","display_name":"Christian Komusiewicz","orcid":"https://orcid.org/0000-0003-0829-7032"},"institutions":[{"id":"https://openalex.org/I76198965","display_name":"Friedrich Schiller University Jena","ror":"https://ror.org/05qpz1x62","country_code":"DE","type":"education","lineage":["https://openalex.org/I76198965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Komusiewicz, Christian","raw_affiliation_strings":["Institute of Computer Science, Friedrich Schiller University Jena, Germany"],"raw_orcid":"https://orcid.org/0000-0003-0829-7032","affiliations":[{"raw_affiliation_string":"Institute of Computer Science, Friedrich Schiller University Jena, Germany","institution_ids":["https://openalex.org/I76198965"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139935826","display_name":"Zhenwei Liu","orcid":"https://orcid.org/0009-0002-4169-1349"},"institutions":[{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Liu, Zhenwei","raw_affiliation_strings":["Zhejiang University, Hangzhou, China"],"raw_orcid":"https://orcid.org/0009-0002-4169-1349","affiliations":[{"raw_affiliation_string":"Zhejiang University, Hangzhou, China","institution_ids":["https://openalex.org/I76130692"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045950235","display_name":"Nils Morawietz","orcid":"https://orcid.org/0000-0002-7283-4982"},"institutions":[{"id":"https://openalex.org/I76198965","display_name":"Friedrich Schiller University Jena","ror":"https://ror.org/05qpz1x62","country_code":"DE","type":"education","lineage":["https://openalex.org/I76198965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Morawietz, Nils","raw_affiliation_strings":["Institute of Computer Science, Friedrich Schiller University Jena, Germany"],"raw_orcid":"https://orcid.org/0000-0002-7283-4982","affiliations":[{"raw_affiliation_string":"Institute of Computer Science, Friedrich Schiller University Jena, Germany","institution_ids":["https://openalex.org/I76198965"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027185367","display_name":"Frank Sommer","orcid":"https://orcid.org/0000-0003-4034-525X"},"institutions":[{"id":"https://openalex.org/I76198965","display_name":"Friedrich Schiller University Jena","ror":"https://ror.org/05qpz1x62","country_code":"DE","type":"education","lineage":["https://openalex.org/I76198965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sommer, Frank","raw_affiliation_strings":["Institute of Computer Science, Friedrich Schiller University Jena, Germany"],"raw_orcid":"https://orcid.org/0000-0003-4034-525X","affiliations":[{"raw_affiliation_string":"Institute of Computer Science, Friedrich Schiller University Jena, Germany","institution_ids":["https://openalex.org/I76198965"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.7160000205039978},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6812000274658203},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.623199999332428},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.6147000193595886},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5612000226974487},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5551999807357788},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5051000118255615},{"id":"https://openalex.org/keywords/cut","display_name":"Cut","score":0.44679999351501465},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4377000033855438}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7160000205039978},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6812000274658203},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.623199999332428},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.6147000193595886},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5705999732017517},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5612000226974487},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5551999807357788},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5051000118255615},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4643000066280365},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.44679999351501465},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4377000033855438},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.4300000071525574},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.414000004529953},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4081999957561493},{"id":"https://openalex.org/C134466208","wikidata":"https://www.wikidata.org/wiki/Q1520657","display_name":"Weight function","level":2,"score":0.3752000033855438},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.37130001187324524},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.3709999918937683},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3492000102996826},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.3490000069141388},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3393999934196472},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.320499986410141},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.30970001220703125},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.30799999833106995},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3043999969959259},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2994000017642975},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2964000105857849},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.295199990272522},{"id":"https://openalex.org/C17758045","wikidata":"https://www.wikidata.org/wiki/Q2642629","display_name":"Multigraph","level":3,"score":0.27799999713897705},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.26600000262260437},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.2567000091075897},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2554999887943268}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4230/lipics.wg.2026.30","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.wg.2026.30","pdf_url":null,"source":null,"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":"ConferencePaper"}],"best_oa_location":{"id":"doi:10.4230/lipics.wg.2026.30","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.wg.2026.30","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,53],"minimum":[1,86,102],"cut":[2,87,103],"problem":[3,54,88,220,256,284],"is":[4,120,237,257],"one":[5],"of":[6,38,46,49,59,69,84,100,104,122,136,147,159,163,181,190,196,206,211,294],"the":[7,44,47,57,66,70,85,98,101,105,110,123,128,157,160,170,176,182,184,191,204,207,212,219,240,245,255,260,271,275,283],"oldest":[8],"and":[9,28,73,127,179,188,194,209,229,250,274],"most":[10,140,171],"fundamental":[11],"optimization":[12],"problems":[13],"in":[14,252,280],"operations":[15],"research.":[16],"In":[17],"this":[18],"problem,":[19],"we":[20,168],"are":[21,248,278],"given":[22],"a":[23,81,90,180,215,291],"connected":[24],"edge-weighted":[25],"graph":[26],"(G,\u03c9)":[27],"have":[29],"to":[30,64,93,96,131],"find":[31],"an":[32,60,113,133,267],"edge":[33,115,134,224],"set":[34,135],"A":[35,50],"(called":[36],"edge-cut)":[37],"smallest":[39],"total":[40,137],"weight":[41,99,125,151,277],"such":[42,142,174],"that":[43,62,119,143,203],"removal":[45],"edges":[48,95,149,213],"disconnects":[51],"G.":[52],"thus":[55],"takes":[56],"view":[58],"attacker":[61,124,231,246,276],"wants":[63],"destroy":[65],"global":[67],"connectivity":[68],"network.":[71],"Bienstock":[72],"Diaz":[74],"[SICOMP":[75],"'93]":[76],"introduced":[77],"Global":[78,164,234],"Cut":[79,165,235],"Prevention,":[80],"two-player":[82],"version":[83],"where":[89],"defender":[91,129,227,272],"aims":[92,130],"protect":[94,132],"increase":[97],"resulting":[106],"graph.":[107],"More":[108],"precisely,":[109],"input":[111,192],"contains":[112],"additional":[114],"cost":[116,138,228,273],"function":[117],"c":[118],"independent":[121],"\u03c9":[126],"at":[139,152],"d":[141,178],"every":[144],"edge-cut":[145],"consisting":[146],"unprotected":[148],"has":[150,214,225],"least":[153],"a+1.":[154],"We":[155,199],"initiate":[156],"study":[158],"parameterized":[161],"complexity":[162],"Prevention.":[166],"Here,":[167],"consider":[169],"natural":[172],"parameters":[173],"as":[175],"budgets":[177],"players,":[183],"vertex":[185,241,261,292],"cover":[186,242,262,293],"number":[187,263],"treewidth":[189],"graph,":[193],"combinations":[195],"these":[197],"parameters.":[198],"show,":[200],"for":[201,239,259],"example,":[202],"encoding":[205],"costs":[208],"weights":[210,247],"considerable":[216],"influence":[217],"on":[218,288],"complexity:":[221],"If":[222,244],"each":[223],"unit":[226,230],"weight,":[232],"then":[233,254,282],"Prevention":[236],"FPT":[238],"number.":[243],"arbitrary":[249],"encoded":[251,279],"unary,":[253],"W[1]-hard":[258],"but":[264],"still":[265],"admits":[266],"XP-algorithm.":[268],"Finally,":[269],"if":[270],"binary,":[281],"becomes":[285],"NP-hard":[286],"even":[287],"graphs":[289],"with":[290],"size":[295],"2.":[296]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-03T00:00:00"}