An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. - Michael Bauland; Philippe Chapdelaine; Nadia Creignou; Miki Hermann; Heribert Vollmer (SAT (Selected Papers, 2004)

The complexity of Boolean constraint satisfaction local search problems. - Philippe Chapdelaine; Nadia Creignou (Ann. Math. Artif. Intell., 2005)

Lower bounds and complete problems in nondeterministic linear time and sublinear space complexity classes - Philippe Chapdelaine; Etienne Grandjean (CoRR, 2006)

On the structure of linear-time reducibility - Philippe Chapdelaine (CoRR, 2006)

Complexity of Default Logic on Generalized Conjunctive Queries. - Philippe Chapdelaine; Miki Hermann; Ilka Schnoor (LPNMR, 2007)