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)

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

Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration. - Nofar Carmeli; Shai Zeevi; Christoph Berkholz; Benny Kimelfeld; Nicole Schweikardt (PODS, 2020)

ExtremeReader: An interactive explorer for customizable and explainable review summarization. - Xiaolan Wang 001; Yoshihiko Suhara; Natalie Nuno; Yuliang Li 001; Jinfeng Li; Nofar Carmeli; Stefanos Angelidis; Eser Kandogann; Wang-Chiew Tan (WWW (Companion Volume), 2020)

ExplainIt: Explainable Review Summarization with Opinion Causality Graphs. - Nofar Carmeli; Xiaolan Wang 001; Yoshihiko Suhara; Stefanos Angelidis; Yuliang Li 001; Jinfeng Li; Wang-Chiew Tan (CoRR, 2020)

Enumeration Complexity of Conjunctive Queries with Functional Dependencies. - Nofar Carmeli; Markus Kröll (Theory Comput. Syst., 2020)

The Power of Implicit Acyclicity in the Enumeration Complexity of Database Queries. - Nofar Carmeli (2020)

Tuple-Independent Representations of Infinite Probabilistic Databases. - Nofar Carmeli; Martin Grohe; Peter Lindner 001; Christoph Standke (PODS, 2021)

Constructing Explainable Opinion Graphs from Reviews. - Nofar Carmeli; Xiaolan Wang 001; Yoshihiko Suhara; Stefanos Angelidis; Yuliang Li 001; Jinfeng Li; Wang-Chiew Tan (WWW, 2021)

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

On the Enumeration Complexity of Unions of Conjunctive Queries. - Nofar Carmeli; Markus Kröll (ACM Trans. Database Syst., 2021)

Answering Unions of Conjunctive Queries with Ideal Time Guarantees (Invited Talk). - Nofar Carmeli (ICDT, 2022)

Conjunctive queries with self-joins, towards a fine-grained complexity analysis. - Nofar Carmeli; Luc Segoufin (CoRR, 2022)

Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration. - Nofar Carmeli; Shai Zeevi; Christoph Berkholz; Alessio Conte; Benny Kimelfeld; Nicole Schweikardt (ACM Trans. Database Syst., 2022)

Answering Aggregate Queries with Ordered Direct Access (short paper). - Idan Eldar; Nofar Carmeli; Benny Kimelfeld (AMW, 2023)

Accessing Answers to Conjunctive Queries with Ideal Time Guarantees (Abstract of Invited Talk). - Nofar Carmeli (Description Logics, 2023)

Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis. - Nofar Carmeli; Luc Segoufin (PODS, 2023)

Efficient Computation of Quantiles over Joins. - Nikolaos Tziavelis; Nofar Carmeli; Wolfgang Gatterbauer; Benny Kimelfeld; Mirek Riedewald (PODS, 2023)

Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries. - Nofar Carmeli; Nikolaos Tziavelis; Wolfgang Gatterbauer; Benny Kimelfeld; Mirek Riedewald (ACM Trans. Database Syst., 2023)

Direct Access for Answers to Conjunctive Queries with Aggregation. - Idan Eldar; Nofar Carmeli; Benny Kimelfeld (ICDT, 2024)

Database Repairing with Soft Functional Dependencies. - Nofar Carmeli; Martin Grohe; Benny Kimelfeld; Ester Livshits; Muhammad Tibi (ACM Trans. Database Syst., 2024)

PACMMOD, V2, N5 (PODS), November 2024 Editorial. - Nofar Carmeli; Floris Geerts; Benny Kimelfeld (Proc. ACM Manag. Data, 2024)

Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries. - Karl Bringmann; Nofar Carmeli (Log. Methods Comput. Sci., 2025)

Tight Fine-Grained Bounds for Direct Access on Join Queries. - Karl Bringmann; Nofar Carmeli; Stefan Mengel (ACM Trans. Database Syst., 2025)

PACMMOD, V3, N2 (PODS), May 2025 Editorial. - Nofar Carmeli; Floris Geerts; Ahmet Kara 002; Benny Kimelfeld (Proc. ACM Manag. Data, 2025)