{"id":"https://openalex.org/W7109990997","doi":"https://doi.org/10.4230/lipics.icalp.2025.12","title":"All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs","display_name":"All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7109990997","doi":"https://doi.org/10.4230/lipics.icalp.2025.12"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23389","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.12","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.12/LIPIcs.ICALP.2025.12.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"conference-paper","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.12/LIPIcs.ICALP.2025.12.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Anand, Aditya","orcid":null},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anand, Aditya","raw_affiliation_strings":["University of Michigan Ann Arbor, MI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Lee, Euiwoong","orcid":null},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lee, Euiwoong","raw_affiliation_strings":["University of Michigan Ann Arbor, MI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Li, Jason","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Li, Jason","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":null,"display_name":"Saranurak, Thatchaphol","orcid":null},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Saranurak, Thatchaphol","raw_affiliation_strings":["University of Michigan Ann Arbor, MI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.3301999866962433,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.3301999866962433,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.2070000022649765,"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.19089999794960022,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6866999864578247},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6668000221252441},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.6644999980926514},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5443999767303467},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5002999901771545},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46369999647140503},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4296000003814697},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.38609999418258667}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7501999735832214},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6866999864578247},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6668000221252441},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.6644999980926514},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6299999952316284},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5443999767303467},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.532800018787384},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5002999901771545},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46369999647140503},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4296000003814697},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.38609999418258667},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3813000023365021},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.3758000135421753},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.36719998717308044},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3612000048160553},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.35499998927116394},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3303999900817871},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.3174999952316284},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.27399998903274536},{"id":"https://openalex.org/C97399411","wikidata":"https://www.wikidata.org/wiki/Q825367","display_name":"Coin flipping","level":2,"score":0.26809999346733093},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.26350000500679016},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2581000030040741},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2563000023365021},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25279998779296875},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.25029999017715454}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:23389","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.12","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.12/LIPIcs.ICALP.2025.12.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23389","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.12","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.12/LIPIcs.ICALP.2025.12.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2213600020","display_name":"CAREER: Theory for Dynamic Graph Algorithms","funder_award_id":"2238138","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7385471316","display_name":"CAREER: Towards Optimal Approximabilities for Clustering","funder_award_id":"2236669","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W7109990997.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Given":[0],"a":[1,11,87,133,202,254,284],"directed":[2,142,159,178,212,262],"graph":[3],"G":[4],"with":[5],"n":[6],"vertices":[7],"and":[8,14,49,76,106,118,138,152,154,227,238,291,308],"m":[9],"edges,":[10],"parameter":[12],"k":[13,43],"two":[15,102],"disjoint":[16],"subsets":[17],"S,T":[18],"\u2286":[19,47,51],"V(G),":[20],"we":[21,125,167,200,252,265],"show":[22,201],"that":[23,77,94],"the":[24,32,90,95,127,145,169,183,186,219,229,278,304,309,313,326],"number":[25,33,96,305],"of":[26,34,39,89,97,147,185,224,257,271,277,286,306,315,318,325],"all-subsets":[27,249],"important":[28,36,99,250,316],"separators,":[29,251],"which":[30],"is":[31,53,86,108,303],"A-B":[35,98],"vertex":[37,258],"separators":[38,100,176,210,317],"size":[40,184,272,287,319],"at":[41,54,109,320],"most":[42,55,110,321],"over":[44],"all":[45],"A":[46,105],"S":[48],"B":[50,107],"T,":[52],"\u03b2(|S|,":[56],"|T|,":[57],"k)":[58,63],"=":[59,71,73],"4^k":[60,111],"binom(|S|,":[61],"\u2264":[62,65,69,289,296],"binom(|T|,":[64],"2k),":[66],"where":[67,301],"binom(x,":[68],"c)":[70],"\u2211_{i":[72],"1}^c":[74],"binom(x,i),":[75],"they":[78],"can":[79],"be":[80],"enumerated":[81],"in":[82,141,177,191,211,214,232,261,268,293],"time":[83,192,294],"\ud835\udcaa(\u03b2(|S|,|T|,k)k\u00b2(m+n)).":[84],"This":[85,217],"generalization":[88],"folklore":[91],"result":[92],"stating":[93],"for":[101,135,173,207,247],"fixed":[103],"sets":[104,137,140],"(first":[112],"implicitly":[113],"shown":[114],"by":[115,181,235],"Chen,":[116],"Liu":[117],"Lu":[119],"Algorithmica":[120],"'09).":[121],"From":[122],"this":[123],"result,":[124],"obtain":[126],"following":[128],"applications:":[129],"1)":[130],"We":[131],"give":[132,168,253],"construction":[134,256],"detection":[136],"sample":[139,165],"graphs,":[143],"generalizing":[144],"results":[146],"Kleinberg":[148],"(Internet":[149],"Mathematics'":[150],"03)":[151],"Feige":[153],"Mahdian":[155],"(STOC'":[156],"06)":[157],"to":[158],"graphs.":[160],"2)":[161],"Via":[162],"our":[163,245],"new":[164],"sets,":[166],"first":[170],"FPT":[171],"algorithm":[172,189,206,246,282],"finding":[174,208],"balanced":[175,209],"graphs":[179,213,234,263],"parameterized":[180],"k,":[182],"separator.":[187],"Our":[188,281],"runs":[190,292],"2^{\ud835\udcaa(k)}":[193],"\u22c5":[194],"(m":[195],"+":[196,299],"n).":[197],"3)":[198],"Additionally,":[199],"\ud835\udcaa(\u221a{log":[203,225],"k})":[204],"approximation":[205,222],"polynomial":[215],"time.":[216],"improves":[218],"best":[220],"known":[221,230],"guarantee":[223,231],"n})":[226],"matches":[228],"undirected":[233],"Feige,":[236],"Hajiaghayi":[237],"Lee":[239],"(SICOMP'":[240],"08).":[241],"4)":[242],"Finally,":[243],"using":[244],"listing":[248],"deterministic":[255],"cut":[259],"sparsifiers":[260],"when":[264],"are":[266],"interested":[267],"preserving":[269],"min-cuts":[270],"upto":[273],"c":[274,322],"between":[275,323],"bipartitions":[276,324],"terminal":[279],"set.":[280],"constructs":[283],"sparsifier":[285,310],"\ud835\udcaa(binom(t,":[288,295],"3c)2^{\ud835\udcaa(c)})":[290],"3c)":[297],"2^{\ud835\udcaa(c)}(m":[298],"n)),":[300],"t":[302],"terminals,":[307],"additionally":[311],"preserves":[312],"set":[314],"terminals.":[327]},"counts_by_year":[],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-12-08T00:00:00"}