| 2025 | ICDT | Enumeration of Minimal Hitting Sets Parameterized by Treewidth. | Batya Kenig, Dan Shlomo Mizrahi |
| 2025 | SIGMOD | CausaLens: A System for Summarizing Causal DAGs. | Noam Chen, Anna Zeng, Michael J. Cafarella, Batya Kenig, Markos Markakis, Oren Mishali, Brit Youngmann, Babak Salimi |
| 2025 | UAI | Enumerating Optimal Cost-Constrained Adjustment Sets. | Batya Kenig |
| 2025 | WG | Connectivity-Preserving Minimum Separator in AT-Free Graphs. | Batya Kenig |
| 2023 | PODS | Quantifying the Loss of Acyclic Join Dependencies. | Batya Kenig, Nir Weinberger |
| 2021 | PODS | A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive Queries. | Batya Kenig, Dan Suciu |
| 2021 | UAI | Approximate implication with d-separation. | Batya Kenig |
| 2020 | ICDT | Integrity Constraints Revisited: From Exact to Approximate Implication. | Batya Kenig, Dan Suciu |
| 2020 | SIGMOD | Mining Approximate Acyclic Schemes from Relations. | Batya Kenig, Pranay Mundra, Guna Prasaad, Babak Salimi, Dan Suciu |
| 2019 | AAAI | Approximate Inference of Outcomes in Probabilistic Elections. | Batya Kenig, Benny Kimelfeld |
| 2018 | AAAI | Probabilistic Inference Over Repeated Insertion Models. | Batya Kenig, Lovro Ilijasic, Haoyue Ping, Benny Kimelfeld, Julia Stoyanovich |
| 2018 | SIGMOD | A Query Engine for Probabilistic Preferences. | Uzi Cohen, Batya Kenig, Haoyue Ping, Benny Kimelfeld, Julia Stoyanovich |
| 2017 | PODS | Efficiently Enumerating Minimal Triangulations. | Nofar Carmeli, Batya Kenig, Benny Kimelfeld |
| 2017 | PODS | Querying Probabilistic Preferences in Databases. | Batya Kenig, Benny Kimelfeld, Haoyue Ping, Julia Stoyanovich |
| 2016 | AAAI | Exploiting the Hidden Structure of Junction Trees for MPE. | Batya Kenig, Avigdor Gal |