Introduction à la logique modale. Master thesis (under the supervision of Georges Hansoul), 2004.
Axiomatization of ML and Cheq. Master thesis (under the supervision of Nick Bezhanishvili and Yde Venema), 2006.
ML is not finitely axiomatizable over Cheq. Gaëlle Fontaine. Proceedings of AiML 2006.
Continuous fragment of the mu-calculus. Gaëlle Fontaine. Proceedings of CSL 2008.
An easy completeness proof for the mu-calculus on finite trees. Balder ten Cate and Gaëlle Fontaine. Proceedings of FOSSACS 2010.
Automata for coalgebras: an approach using coalgebraic liftings . Gaëlle Fontaine, Raul Leal and Yde Venema. Proceedings of Icalp 2010.
Frame definability for classes of trees in the mu-calculus. Gaëlle Fontaine and Thomas Place. Proceedings of MFCS 2010.
Modal fixpoint logic: some model-theoretic questions. PhD thesis (2010). Acknowledgments and cover.
On the data complexity of consistent query answering. Balder ten Cate, Gaëlle Fontaine and Phokion Kolaitis. Proceedings of ICDT 2012.
Why is it hard to obtain a dichotomy conjecture for consistent query answering? Gaëlle Fontaine. Proceedings of LICS 2013. Journal version (Transactions on Computational Logic).
Expressive Languages for Path Queries over Graphs with Data. Pablo Barceló , Gaëlle Fontaine and Anthony Widjaja Lin. Proceedings of LPAR 2013.
On the Data Complexity of Consistent Query Answering over Graph Databases. Pablo Barceló , Gaëlle Fontaine. Proceedings of ICDT 2015.