Batya Kenig

39 papers A* 6A 5B 1Journal 19Unranked 8
YearRankTypeTitle / Venue / Authors
2025 J jnl
Approximate Implication for Probabilistic Graphical Models.
J. Artif. Intell. Res.
Batya Kenig
2025 — conf
CausaLens: A System for Summarizing Causal DAGs.
SIGMOD Conference Companion
Noam Chen, Anna Zeng, Michael J. Cafarella, Batya Kenig, Markos Markakis, Oren Mishali, Brit Youngmann, Babak Salimi
2025 J jnl
Causal DAG Summarization (Full Version).
CoRR
Anna Zeng, Michael J. Cafarella, Batya Kenig, Markos Markakis, Brit Youngmann, Babak Salimi
2025 J jnl
Causal DAG Summarization.
Proc. VLDB Endow.
Anna Zeng, Michael J. Cafarella, Batya Kenig, Markos Markakis, Brit Youngmann, Babak Salimi
2025 J jnl
Connectivity-Preserving Important Separators: Enumeration and an Improved FPT Algorithm for Node Multiway Cut-Uncut.
CoRR
Batya Kenig
2025 B conf
Connectivity-Preserving Minimum Separator in AT-Free Graphs.
WG
Batya Kenig
2025 J jnl
Connectivity-Preserving Minimum Separator in AT-free Graphs.
CoRR
Batya Kenig
2025 A conf
Enumerating Optimal Cost-Constrained Adjustment Sets.
UAI
Batya Kenig
2025 A conf
Enumeration of Minimal Hitting Sets Parameterized by Treewidth.
ICDT
Batya Kenig, Dan Shlomo Mizrahi
2024 J jnl
Enumeration of Minimal Hitting Sets Parameterized by Treewidth.
CoRR
Batya Kenig, Dan Shlomo Mizrahi
2023 J jnl
Approximate Implication for Probabilistic Graphical Models.
CoRR
Batya Kenig
2023 A* conf
Quantifying the Loss of Acyclic Join Dependencies.
PODS
Batya Kenig, Nir Weinberger
2023 J jnl
Ranked Enumeration of Minimal Separators.
CoRR
Batya Kenig
2022 J jnl
Integrity Constraints Revisited: From Exact to Approximate Implication.
Log. Methods Comput. Sci.
Batya Kenig, Dan Suciu
2022 J jnl
Quantifying the Loss of Acyclic Join Dependencies.
CoRR
Batya Kenig, Nir Weinberger
2021 A* conf
A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive Queries.
PODS
Batya Kenig, Dan Suciu
2021 J jnl
Approximate Implication with d-Separation.
CoRR
Batya Kenig
2021 A conf
Approximate implication with d-separation.
UAI
Batya Kenig
2021 J jnl
Efficiently enumerating minimal triangulations.
Discret. Appl. Math.
Nofar Carmeli, Batya Kenig, Benny Kimelfeld, Markus Kröll
2020 J jnl
A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive Queries.
CoRR
Batya Kenig, Dan Suciu
2020 A conf
Integrity Constraints Revisited: From Exact to Approximate Implication.
ICDT
Batya Kenig, Dan Suciu
2020 — conf
Mining Approximate Acyclic Schemes from Relations.
SIGMOD Conference
Batya Kenig, Pranay Mundra, Guna Prasaad, Babak Salimi, Dan Suciu
2019 A* conf
Approximate Inference of Outcomes in Probabilistic Elections.
AAAI
Batya Kenig, Benny Kimelfeld
2019 J jnl
Mining Approximate Acyclic Schemes from Relations.
CoRR
Batya Kenig, Pranay Mundra, Guna Prasaad, Babak Salimi, Dan Suciu
2019 A conf
The Complexity of the Possible Winner Problem with Partitioned Preferences.
AAMAS
Batya Kenig
2018 — conf
A Query Engine for Probabilistic Preferences.
SIGMOD Conference
Uzi Cohen, Batya Kenig, Haoyue Ping, Benny Kimelfeld, Julia Stoyanovich
2018 J jnl
Integrity Constraints Revisited: From Exact to Approximate Implication.
CoRR
Batya Kenig, Dan Suciu
2018 A* conf
Probabilistic Inference Over Repeated Insertion Models.
AAAI
Batya Kenig, Lovro Ilijasic, Haoyue Ping, Benny Kimelfeld, Julia Stoyanovich
2018 J jnl
The Complexity of the Possible Winner Problem over Partitioned Preferences.
CoRR
Batya Kenig
2017 — conf
A Database Framework for Probabilistic Preferences.
AMW
Batya Kenig, Benny Kimelfeld, Haoyue Ping, Julia Stoyanovich
2017 A* conf
Efficiently Enumerating Minimal Triangulations.
PODS
Nofar Carmeli, Batya Kenig, Benny Kimelfeld
2017 A* conf
Querying Probabilistic Preferences in Databases.
PODS
Batya Kenig, Benny Kimelfeld, Haoyue Ping, Julia Stoyanovich
2016 — conf
Exploiting the Hidden Structure of Junction Trees for MPE.
AAAI Workshop: Beyond NP
Batya Kenig, Avigdor Gal
2016 — conf
On the Enumeration of Tree Decompositions.
AMW
Nofar Carmeli, Batya Kenig, Benny Kimelfeld
2016 J jnl
On the Enumeration of all Minimal Triangulations.
CoRR
Nofar Carmeli, Batya Kenig, Benny Kimelfeld
2015 — conf
On the Impact of Junction-Tree Topology on Weighted Model Counting.
SUM
Batya Kenig, Avigdor Gal
2013 — conf
A New Class of Lineage Expressions over Probabilistic Databases Computable in P-Time.
SUM
Batya Kenig, Avigdor Gal, Ofer Strichman
2013 J jnl
MFIBlocks: An effective blocking algorithm for entity resolution.
Inf. Syst.
Batya Kenig, Avigdor Gal
2012 J jnl
A practical approximation algorithm for optimal k-anonymity.
Data Min. Knowl. Discov.
Batya Kenig, Tamir Tassa