Dominique Gouyou-Beauchamps

Publication Activity (10 Years)

Years Active: 1975-2011
Publications (10 Years): 0

Publications

Arvind Ayyer, Robert Cori, Dominique Gouyou-Beauchamps
Monotone Triangles and 312 Pattern Avoidance. Electron. J. Comb. 18 (2) (2011)
Dominique Gouyou-Beauchamps, Pierre Leroux
Enumeration of symmetry classes of convex polyominoes on the honeycomb lattice. Theor. Comput. Sci. 346 (2-3) (2005)
Cyril Banderier, Philippe Flajolet, Danièle Gardy, Mireille Bousquet-Mélou, Alain Denise, Dominique Gouyou-Beauchamps
Generating functions for generating trees CoRR (2004)
Cyril Banderier, Mireille Bousquet-Mélou, Alain Denise, Philippe Flajolet, Danièle Gardy, Dominique Gouyou-Beauchamps
Generating functions for generating trees. Discret. Math. 246 (1-3) (2002)
Sylvie Corteel, Dominique Gouyou-Beauchamps
Enumeration of sand piles. Discret. Math. 256 (3) (2002)
Seul Hee Choi, Dominique Gouyou-Beauchamps
Enumeration of Generalized Young Tableaux With Bounded Height. Theor. Comput. Sci. 117 (1&2) (1993)
Danièle Gardy, Dominique Gouyou-Beauchamps
Enumerating Davenport-Schinzel sequences. RAIRO Theor. Informatics Appl. 26 (1992)
Serge Dulucq, Dominique Gouyou-Beauchamps
Sur les Facteurs des Suites de Sturm. Theor. Comput. Sci. 71 (3) (1990)
Dominique Gouyou-Beauchamps
Standard Young Tableaux of Height 4 and 5. Eur. J. Comb. 10 (1) (1989)
Dominique Gouyou-Beauchamps, Bernard Vauquelin
Deux Propriétés Combinatoires Des Nombres De Schröder. RAIRO Theor. Informatics Appl. 22 (3) (1988)
Marie-Pierre Delest, Dominique Gouyou-Beauchamps, Bernard Vauquelin
Enumeration of parallelogram polyominoes with given bond and site perimeter. Graphs Comb. 3 (1) (1987)
Dominique Gouyou-Beauchamps
The Hamiltonian Circuit Problem is Polynomial for 4-Connected Planar Graphs. SIAM J. Comput. 11 (3) (1982)
Dominique Gouyou-Beauchamps
Sur un résultat récent de Laurent Chottin. CLAAP (1980)
Dominique Gouyou-Beauchamps
Deux Proprietes Combinatoires du Langage de Lukasiewicz. RAIRO Theor. Informatics Appl. 9 (3) (1975)