The Descriptive Complexity of the Deterministic Exponential Time Hierarchy. - Cibele Matos Freire; Ana Teresa C. Martins (LSFA, 2010)

Hybrid Logics and NP Graph Properties. - Francicleber Martins Ferreira; Cibele Matos Freire; Mario R. F. Benevides; Luis Menasché Schechter; Ana Teresa C. Martins (WoLLIC, 2011)

Polynomial hierarchy graph properties in hybrid logic. - Francicleber Martins Ferreira; Cibele Matos Freire; Mario R. F. Benevides; Luis Menasché Schechter; Ana Teresa C. Martins (J. Comput. Syst. Sci., 2014)

A Characterization of the Complexity of Resilience and Responsibility for Self-join-free Conjunctive Queries. - Cibele Freire; Wolfgang Gatterbauer; Neil Immerman; Alexandra Meliou (CoRR, 2015)

The Complexity of Resilience and Responsibility for Self-Join-Free Conjunctive Queries. - Cibele Freire; Wolfgang Gatterbauer; Neil Immerman; Alexandra Meliou (Proc. VLDB Endow., 2015)

New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins. - Cibele Freire; Wolfgang Gatterbauer; Neil Immerman; Alexandra Meliou (PODS, 2020)

Project-connex Decompositions and Tractability of Aggregate Group-by Conjunctive Queries. - Diego Figueira; Cibele Freire (CoRR, 2025)