Gilbert Labelle

Orcid: 0000-0003-0281-000X

According to our database1, Gilbert Labelle authored at least 57 papers between 1980 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Probability distributions arising from isoperimetric random triangles.
Maple Trans., 2023

2019
Classifying Discrete Structures by Their Stabilizers.
Proceedings of the Maple in Mathematics Education and Research - Third Maple Conference, 2019

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

2014
Exhaustive generation of atomic combinatorial differential operators.
Theor. Comput. Sci., 2014

2009
Structure and enumeration of two-connected graphs with prescribed three-connected components.
Adv. Appl. Math., 2009

Discrete Versions of Stokes' Theorem Based on Families of Weights on Hypercubes.
Proceedings of the Discrete Geometry for Computer Imagery, 2009

2008
Discrete sets with minimal moment of inertia.
Theor. Comput. Sci., 2008

Shuffle operations on discrete paths.
Theor. Comput. Sci., 2008

On Minimal Moment of Inertia Polyominoes.
Proceedings of the Discrete Geometry for Computer Imagery, 2008

2007
The structure of K<sub>3, 3</sub>-subdivision-free toroidal graphs.
Discret. Math., 2007

Two-connected graphs with prescribed three-connected components.
CoRR, 2007

Counting unlabelled toroidal graphs with no K3, 3-subdivisions.
Adv. Appl. Math., 2007

2006
Properties of the Contour Path of Discrete Sets.
Int. J. Found. Comput. Sci., 2006

The structure and unlabelled enumeration of toroidal graphs with no K<sub>3, 3</sub>'s.
Electron. Notes Discret. Math., 2006

2005
The discrete Green Theorem and some applications in discrete geometry.
Theor. Comput. Sci., 2005

Algorithms for polyominoes based on the discrete Green theorem.
Discret. Appl. Math., 2005

Counting unlabelled toroidal graphs with no K33-subdivisions.
CoRR, 2005

A Note on a Result of Daurat and Nivat.
Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2004
Labelled and unlabelled enumeration of k-gonal 2-trees.
J. Comb. Theory, Ser. A, 2004

Even permutations and oriented sets: their shifted asymmetry index series.
Adv. Appl. Math., 2004

A shifted asymmetry index series.
Adv. Appl. Math., 2004

2003
A classification of plane and planar 2-trees.
Theor. Comput. Sci., 2003

Two bijective proofs for the arborescent form of the Good-Lagrange formula and some applications to colored rooted trees and cacti.
Theor. Comput. Sci., 2003

Incremental Algorithms Based on Discrete Green Theorem.
Proceedings of the Discrete Geometry for Computer Imagery, 11th International Conference, 2003

2002
Stirling numbers interpolation using permutations with forbidden subsequences.
Discret. Math., 2002

Foreword.
Discret. Math., 2002

The Specification of 2-trees.
Adv. Appl. Math., 2002

Combinatorial Addition Formulas and Applications.
Adv. Appl. Math., 2002

2000
Generalized Binomial Coefficients for Molecular Species.
J. Comb. Theory, Ser. A, 2000

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

Enumeration of planar two-face maps.
Discret. Math., 2000

Enumeration of <i>m</i>-Ary Cacti.
Adv. Appl. Math., 2000

1997
Combinatorial species and tree-like structures.
Encyclopedia of mathematics and its applications 67, Cambridge University Press, ISBN: 978-0-521-57323-8, 1997

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

Etude de constantes universelles pour les arborescences hyperquaternaires de recherche.
Discret. Math., 1996

Le q-dénombrement générique d'une espèce: Existence et méthode de calcul.
Discret. Math., 1996

Une généralisation automorphe des nombres de Stirling.
Discret. Math., 1996

An extension of the exponential formula in enumerative combinatorics.
Electron. J. Comb., 1996

1995
Hypergeometrics and the Cost Structure of Quadtrees.
Random Struct. Algorithms, 1995

Some Combinatorial Results First Found Using Computer Algebra.
J. Symb. Comput., 1995

Sur une généralisation des séries indicatrices d'espèces.
J. Comb. Theory, Ser. A, 1995

Combinatorial Variations on Multidimensional Quadtrees.
J. Comb. Theory, Ser. A, 1995

Lagrange Inversion for Species.
J. Comb. Theory, Ser. A, 1995

Sur la distribution de l'arité de la racine d'une arborescence hyperquaternaire à d dimensions.
Discret. Math., 1995

Arbres, arborescences et racines carrées symétriques.
Discret. Math., 1995

1993
Sur la symétrie et l'asymétrie des structures combinatoires.
Theor. Comput. Sci., 1993

Familles de solutions combinatoires de y'=1+y<sup>2</sup> et d'équations différentielles autonomes.
Discret. Math., 1993

1992
Counting Asymmetric Enriched Trees.
J. Symb. Comput., 1992

On asymmetric structures.
Discret. Math., 1992

The functorial composition of species, a forgotten operation.
Discret. Math., 1992

1991
Computation of the expected number of leaves in a tree having a given automorphism, and related topics.
Discret. Appl. Math., 1991

1990
Dérivées directionnelles et développements de Taylor combinatoires.
Discret. Math., 1990

1989
On the generalized iterates of Yeh's combinatorial K-species.
J. Comb. Theory, Ser. A, 1989

1988
Functional Equations for Data Structures.
Proceedings of the STACS 88, 1988

1985
Éclosions combinatoires appliquées à l'inversion multidimensionnelle des séries formelles.
J. Comb. Theory, Ser. A, 1985

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

1980
Sur l'Inversion et l'Iteration Continue des Séries Formelles.
Eur. J. Comb., 1980


  Loading...