Clique number and ball containment number of unit ball graphs. - Stéphan Ceroi (Electron. Notes Discret. Math., 2001)

Trees with three leaves are (n + l)-unavoidable. - Stéphan Ceroi; Frédéric Havet (Electron. Notes Discret. Math., 2001)

Spin Models, Association Schemes and the Nakanishi-Montesinos Conjecture. - Pierre Manches; Stéphan Ceroi (Eur. J. Comb., 2002)

Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3. - Jean-Claude Bermond; Stéphan Ceroi (Networks, 2003)

A Weighted Version of the Jump Number Problem on Two-Dimensional Orders is NP-Complete. - Stéphan Ceroi (Order, 2003)

Trees with three leaves are (n+1)-unavoidable. - Stéphan Ceroi; Frédéric Havet (Discret. Appl. Math., 2004)