The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Pierre Leroux: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. François Bergeron, Gilbert Labelle, Pierre Leroux
    Functional Equations for Data Structures. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:73-80 [Conf]
  2. Gilbert Labelle, Pierre Leroux
    An extension of the exponential formula in enumerative combinatorics. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1996, v:3, n:2, pp:- [Journal]
  3. Pierre Leroux
    Enumerative Problems Inspired by Mayer's Theory of Cluster Integrals. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal]
  4. Michel Bousquet, Gilbert Labelle, Pierre Leroux
    Enumeration of planar two-face maps. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:1-25 [Journal]
  5. Gilbert Labelle, Pierre Leroux
    Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:3, pp:523-525 [Journal]
  6. Gilbert Labelle, Pierre Leroux, Elisa Pergola, Renzo Pinzani
    Stirling numbers interpolation using permutations with forbidden subsequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:246, n:1-3, pp:177-195 [Journal]
  7. Pierre Auger, Gilbert Labelle, Pierre Leroux
    Generalized Binomial Coefficients for Molecular Species. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2000, v:91, n:1-2, pp:15-48 [Journal]
  8. 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. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1980, v:28, n:2, pp:169-190 [Journal]
  9. Gilbert Labelle, Cédric Lamathe, Pierre Leroux
    Labelled and unlabelled enumeration of k-gonal 2-trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2004, v:106, n:2, pp:193-219 [Journal]
  10. Pierre Leroux
    Reduced matrices and q-log-concavity properties of q-Stirling numbers. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1990, v:54, n:1, pp:64-84 [Journal]
  11. Michel Bousquet, Cedric 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:307, n:2, pp:277-302 [Journal]
  12. Dominique Gouyou-Beauchamps, Pierre Leroux
    Enumeration of symmetry classes of convex polyominoes on the honeycomb lattice. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:346, n:2-3, pp:307-334 [Journal]
  13. Gilbert Labelle, Cédric Lamathe, Pierre Leroux
    A classification of plane and planar 2-trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:307, n:2, pp:337-363 [Journal]
  14. Pierre Leroux, Xavier Gérard Viennot
    A Combinatorial Approach to Nonlinear Functional Expansions: An Introduction with an Example. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:79, n:1, pp:179-193 [Journal]
  15. Pierre Leroux, Volker Strehl
    Jacobi polynomials: Combinatorics of the basic identities. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:57, n:1-2, pp:167-187 [Journal]
  16. Pierre Leroux, Xavier Gérard Viennot
    Combinatorial resolution of systems of differential equations. IV. separation of variables. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:237-250 [Journal]
  17. Hélène Décoste, Gilbert Labelle, Pierre Leroux
    The functorial composition of species, a forgotten operation. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:99, n:1-3, pp:31-48 [Journal]
  18. Gilbert Labelle, Pierre Leroux
    Enumeration of (uni- or bicolored) plane trees according to their degree distribution. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:157, n:1-3, pp:227-240 [Journal]
  19. Pierre Leroux, Christophe Reutenauer
    Foreword/Avant-propos. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:139, n:1-3, pp:1- [Journal]

  20. Computation of the expected number of leaves in a tree having a given automorphism, and related topics. [Citation Graph (, )][DBLP]


  21. The structure of K3, 3-subdivision-free toroidal graphs. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002