default search action
Pierre Leroux
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [j26]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) - 2007
- [j25]Andrei Gagarin, Gilbert Labelle, Pierre Leroux:
Counting unlabelled toroidal graphs with no K3, 3-subdivisions. Adv. Appl. Math. 39(1): 51-75 (2007) - [j24]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
- [j23]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) - 2005
- [j22]Dominique Gouyou-Beauchamps, Pierre Leroux:
Enumeration of symmetry classes of convex polyominoes on the honeycomb lattice. Theor. Comput. Sci. 346(2-3): 307-334 (2005) - [i1]Andrei Gagarin, Gilbert Labelle, Pierre Leroux:
Counting unlabelled toroidal graphs with no K33-subdivisions. CoRR abs/math/0509004 (2005) - 2004
- [j21]Pierre Leroux:
Enumerative Problems Inspired by Mayer's Theory of Cluster Integrals. Electron. J. Comb. 11(1) (2004) - [j20]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
- [j19]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) - [j18]Gilbert Labelle, Cédric Lamathe, Pierre Leroux:
A classification of plane and planar 2-trees. Theor. Comput. Sci. 307(2): 337-363 (2003) - 2002
- [j17]Tom Fowler, Ira M. Gessel, Gilbert Labelle, Pierre Leroux:
The Specification of 2-trees. Adv. Appl. Math. 28(2): 145-168 (2002) - [j16]Pierre Auger, Gilbert Labelle, Pierre Leroux:
Combinatorial Addition Formulas and Applications. Adv. Appl. Math. 28(3-4): 302-342 (2002) - [j15]Gilbert Labelle, Pierre Leroux, Elisa Pergola, Renzo Pinzani:
Stirling numbers interpolation using permutations with forbidden subsequences. Discret. Math. 246(1-3): 177-195 (2002) - [j14]Gilbert Labelle, Pierre Leroux:
Foreword. Discret. Math. 256(3): 523-525 (2002) - 2000
- [j13]Miklós Bóna
, Michel Bousquet, Gilbert Labelle, Pierre Leroux:
Enumeration of m-Ary Cacti. Adv. Appl. Math. 24(1): 22-56 (2000) - [j12]Michel Bousquet, Gilbert Labelle, Pierre Leroux:
Enumeration of planar two-face maps. Discret. Math. 222(1-3): 1-25 (2000) - [j11]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
- [j10]Gilbert Labelle, Pierre Leroux:
An extension of the exponential formula in enumerative combinatorics. Electron. J. Comb. 3(2) (1996) - [j9]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
- [j8]Pierre Leroux, Christophe Reutenauer:
Foreword/Avant-propos. Discret. Math. 139(1-3): 1 (1995) - 1992
- [j7]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) - 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) - [j5]Pierre Leroux, Xavier Gérard Viennot:
A Combinatorial Approach to Nonlinear Functional Expansions: An Introduction with an Example. Theor. Comput. Sci. 79(1): 179-193 (1991) - 1990
- [j4]Pierre Leroux:
Reduced matrices and q-log-concavity properties of q-Stirling numbers. J. Comb. Theory A 54(1): 64-84 (1990)
1980 – 1989
- 1988
- [j3]Pierre Leroux, Xavier Gérard Viennot:
Combinatorial resolution of systems of differential equations. IV. separation of variables. Discret. Math. 72(1-3): 237-250 (1988) - [c1]François Bergeron
Functional Equations for Data Structures. STACS 1988: 73-80 - 1985
- [j2]Pierre Leroux, Volker Strehl:
Jacobi polynomials: Combinatorics of the basic identities. Discret. Math. 57(1-2): 167-187 (1985) - 1980
- [j1]Mireille Content, François Lemay, Pierre Leroux:
Catégories de Möbius et fonctorialités: un cadre général pour I'inversioin de Möbius. J. Comb. Theory A 28(2): 169-190 (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 2025-01-21 00:13 CET 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: