2008 |
11 | EE | Florent Hivert,
Jean-Christophe Novelli,
Jean-Yves Thibon:
Trees, functional equations, and combinatorial Hopf algebras.
Eur. J. Comb. 29(7): 1682-1695 (2008) |
2005 |
10 | EE | Florent Hivert,
Jean-Christophe Novelli,
Jean-Yves Thibon:
The algebra of binary search trees.
Theor. Comput. Sci. 339(1): 129-165 (2005) |
2002 |
9 | EE | Fedor V. Fomin,
Dieter Kratsch,
Jean-Christophe Novelli:
Approximating minimum cocolorings.
Inf. Process. Lett. 84(5): 285-290 (2002) |
2001 |
8 | EE | François Boulier,
Florent Hivert,
Daniel Krob,
Jean-Christophe Novelli:
Pseudo-Permutations II: Geometry and Representation Theory.
DM-CCG 2001: 123-132 |
7 | EE | Jean-Christophe Novelli,
Dominique Rossin:
On the Toppling of a Sand Pile.
DM-CCG 2001: 275-286 |
6 | EE | Fedor V. Fomin,
Dieter Kratsch,
Jean-Christophe Novelli:
Approximating Minimum Cocolourings.
FCT 2001: 118-125 |
5 | EE | Julien Cassaigne,
Marc Espie,
Daniel Krob,
Jean-Christophe Novelli,
Florent Hivert:
The Chinese Monoid.
IJAC 11(3): 301-334 (2001) |
4 | | Jean-Christophe Novelli,
Gilles Schaeffer,
Florent Hivert:
Approximation of a Direction of Nd in Bounded Coordinates.
MONET 6(6): 547-550 (2001) |
2000 |
3 | EE | Jean-Christophe Novelli:
On the hypoplactic monoid.
Discrete Mathematics 217(1-3): 315-336 (2000) |
1999 |
2 | EE | Joël-Yann Fourré,
Daniel Krob,
Jean-Christophe Novelli:
On Extremal Permutations Avoiding omegaN = NN- 1 . . . 1.
Eur. J. Comb. 20(8): 773-787 (1999) |
1997 |
1 | EE | Jean-Christophe Novelli,
Igor Pak,
Alexander V. Stoyanovskii:
A direct bijective proof of the hook-length formula.
Discrete Mathematics & Theoretical Computer Science 1(1): 53-67 (1997) |