Facial Circuits of Planar Graphs and Context-Free Languages. - Bruno Courcelle; Denis Lapoire (MFCS, 1998)

Recognizability Equals Monadic Second-Order Definability for Sets of Graphs of Bounded Tree-Width. - Denis Lapoire (STACS, 1998)

Criteria to disprove context freeness of collage languages. - Frank Drewes; Hans-Jörg Kreowski; Denis Lapoire (Theor. Comput. Sci., 2003)