1. Basic analytic combinatorics of directed lattice paths;Banderier;Theoret. Comput. Sci.,2002
2. Generating functions for generating trees;Banderier;Discrete Math.,2002
3. M. Bardet, J.-C. Faugère, B. Salvy, On the complexity of Gröbner basis computation of semi-regular overdetermined algebraic equations, in: International Conference on Polynomial System Solving, Proceedings of a conference held in Paris, France, in honor of Daniel Lazard, November 2004, pp. 71–74
4. Algorithms in Real Algebraic Geometry;Basu,2003
5. The number of degree-restricted rooted maps on the sphere;Bender;SIAM J. Discrete Math.,1994