|
MASCOTTE no longer exists => visit the new project-team
Publications of J.S. Sereni
BACK TO MASCOTTE PUBLICATION INDEX
Publications of J.S. Sereni
-
J.-S. Sereni.
Colorations de graphes et applications.
PhD thesis,
École doctorale STIC, Université de Nice-Sophia Antipolis,
Juillet 2006.
[bibtex-entry]
-
F. Havet,
B. Reed,
and J.-S. Sereni.
Griggs and Yeh's conjecture and $L(p,1)$-labellings.
SIAM Journal on Discrete Mathematics,
26(1):145-168,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert and J-S. Sereni.
Characterization of graphs and digraphs with small process number.
Discrete Applied Mathematics (DAM),
159(11):1094-1109,
July 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Havet,
D. Král,
J.-S. Sereni,
and R. Skrekovski.
Facial coloring using Hall's theorems.
European Journal of Combinatorics,
31:1001--1019,
2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
R. Correa,
F. Havet,
and J-S. Sereni.
About a Brooks-type theorem for improper colouring.
Australasian Journal of Combinatorics,
43:219--230,
2009.
[PDF
] [Abstract] [bibtex-entry]
-
F. Havet,
R. Kang,
T. Müller,
and J.-S. Sereni.
Circular choosability.
Journal of Graph Theory,
61(4):241--334,
2009.
[PDF
] [Abstract] [bibtex-entry]
-
F. Havet,
R. Kang,
and J.-S. Sereni.
Improper Colouring of Unit Disk Graphs.
Networks,
54(3):150--164,
2009.
[Abstract] [bibtex-entry]
-
F. Havet,
J.-S. Sereni,
and R. Skrekovski.
3-facial colouring of plane graphs.
SIAM Journal on Discrete Mathematics,
22(1):231--247,
2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
R. J. Kang,
T. Müller,
and J.-S. Sereni.
Improper colouring of (random) unit disk graphs.
Discrete Mathematics,
308:1438--1454,
April 2008.
Note: The Special Issue devoted to EuroComb 2005.
[PDF
] [bibtex-entry]
-
R. Bayon,
N. Lygeros,
and J.-S. Sereni.
Orders with ten elements are circle orders.
Applied Mathematics E-Notes,
7:16--22,
2007.
[WWW
] [PDF
] [bibtex-entry]
-
D. Coudert,
F. Huc,
and J.-S. Sereni.
Pathwidth of outerplanar graphs.
Journal of Graph Theory,
55(1):27-41,
May 2007.
[PDF
] [Abstract] [bibtex-entry]
-
F. Havet and J.-S. Sereni.
Improper choosability of graphs and maximum average degree.
Journal of Graph Theory,
52(3):181--199,
2006.
[PDF
] [bibtex-entry]
-
R. Bayon,
N. Lygeros,
and J.-S. Sereni.
New progress in enumeration of mixed models.
Applied Mathematics E-Notes,
5:60--65,
2005.
[WWW
] [PDF
] [bibtex-entry]
-
D. Coudert,
F. Huc,
D. Mazauric,
N. Nisse,
and J-S. Sereni.
Reconfiguration dans les réseaux optiques.
In A. Chaintreau and C. Magnien, editors,
11ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'09),
Carry le Rouet,
pages 4p,
June 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
F. Huc,
D. Mazauric,
N. Nisse,
and J-S. Sereni.
Reconfiguration of the Routing in WDM Networks with Two Classes of Services.
In 13th Conference on Optical Network Design and Modeling (ONDM),
Braunschweig, Germany,
pages 6p,
February 2009.
IEEE.
[WWW
] [Abstract] [bibtex-entry]
-
L. Addario-Berry,
O. Amini,
J.-S. Sereni,
and S. Thomassé.
Guarding art galleries: the extra cost for sculptures is linear.
In Proceedings of the Scandinavian Workshop on Algorithm Theory (SWAT 2008),
volume 5124 of Lecture Notes in Computer Science,
pages 41-52,
July 2008.
Springer.
[bibtex-entry]
-
F. Havet,
B. Reed,
and J.-S. Sereni.
L(2,1)-labelling of graphs.
In Proceedings of the ACM-SIAM Symposium on Discrete Algorithm (SODA 2008),
pages 621-630,
January 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
S. Bessy,
N. Lichiardopol,
and J.-S. Sereni.
Two proofs of Bermond-Thomassen conjecture for regular tournaments.
In Proceedings of the sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications,
volume 28 of Electronic Notes in Discrete Mathematics,
pages 47--53,
2007.
Elsevier.
[WWW
] [PDF
] [bibtex-entry]
-
R. Bayon,
N. Lygeros,
and J.-S. Sereni.
Orders with ten elements are circle orders.
In Book of abstracts of the nineteenth Panhellenic Conference/Summer School on nonlinear science and complexity,
Thessaloniki,
pages 1p,
July 2006.
[WWW
] [PDF
] [bibtex-entry]
-
D. Coudert,
S. Perennes,
Q-C. Pham,
and J-S. Sereni.
Rerouting requests in WDM networks.
In AlgoTel'05,
Presqu'île de Giens, France,
pages 17-20,
mai 2005.
[PDF
] [Abstract] [bibtex-entry]
-
F. Havet,
R. J. Kang,
and J.-S. Sereni.
Improper colouring of unit disk graphs.
In Proceedings of the 7th International Conference on Graph Theory (ICGT'05),
volume 22 of Electronic Notes in Discrete Mathematics,
pages 123--128,
September 2005.
Elsevier.
[WWW
] [PDF
] [bibtex-entry]
-
F. Havet and J.-S. Sereni.
Channel assignment and improper choosability of graphs.
In Proceedings of the 31st Workshop on Graph-Theoretic Concepts in Computer Science (WG'05),
volume 3787 of Lecture Notes in Computer Science,
pages 81--90,
June 2005.
Springer Verlag.
[WWW
] [PDF
] [bibtex-entry]
-
R. J. Kang,
T. Müller,
and J.-S. Sereni.
Improper colouring of (random) unit disk graphs.
In Proceedings of European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2005),
Discrete Mathematics and Theoretical Computer Science,
pages 193--198,
September 2005.
[WWW
] [PDF
] [bibtex-entry]
-
R. Bayon,
N. Lygeros,
and J.-S. Sereni.
Nouveaux progrès dans l'énumération des modèles mixtes.
In Knowledge discovery and discrete mathematics : JIM'2003,
Université de Metz, France,
pages 243--246,
2003.
INRIA.
[WWW
] [PDF
] [bibtex-entry]
-
R. Correa,
F. Havet,
and J.-S. Sereni.
About a Brooks-type theorem for improper colouring.
Research Report RR-6432,
INRIA,
January 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
F. Huc,
D. Mazauric,
N. Nisse,
and J-S. Sereni.
Routing Reconfiguration/Process Number: Coping wih Two Classes of Services.
Research Report RR-6698,
INRIA,
October 2008.
[WWW
] [Abstract] [bibtex-entry]
-
F. Havet,
D. Král,
J.-S. Sereni,
and R. Skrekovski.
Facial coloring using Hall's Theorem.
Research Report 383,
ITI-series,
2008.
[PDF
] [Abstract] [bibtex-entry]
-
F. Havet,
B. Reed,
and J.-S. Sereni.
$L(p,1)$-labelling of graphs.
Research Report RR-6673,
INRIA,
October 2008.
[PDF
] [Abstract] [bibtex-entry]
-
D. Coudert and J-S. Sereni.
Characterization of graphs and digraphs with small process number.
Research Report 6285,
INRIA,
September 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Havet,
R. Kang,
and J.-S. Sereni.
Improper colouring of unit disk graphs.
Research Report 6206,
INRIA,
May 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
F. Huc,
and J.S. Sereni.
Pathwidth of outerplanar graphs.
Technical report,
INRIA Research Report 5804 and I3S Research Report I3S/RR-2006-02-FR,
January 2006.
[WWW
] [PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
F. Havet,
R. J. Kang,
T. Müller,
and J.-S. Sereni.
Circular Choosability.
Research report,
INRIA Research Report 5957 and I3S Research Report I3S/RR-2006-21-FR,
July 2006.
Note: Submitted to Journal of Graph Theory.
[WWW
] [PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
F. Havet,
J.-S. Sereni,
and R. Skrekovski.
3-facial colouring of plane graphs.
Research report,
INRIA Research Report 5943 and I3S Research Report I3S/RR-2006-20-FR,
July 2006.
Note: Submitted to SIAM Journal on Discrete Mathematics.
[WWW
] [PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
R. J. Kang,
T. Müller,
and J.-S. Sereni.
Improper colouring of (random) unit disk graphs.
Research report,
INRIA Research Report 5761 and I3S Research Report I3S/RR-2005-35-FR,
November 2005.
[WWW
] [PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
F. Havet and J.-S. Sereni.
Improper choosability of graphs and maximum average degree.
Research report,
INRIA Research Report 5164 and I3S Research Report I3S/RR-2004-11-FR,
April 2004.
[WWW
] [PDF
] [POSTSCRIPT
] [bibtex-entry]
BACK TO MASCOTTE PUBLICATION INDEX
Last modified: Thu Oct 10 14:10:02 2013
This document was translated from BibTEX by
bibtex2html
|
