A polynomial-time algorithm for near-unanimity graphs. - Benoît Larose; Cynthia Loten; László Zádori (J. Algorithms, 2005)

A Characterisation of First-Order Constraint Satisfaction Problems. - Benoît Larose; Cynthia Loten; Claude Tardif (Log. Methods Comput. Sci., 2007)

Majority functions on structures with finite duality. - Cynthia Loten; Claude Tardif (Eur. J. Comb., 2008)

Absolute retracts and varieties generated by chordal graphs. - Cynthia Loten (Discret. Math., 2010)

Near-Unanimity Polymorphisms on Structures with Finite Duality. - Cynthia Loten; Claude Tardif (SIAM J. Discret. Math., 2011)

Graphs Admitting k-NU Operations. Part 1: The Reflexive Case. - Tomás Feder; Pavol Hell; Benoît Larose; Cynthia Loten; Mark H. Siggers; Claude Tardif (SIAM J. Discret. Math., 2013)