default search action
Gilbert Labelle
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j48]Gilbert Labelle
:
Probability distributions arising from isoperimetric random triangles. Maple Trans. 3(4) (2023)
2010 – 2019
- 2019
- [c6]Gilbert Labelle
Classifying Discrete Structures by Their Stabilizers. MC 2019: 353-356 - 2015
- [j47]Gilbert Labelle:
Combinatorial integration (part I, part II). ACM Commun. Comput. Algebra 49(1): 35 (2015) - 2014
- [j46]Hugo Tremblay
Exhaustive generation of atomic combinatorial differential operators. Theor. Comput. Sci. 536: 62-69 (2014)
2000 – 2009
- 2009
- [j45]Andrei Gagarin, Gilbert Labelle, Pierre Leroux, Timothy Walsh:
Structure and enumeration of two-connected graphs with prescribed three-connected components. Adv. Appl. Math. 43(1): 46-74 (2009) - [c5]Gilbert Labelle, Annie Lacasse:
Discrete Versions of Stokes' Theorem Based on Families of Weights on Hypercubes. DGCI 2009: 229-239 - 2008
- [j44]Srecko Brlek, Gilbert Labelle, Annie Lacasse:
Shuffle operations on discrete paths. Theor. Comput. Sci. 391(1-2): 75-89 (2008) - [j43]Srecko Brlek, Gilbert Labelle, Annie Lacasse:
Discrete sets with minimal moment of inertia. Theor. Comput. Sci. 406(1-2): 31-42 (2008) - [c4]Srecko Brlek, Gilbert Labelle, Annie Lacasse:
On Minimal Moment of Inertia Polyominoes. DGCI 2008: 299-309 - 2007
- [j42]Andrei Gagarin, Gilbert Labelle, Pierre Leroux:
Counting unlabelled toroidal graphs with no K3, 3-subdivisions. Adv. Appl. Math. 39(1): 51-75 (2007) - [j41]Andrei Gagarin, Gilbert Labelle, Pierre Leroux:
The structure of K3, 3-subdivision-free toroidal graphs. Discret. Math. 307(23): 2993-3005 (2007) - [i2]Andrei Gagarin, Gilbert Labelle, Pierre Leroux, Timothy Walsh:
Two-connected graphs with prescribed three-connected components. CoRR abs/0712.1869 (2007) - 2006
- [j40]Andrei Gagarin, Gilbert Labelle, Pierre Leroux:
The structure and unlabelled enumeration of toroidal graphs with no K3, 3's. Electron. Notes Discret. Math. 24: 69-76 (2006) - [j39]Srecko Brlek, Gilbert Labelle, Annie Lacasse:
Properties of the Contour Path of Discrete Sets. Int. J. Found. Comput. Sci. 17(3): 543-556 (2006) - 2005
- [j38]Srecko Brlek, Gilbert Labelle, Annie Lacasse:
Algorithms for polyominoes based on the discrete Green theorem. Discret. Appl. Math. 147(2-3): 187-205 (2005) - [j37]Srecko Brlek, Gilbert Labelle, Annie Lacasse:
The discrete Green Theorem and some applications in discrete geometry. Theor. Comput. Sci. 346(2-3): 200-225 (2005) - [c3]Srecko Brlek, Gilbert Labelle, Annie Lacasse:
A Note on a Result of Daurat and Nivat. Developments in Language Theory 2005: 189-198 - [i1]Andrei Gagarin, Gilbert Labelle, Pierre Leroux:
Counting unlabelled toroidal graphs with no K33-subdivisions. CoRR abs/math/0509004 (2005) - 2004
- [j36]Gilbert Labelle, Cédric Lamathe:
A shifted asymmetry index series. Adv. Appl. Math. 32(3): 576-608 (2004) - [j35]Gilbert Labelle, Cédric Lamathe:
Even permutations and oriented sets: their shifted asymmetry index series. Adv. Appl. Math. 33(4): 753-769 (2004) - [j34]Gilbert Labelle, Cédric Lamathe, Pierre Leroux:
Labelled and unlabelled enumeration of k-gonal 2-trees. J. Comb. Theory A 106(2): 193-219 (2004) - 2003
- [j33]Michel Bousquet, Cédric Chauve, Gilbert Labelle, Pierre Leroux:
Two bijective proofs for the arborescent form of the Good-Lagrange formula and some applications to colored rooted trees and cacti. Theor. Comput. Sci. 307(2): 277-302 (2003) - [j32]Gilbert Labelle, Cédric Lamathe, Pierre Leroux:
A classification of plane and planar 2-trees. Theor. Comput. Sci. 307(2): 337-363 (2003) - [c2]Srecko Brlek, Gilbert Labelle, Annie Lacasse:
Incremental Algorithms Based on Discrete Green Theorem. DGCI 2003: 277-287 - 2002
- [j31]Tom Fowler, Ira M. Gessel, Gilbert Labelle, Pierre Leroux:
The Specification of 2-trees. Adv. Appl. Math. 28(2): 145-168 (2002) - [j30]Pierre Auger, Gilbert Labelle, Pierre Leroux:
Combinatorial Addition Formulas and Applications. Adv. Appl. Math. 28(3-4): 302-342 (2002) - [j29]Gilbert Labelle, Pierre Leroux, Elisa Pergola, Renzo Pinzani:
Stirling numbers interpolation using permutations with forbidden subsequences. Discret. Math. 246(1-3): 177-195 (2002) - [j28]Gilbert Labelle, Pierre Leroux:
Foreword. Discret. Math. 256(3): 523-525 (2002) - 2000
- [j27]Miklós Bóna
Enumeration of m-Ary Cacti. Adv. Appl. Math. 24(1): 22-56 (2000) - [j26]Gilbert Labelle:
Counting enriched multigraphs according to the number of their edges (or arcs). Discret. Math. 217(1-3): 237-248 (2000) - [j25]Michel Bousquet, Gilbert Labelle, Pierre Leroux:
Enumeration of planar two-face maps. Discret. Math. 222(1-3): 1-25 (2000) - [j24]Pierre Auger, Gilbert Labelle, Pierre Leroux:
Generalized Binomial Coefficients for Molecular Species. J. Comb. Theory A 91(1-2): 15-48 (2000)
1990 – 1999
- 1997
- [b1]François Bergeron, Gilbert Labelle, Pierre Leroux:
Combinatorial species and tree-like structures. Encyclopedia of mathematics and its applications 67, Cambridge University Press 1997, ISBN 978-0-521-57323-8, pp. I-XX, 1-457 - 1996
- [j23]Gilbert Labelle, Pierre Leroux:
An extension of the exponential formula in enumerative combinatorics. Electron. J. Comb. 3(2) (1996) - [j22]Hélène Décoste, Gilbert Labelle:
Le q-dénombrement générique d'une espèce: Existence et méthode de calcul. Discret. Math. 153(1-3): 59-67 (1996) - [j21]Gilbert Labelle, Louise Laforest:
Etude de constantes universelles pour les arborescences hyperquaternaires de recherche. Discret. Math. 153(1-3): 199-211 (1996) - [j20]Ivan Constantineau, Gilbert Labelle:
Une généralisation automorphe des nombres de Stirling. Discret. Math. 157(1-3): 53-64 (1996) - [j19]Gilbert Labelle, Pierre Leroux:
Enumeration of (uni- or bicolored) plane trees according to their degree distribution. Discret. Math. 157(1-3): 227-240 (1996) - 1995
- [j18]Pierre Bouchard, Yves Chiricota, Gilbert Labelle:
Arbres, arborescences et racines carrées symétriques. Discret. Math. 139(1-3): 49-56 (1995) - [j17]Gilbert Labelle, Louise Laforest:
Sur la distribution de l'arité de la racine d'une arborescence hyperquaternaire à d dimensions. Discret. Math. 139(1-3): 287-302 (1995) - [j16]Gilbert Labelle, Louise Laforest:
Combinatorial Variations on Multidimensional Quadtrees. J. Comb. Theory A 69(1): 1-16 (1995) - [j15]Gilbert Labelle, Jacques Labelle, Kathleen Pineau:
Sur une généralisation des séries indicatrices d'espèces. J. Comb. Theory A 69(1): 17-35 (1995) - [j14]Ira M. Gessel, Gilbert Labelle:
Lagrange Inversion for Species. J. Comb. Theory A 72(1): 95-117 (1995) - [j13]Gilbert Labelle:
Some Combinatorial Results First Found Using Computer Algebra. J. Symb. Comput. 20(5/6): 567-594 (1995) - [j12]Philippe Flajolet, Gilbert Labelle, Louise Laforest, Bruno Salvy
Hypergeometrics and the Cost Structure of Quadtrees. Random Struct. Algorithms 7(2): 117-144 (1995) - 1993
- [j11]Yves Chiricota, Gilbert Labelle:
Familles de solutions combinatoires de y'=1+y2 et d'équations différentielles autonomes. Discret. Math. 115(1-3): 77-93 (1993) - [j10]Gilbert Labelle:
Sur la symétrie et l'asymétrie des structures combinatoires. Theor. Comput. Sci. 117(1&2): 3-22 (1993) - 1992
- [j9]Hélène Décoste, Gilbert Labelle, Pierre Leroux:
The functorial composition of species, a forgotten operation. Discret. Math. 99(1-3): 31-48 (1992) - [j8]Gilbert Labelle:
On asymmetric structures. Discret. Math. 99(1-3): 141-164 (1992) - [j7]Gilbert Labelle:
Counting Asymmetric Enriched Trees. J. Symb. Comput. 14(2/3): 211-242 (1992) - 1991
- [j6]François Bergeron
Computation of the expected number of leaves in a tree having a given automorphism, and related topics. Discret. Appl. Math. 34(1-3): 49-66 (1991) - 1990
- [j5]Gilbert Labelle:
Dérivées directionnelles et développements de Taylor combinatoires. Discret. Math. 79(3): 279-297 (1990)
1980 – 1989
- 1989
- [j4]Gilbert Labelle:
On the generalized iterates of Yeh's combinatorial K-species. J. Comb. Theory A 50(2): 235-258 (1989) - 1988
- [c1]François Bergeron
Functional Equations for Data Structures. STACS 1988: 73-80 - 1985
- [j3]Gilbert Labelle:
Éclosions combinatoires appliquées à l'inversion multidimensionnelle des séries formelles. J. Comb. Theory A 39(1): 52-82 (1985) - [j2]Gilbert Labelle:
Une combinatoire sous-jacente au théorème des fonctions implicites. J. Comb. Theory A 40(2): 377-393 (1985) - 1980
- [j1]Gilbert Labelle:
Sur l'Inversion et l'Iteration Continue des Séries Formelles. Eur. J. Comb. 1(2): 113-138 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: