Cayley Graphs of Virtually Free Groups. - Giovanna D'Agostino (Int. J. Algebra Comput., 1993)

Topological Structure of Diagonalizable Algebras and Corresponding Logical Properties of Theories. - Giovanna D'Agostino (Notre Dame J. Formal Log., 1994)

A Set-Theoretic Translation Method for (Poly)modal Logics. - Giovanna D'Agostino; Angelo Montanari; Alberto Policriti (STACS, 1995)

A Set-Theoretic Translation Method for Polymodal Logics. - Giovanna D'Agostino; Angelo Montanari; Alberto Policriti (J. Autom. Reason., 1995)

Complete, Recursively Enumerable Relations in Arithmetic. - Giovanna D'Agostino; Mario Magnago (Math. Log. Q., 1995)

Uniform Interpolation, Automata and the Modal μ-Calculus. - Giovanna D'Agostino; Marco Hollenberg (Advances in Modal Logic, 1996)

Translating the hypergame paradox: Remarks on the set of founded elements of a relation. - Claudio Bernardi; Giovanna D'Agostino (J. Philos. Log., 1996)

Modal Deduction in Second-Order Logic and Set Theory - I. - Johan van Benthem; Giovanna D'Agostino; Angelo Montanari; Alberto Policriti (J. Log. Comput., 1997)

Modal Deduction in Second-Order Logic and Set Theory - II. - Johan van Benthem; Giovanna D'Agostino; Angelo Montanari; Alberto Policriti (Stud Logica, 1998)

Logical Questions Concerning The mu-Calculus: Interpolation, Lyndon and Los-Tarski. - Giovanna D'Agostino; Marco Hollenberg (J. Symb. Log., 2000)

Finality regained: A coalgebraic study of Scott-sets and multisets. - Giovanna D'Agostino; Albert Visser (Arch. Math. Log., 2002)

Characterizing Interpolation Pairs in Infinitary Graded Logics. - Giovanna D'Agostino (J. Log. Comput., 2003)

Uniform Interpolation, Bisimulation Quantifiers, and Fixed Points. - Giovanna D'Agostino (TbiLLC, 2005)

An axiomatization of bisimulation quantifiers via the mu-calculus. - Giovanna D'Agostino; Giacomo Lenzi (Theor. Comput. Sci., 2005)

µ-programs, uniform interpolation and bisimulation quantifiers for modal logics. - Giovanna D'Agostino; Giacomo Lenzi; Tim French 002 (J. Appl. Non Class. Logics, 2006)

On modal mu-calculus with explicit interpolants. - Giovanna D'Agostino; Giacomo Lenzi (J. Appl. Log., 2006)

A Note on Bisimulation Quantifiers and Fixed Points over Transitive Frames. - Giovanna D'Agostino; Giacomo Lenzi (J. Log. Comput., 2008)

Interpolation in non-classical logics. - Giovanna D'Agostino (Synth., 2008)

On Modal μ-Calculus over Finite Graphs with Bounded Strongly Connected Components - Giovanna D'Agostino; Giacomo Lenzi (GANDALF, 2010)

On the µ-calculus over transitive and finite transitive frames. - Giovanna D'Agostino; Giacomo Lenzi (Theor. Comput. Sci., 2010)

On modal mu-calculus in S5 and applications. - Giovanna D'Agostino; Giacomo Lenzi (CILC, 2011)

Deciding the existence of uniform interpolants over transitive models. - Giovanna D'Agostino; Giacomo Lenzi (Arch. Math. Log., 2011)

On Modal μ-Calculus over Finite Graphs with Small Components or Small Tree Width. - Giovanna D'Agostino; Giacomo Lenzi (Int. J. Found. Comput. Sci., 2012)

On Modal μ-Calculus in S5 and Applications. - Giovanna D'Agostino; Giacomo Lenzi (Fundam. Informaticae, 2013)

On modal μ-calculus over reflexive symmetric graphs. - Giovanna D'Agostino; Giacomo Lenzi (J. Log. Comput., 2013)

Games, Automata, Logic, and Formal Verification (GandALF 2011). - Giovanna D'Agostino; Salvatore La Torre (Theor. Comput. Sci., 2013)

Mapping Sets and Hypersets into Numbers. - Giovanna D'Agostino; Eugenio G. Omodeo; Alberto Policriti; Alexandru I. Tomescu (Fundam. Informaticae, 2015)

Bisimulation quantifiers and uniform interpolation for guarded first order logic. - Giovanna D'Agostino; Giacomo Lenzi (Theor. Comput. Sci., 2015)

The logic of the reverse mathematics zoo. - Giovanna D'Agostino; Alberto Marcone (Math. Struct. Comput. Sci., 2018)

The μ-Calculus Alternation Depth Hierarchy is infinite over finite planar graphs. - Giovanna D'Agostino; Giacomo Lenzi (Theor. Comput. Sci., 2018)

Uniform interpolation for propositional and modal team logics. - Giovanna D'Agostino (J. Log. Comput., 2019)

Regular Languages meet Prefix Sorting. - Jarno Alanko; Giovanna D'Agostino; Alberto Policriti; Nicola Prezza (SODA, 2020)

Ordering Regular Languages: a Danger Zone. - Davide Martincigh; Giovanna D'Agostino; Alberto Policriti (ICTCS, 2021)

Which Regular Languages can be Efficiently Indexed? - Nicola Cotumaccio; Giovanna D'Agostino; Alberto Policriti; Nicola Prezza (CoRR, 2021)

On (co-lex) Ordering Automata. - Giovanna D'Agostino; Nicola Cotumaccio; Alberto Policriti; Nicola Prezza (CoRR, 2021)

Wheeler languages. - Jarno Alanko; Giovanna D'Agostino; Alberto Policriti; Nicola Prezza (Inf. Comput., 2021)

A Linear-size Cascade Decomposition for Wheeler Automata. - Giovanna D'Agostino; Luca Geatti; Davide Martincigh; Alberto Policriti (ICTCS, 2023)

Ordering regular languages and automata: Complexity. - Giovanna D'Agostino; Davide Martincigh; Alberto Policriti (Theor. Comput. Sci., 2023)

Co-lexicographically Ordering Automata and Regular Languages - Part I. - Nicola Cotumaccio; Giovanna D'Agostino; Alberto Policriti; Nicola Prezza (J. ACM, 2023)

Cascade products and Wheeler automata. - Giovanna D'Agostino; Luca Geatti; Davide Martincigh; Alberto Policriti (Theor. Comput. Sci., 2024)

Wheeler Graphs and Wheeler Languages. - Nicola Cotumaccio; Giovanna D'Agostino; Daniel Gibney; Alberto Policriti; Nicola Prezza; Sharma V. Thankachan (The Expanding World of Compressed Data, 2025)

Universally Wheeler Languages. - Ruben Becker; Giuseppa Castiglione; Giovanna D'Agostino; Alberto Policriti; Nicola Prezza; Antonio Restivo; Brian Riccardi (DLT, 2025)