Incremental Algorithms Based on Discrete Green Theorem. - Srecko Brlek; Gilbert Labelle; Annie Lacasse (DGCI, 2003)

A Note on a Result of Daurat and Nivat. - Srecko Brlek; Gilbert Labelle; Annie Lacasse (Developments in Language Theory, 2005)

Algorithms for polyominoes based on the discrete Green theorem. - Srecko Brlek; Gilbert Labelle; Annie Lacasse (Discret. Appl. Math., 2005)

The discrete Green Theorem and some applications in discrete geometry. - Srecko Brlek; Gilbert Labelle; Annie Lacasse (Theor. Comput. Sci., 2005)

Properties of the Contour Path of Discrete Sets. - Srecko Brlek; Gilbert Labelle; Annie Lacasse (Int. J. Found. Comput. Sci., 2006)

On Minimal Moment of Inertia Polyominoes. - Srecko Brlek; Gilbert Labelle; Annie Lacasse (DGCI, 2008)

Shuffle operations on discrete paths. - Srecko Brlek; Gilbert Labelle; Annie Lacasse (Theor. Comput. Sci., 2008)

Discrete sets with minimal moment of inertia. - Srecko Brlek; Gilbert Labelle; Annie Lacasse (Theor. Comput. Sci., 2008)

Discrete Versions of Stokes' Theorem Based on Families of Weights on Hypercubes. - Gilbert Labelle; Annie Lacasse (DGCI, 2009)

A study of Jacobi-Perron boundary words for the generation of discrete planes. - Valérie Berthé; Annie Lacasse; Geneviève Paquin; Xavier Provençal (Theor. Comput. Sci., 2013)