4 papers
Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems
Batya Kenig
Important separators are a cornerstone of parameterized algorithms for graph separation: they reduce an a priori enormous search space of separators to a small, structured family t…
Connectivity-Preserving Minimum Separator in AT-free Graphs
Batya Kenig
Let and be disjoint, non-adjacent vertex-sets in an undirected, connected graph , whose vertices are associated with positive weights. We address the problem of identify…
Causal DAG Summarization (Full Version)
Anna Zeng, Michael Cafarella, Batya Kenig +3
Causal inference aids researchers in discovering cause-and-effect relationships, leading to scientific insights. Accurate causal estimation requires identifying confounding variabl…
Enumeration of Minimal Hitting Sets Parameterized by Treewidth
Batya Kenig, Dan Shlomo Mizrahi
Enumerating the minimal hitting sets of a hypergraph is a problem which arises in many data management applications that include constraint mining, discovering unique column combin…