Decidability of Equivalence for Linear Letter to Letter To-down Tree Transducers. - Yves Andre; Francis Bossut (FCT, 1993)

Decidability of Equivalence for a Class of Non-Deterministic Tree Transducers. - Yves Andre; Max Dauchet (RAIRO Theor. Informatics Appl., 1994)

The Equivalence Problem for Letter-to-Letter Bottom-up Tree Transducers is Solvable. - Yves Andre; Francis Bossut (TAPSOFT, 1995)

Word-into-Tree Transducers with Bounded Difference. - Yves Andre; Francis Bossut (TAPSOFT, 1997)

On the Equivalence Problem for Letter-to-Letter Top-Down Tree Transducers. - Yves Andre; Francis Bossut (Theor. Comput. Sci., 1998)

On decidability of boundedness property for regular path queries. - Yves Andre; Francis Bossut; Anne-Cécile Caron (Developments in Language Theory, 1999)

Extraction and Implication of Path Constraints. - Yves Andre; Anne-Cécile Caron; Denis Debarbieux; Yves Roos; Sophie Tison (MFCS, 2004)

Indexes and Path Constraints in Semistructured Data. - Yves Andre; Anne-Cécile Caron; Denis Debarbieux; Yves Roos (DEXA Workshops, 2005)

Path constraints in semistructured data. - Yves Andre; Anne-Cécile Caron; Denis Debarbieux; Yves Roos; Sophie Tison (Theor. Comput. Sci., 2007)

Transaction Analysis- A mechanism to detect and prevent VAT-fraud in the European Emissions Trading System (EU ETS). - Thomas Schütz; Yves Andre; Mladen Vukovic (EnviroInfo/ICT4S (2), 2015)