Stéphan Ceroi

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

	2004
j6		Stéphan Ceroi, Frédéric Havet: Trees with three leaves are (n+1)-unavoidable. Discrete Applied Mathematics 141(1-3): 19-39 (2004)
	2003
j5		Jean-Claude Bermond, Stéphan Ceroi: Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3. Networks 41(2): 83-86 (2003)
j4		Stéphan Ceroi: A Weighted Version of the Jump Number Problem on Two-Dimensional Orders is NP-Complete. Order 20(1): 1-11 (2003)
	2002
j3		Pierre Manches, Stéphan Ceroi: Spin Models, Association Schemes and the Nakanishi-Montesinos Conjecture. Eur. J. Comb. 23(7): 833-844 (2002)
	2001
j2		Stéphan Ceroi, Frédéric Havet: Trees with three leaves are (n + l)-unavoidable. Electronic Notes in Discrete Mathematics 7: 202-205 (2001)
j1		Stéphan Ceroi: Clique number and ball containment number of unit ball graphs. Electronic Notes in Discrete Mathematics 8: 22-25 (2001)

Coauthor Index

Last update Thu May 23 13:35:00 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page