A practical approximation algorithm for optimal k-anonymity. - Batya Kenig; Tamir Tassa (Data Min. Knowl. Discov., 2012)

A New Class of Lineage Expressions over Probabilistic Databases Computable in P-Time. - Batya Kenig; Avigdor Gal; Ofer Strichman (SUM, 2013)

MFIBlocks: An effective blocking algorithm for entity resolution. - Batya Kenig; Avigdor Gal (Inf. Syst., 2013)

On the Impact of Junction-Tree Topology on Weighted Model Counting. - Batya Kenig; Avigdor Gal (SUM, 2015)

Exploiting the Hidden Structure of Junction Trees for MPE. - Batya Kenig; Avigdor Gal (AAAI Workshop: Beyond NP, 2016)

On the Enumeration of Tree Decompositions. - Nofar Carmeli; Batya Kenig; Benny Kimelfeld (AMW, 2016)

On the Enumeration of all Minimal Triangulations. - Nofar Carmeli; Batya Kenig; Benny Kimelfeld (CoRR, 2016)

A Database Framework for Probabilistic Preferences. - Batya Kenig; Benny Kimelfeld; Haoyue Ping; Julia Stoyanovich (AMW, 2017)

Efficiently Enumerating Minimal Triangulations. - Nofar Carmeli; Batya Kenig; Benny Kimelfeld (PODS, 2017)

Querying Probabilistic Preferences in Databases. - Batya Kenig; Benny Kimelfeld; Haoyue Ping; Julia Stoyanovich (PODS, 2017)

Probabilistic Inference Over Repeated Insertion Models. - Batya Kenig; Lovro Ilijasic; Haoyue Ping; Benny Kimelfeld; Julia Stoyanovich (AAAI, 2018)

A Query Engine for Probabilistic Preferences. - Uzi Cohen; Batya Kenig; Haoyue Ping; Benny Kimelfeld; Julia Stoyanovich (SIGMOD Conference, 2018)

The Complexity of the Possible Winner Problem over Partitioned Preferences. - Batya Kenig (CoRR, 2018)

Approximate Inference of Outcomes in Probabilistic Elections. - Batya Kenig; Benny Kimelfeld (AAAI, 2019)

The Complexity of the Possible Winner Problem with Partitioned Preferences. - Batya Kenig (AAMAS, 2019)

Mining Approximate Acyclic Schemes from Relations. - Batya Kenig; Pranay Mundra; Guna Prasaad; Babak Salimi; Dan Suciu (SIGMOD Conference, 2020)

A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive Queries. - Batya Kenig; Dan Suciu (PODS, 2021)

Approximate implication with d-separation. - Batya Kenig (UAI, 2021)

Efficiently enumerating minimal triangulations. - Nofar Carmeli; Batya Kenig; Benny Kimelfeld; Markus Kröll (Discret. Appl. Math., 2021)

Integrity Constraints Revisited: From Exact to Approximate Implication. - Batya Kenig; Dan Suciu (Log. Methods Comput. Sci., 2022)

Quantifying the Loss of Acyclic Join Dependencies. - Batya Kenig; Nir Weinberger (PODS, 2023)

Ranked Enumeration of Minimal Separators. - Batya Kenig (CoRR, 2023)

Enumeration of Minimal Hitting Sets Parameterized by Treewidth. - Batya Kenig; Dan Shlomo Mizrahi (ICDT, 2025)

CausaLens: A System for Summarizing Causal DAGs. - Noam Chen; Anna Zeng; Michael J. Cafarella; Batya Kenig; Markos Markakis; Oren Mishali; Brit Youngmann; Babak Salimi (SIGMOD Conference Companion, 2025)

Enumerating Optimal Cost-Constrained Adjustment Sets. - Batya Kenig (UAI, 2025)

Approximate Implication for Probabilistic Graphical Models. - Batya Kenig (J. Artif. Intell. Res., 2025)

Causal DAG Summarization. - Anna Zeng; Michael J. Cafarella; Batya Kenig; Markos Markakis; Brit Youngmann; Babak Salimi (Proc. VLDB Endow., 2025)

Causal DAG Summarization (Full Version). - Anna Zeng; Michael J. Cafarella; Batya Kenig; Markos Markakis; Brit Youngmann; Babak Salimi (CoRR, 2025)

Connectivity-Preserving Minimum Separator in AT-free Graphs. - Batya Kenig (CoRR, 2025)