Sur l'Inversion et l'Iteration Continue des Séries Formelles. - Gilbert Labelle (Eur. J. Comb., 1980)

Une combinatoire sous-jacente au théorème des fonctions implicites. - Gilbert Labelle (J. Comb. Theory A, 1985)

Éclosions combinatoires appliquées à l'inversion multidimensionnelle des séries formelles. - Gilbert Labelle (J. Comb. Theory A, 1985)

Functional Equations for Data Structures. - François Bergeron; Gilbert Labelle; Pierre Leroux (STACS, 1988)

On the generalized iterates of Yeh's combinatorial K-species. - Gilbert Labelle (J. Comb. Theory A, 1989)

Dérivées directionnelles et développements de Taylor combinatoires. - Gilbert Labelle (Discret. Math., 1990)

Computation of the expected number of leaves in a tree having a given automorphism, and related topics. - François Bergeron; Gilbert Labelle; Pierre Leroux (Discret. Appl. Math., 1991)

The functorial composition of species, a forgotten operation. - Hélène Décoste; Gilbert Labelle; Pierre Leroux (Discret. Math., 1992)

On asymmetric structures. - Gilbert Labelle (Discret. Math., 1992)

Counting Asymmetric Enriched Trees. - Gilbert Labelle (J. Symb. Comput., 1992)

Familles de solutions combinatoires de y'=1+y2 et d'équations différentielles autonomes. - Yves Chiricota; Gilbert Labelle (Discret. Math., 1993)

Sur la symétrie et l'asymétrie des structures combinatoires. - Gilbert Labelle (Theor. Comput. Sci., 1993)

Arbres, arborescences et racines carrées symétriques. - Pierre Bouchard; Yves Chiricota; Gilbert Labelle (Discret. Math., 1995)

Sur la distribution de l'arité de la racine d'une arborescence hyperquaternaire à d dimensions. - Gilbert Labelle; Louise Laforest (Discret. Math., 1995)

Lagrange Inversion for Species. - Ira M. Gessel; Gilbert Labelle (J. Comb. Theory A, 1995)

Combinatorial Variations on Multidimensional Quadtrees. - Gilbert Labelle; Louise Laforest (J. Comb. Theory A, 1995)

Sur une généralisation des séries indicatrices d'espèces. - Gilbert Labelle; Jacques Labelle; Kathleen Pineau (J. Comb. Theory A, 1995)

Some Combinatorial Results First Found Using Computer Algebra. - Gilbert Labelle (J. Symb. Comput., 1995)

Hypergeometrics and the Cost Structure of Quadtrees. - Philippe Flajolet; Gilbert Labelle; Louise Laforest; Bruno Salvy (Random Struct. Algorithms, 1995)

An extension of the exponential formula in enumerative combinatorics. - Gilbert Labelle; Pierre Leroux (Electron. J. Comb., 1996)

Une généralisation automorphe des nombres de Stirling. - Ivan Constantineau; Gilbert Labelle (Discret. Math., 1996)

Le q-dénombrement générique d'une espèce: Existence et méthode de calcul. - Hélène Décoste; Gilbert Labelle (Discret. Math., 1996)

Etude de constantes universelles pour les arborescences hyperquaternaires de recherche. - Gilbert Labelle; Louise Laforest (Discret. Math., 1996)

Enumeration of (uni- or bicolored) plane trees according to their degree distribution. - Gilbert Labelle; Pierre Leroux (Discret. Math., 1996)

Combinatorial species and tree-like structures. - François Bergeron; Gilbert Labelle; Pierre Leroux (Cambridge University Press, 1997)

Enumeration of m-Ary Cacti. - Miklós Bóna; Michel Bousquet; Gilbert Labelle; Pierre Leroux (Adv. Appl. Math., 2000)

Enumeration of planar two-face maps. - Michel Bousquet; Gilbert Labelle; Pierre Leroux (Discret. Math., 2000)

Counting enriched multigraphs according to the number of their edges (or arcs). - Gilbert Labelle (Discret. Math., 2000)

Generalized Binomial Coefficients for Molecular Species. - Pierre Auger; Gilbert Labelle; Pierre Leroux (J. Comb. Theory A, 2000)

Combinatorial Addition Formulas and Applications. - Pierre Auger; Gilbert Labelle; Pierre Leroux (Adv. Appl. Math., 2002)

The Specification of 2-trees. - Tom Fowler; Ira M. Gessel; Gilbert Labelle; Pierre Leroux (Adv. Appl. Math., 2002)

Foreword. - Gilbert Labelle; Pierre Leroux (Discret. Math., 2002)

Stirling numbers interpolation using permutations with forbidden subsequences. - Gilbert Labelle; Pierre Leroux; Elisa Pergola; Renzo Pinzani (Discret. Math., 2002)

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

Two bijective proofs for the arborescent form of the Good-Lagrange formula and some applications to colored rooted trees and cacti. - Michel Bousquet; Cédric Chauve; Gilbert Labelle; Pierre Leroux (Theor. Comput. Sci., 2003)

A classification of plane and planar 2-trees. - Gilbert Labelle; Cédric Lamathe; Pierre Leroux (Theor. Comput. Sci., 2003)

A shifted asymmetry index series. - Gilbert Labelle; Cédric Lamathe (Adv. Appl. Math., 2004)

Even permutations and oriented sets: their shifted asymmetry index series. - Gilbert Labelle; Cédric Lamathe (Adv. Appl. Math., 2004)

Labelled and unlabelled enumeration of k-gonal 2-trees. - Gilbert Labelle; Cédric Lamathe; Pierre Leroux (J. Comb. Theory A, 2004)

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

Counting unlabelled toroidal graphs with no K33-subdivisions. - Andrei Gagarin; Gilbert Labelle; Pierre Leroux (CoRR, 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)

The structure and unlabelled enumeration of toroidal graphs with no K3, 3's. - Andrei Gagarin; Gilbert Labelle; Pierre Leroux (Electron. Notes Discret. Math., 2006)

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

Counting unlabelled toroidal graphs with no K3, 3-subdivisions. - Andrei Gagarin; Gilbert Labelle; Pierre Leroux (Adv. Appl. Math., 2007)

Two-connected graphs with prescribed three-connected components. - Andrei Gagarin; Gilbert Labelle; Pierre Leroux; Timothy Walsh 001 (CoRR, 2007)

The structure of K3, 3-subdivision-free toroidal graphs. - Andrei Gagarin; Gilbert Labelle; Pierre Leroux (Discret. Math., 2007)

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)

Structure and enumeration of two-connected graphs with prescribed three-connected components. - Andrei Gagarin; Gilbert Labelle; Pierre Leroux; Timothy Walsh 001 (Adv. Appl. Math., 2009)

Exhaustive generation of atomic combinatorial differential operators. - Hugo Tremblay; Gilbert Labelle; Srecko Brlek; Alexandre Blondin Massé (Theor. Comput. Sci., 2014)

Combinatorial integration (part I, part II). - Gilbert Labelle (ACM Commun. Comput. Algebra, 2015)

Classifying Discrete Structures by Their Stabilizers. - Gilbert Labelle (MC, 2019)

Probability distributions arising from isoperimetric random triangles. - Gilbert Labelle (Maple Trans., 2023)

A Combinatorial Proof of a Symmetry for a Refinement of the Narayana Numbers. - Miklós Bóna; Stoyan Dimitrov; Gilbert Labelle; Yifei Li; Joseph Pappe; Andrés R. Vindas-Meléndez; Yan Zhuang (Electron. J. Comb., 2025)