Limits of Order Types(PDF — LIPIcs — BibTeX)
(Avec X. Goaoc, A. Hubard, R. de Joannis de Verclos et J. Volec)
In Proceedings of the 29th ACM Symposium on Computational Geometry (SoCG), pp. 600--614, 2015.

Subcubic triangle-free graphs have fractional chromatic number at most 14/5
(Avec Z. Dvořák et J. Volec)
In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2013), CRM Series 16, pages 497--502, 2013.

Collaborative Search on the Plane without Communication(PDF — ACM — BibTeX)
(Avec O. Feinerman, A. Korman et Z. Lotker)
In Proceedings of the 31th ACM Symposium on Principles in Distributing Computing (PODC), pages 77--86, 2012.

Toward more Localized Local Algorithms: Removing Assumptions concerning Global Knowledge(PDF — ACM — PODCcast — BibTeX)
(Avec A. Korman et L. Viennot)
In Proceedings of the 30th ACM Symposium on Principles in Distributing Computing (PODC), pages 49--58, 2011.

Circular edge-colorings of cubic graphs with girth six(PDF — BibTex)
(Avec D. Král', E. Máčajová et J. Mazák)
In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009), volume 34 of Electronic Notes in Discrete Mathematics, pages 525-529, September 2009. Elsevier.

Reconfiguration dans les réseaux optiques(PDF — BibTeX)
(Avec D. Coudert, F. Huc, D. Mazauric et N. Nisse)
In Onzièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'09), Carry-Le-Rouet, pages 25--28, June 2009.

Reconfiguration of the routing in WDM networks with two classes of services(PDF — BibTeX)
(Avec D. Coudert, F. Huc, D. Mazauric et N. Nisse)
In Proceedings of the 13th International Conference on Optical Networking Design and Modeling (ONDM 2009), IEEEXplore, February 2009.

Guarding art galleries: the extra cost for sculptures is linear(PDF — BibTeX)
(Avec L. Addario-Berry, O. Amini et S. Thomassé)
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 Berlin / Heidelberg.

L(2,1)-labelling of graphs(PDF — BibTeX)
(Avec F. Havet et B. Reed)
In Proceedings of the ACM-SIAM Symposium on Discrete Algorithm (SODA 2008), pages 621--630, January 2008. Society for Industrial and Applied Mathematics.

Characterization of affine Steiner triple systems and Hall triple systems(PDF — BibTeX)
(Avec D. Král', E. Máčajová et A. Pór)
In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2007), volume 29 of Electronic Notes in Discrete Mathematics, pages 17--21, September 2007. Elsevier.

Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems(PDF — BibTeX)
(Avec D. Král', E. Máčajová et A. Pór)
In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2007), volume 29 of Electronic Notes in Discrete Mathematics, pages 23--27, September 2007. Elsevier.

Orders with ten elements are circle orders(PDF — BibTeX)
(Avec R. Bayon et N. Lygeros)
In Book of abstracts of the nineteenth Panhellenic Conference/Summer School on nonlinear science and complexity, Thessaloniki, July 2006.

Two proofs of Bermond-Thomassen conjecture for regular tournaments(PDF — BibTeX)
(Avec S. Bessy et N. Lichiardopol)
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, July 2006. Elsevier.

Improper colouring of unit disk graphs(PDF — BibTeX)
(Avec F. Havet et R. J. Kang)
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.

Improper colouring of (random) unit disk graphs(PDF — BibTeX)
(Avec R. J. Kang et T. Müller)
In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2005), Discrete Mathematics and Theoretical Computer Science, pages 193--198, September 2005.

Channel assignment and improper choosability of graphs(PDF — BibTeX)
(Avec F. Havet)
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 Berlin / Heidelberg.

Rerouting requests in WDM networks(PDF — BibTeX)
(Avec D. Coudert, S. Pérennes et Q.-C. Pham)
In Septièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'05), Presqu'île de Giens, pages 17--20, May 2005.

Nouveaux progrès dans l'énumération des modèles mixtes(PDF — BibTeX)
(Avec R. Bayon et N. Lygeros)
In Knowledge discovery and discrete mathematics (JIM 2003), Université de Metz, France, pages 243--246, September 2003. INRIA.