Chargé de Recherche au CNRS
Centre d’analyse et de mathématique sociales
École des hautes études en sciences sociales
54, bd Raspail 75270 Paris Cedex 06
Bureau 231 – 2e étage
Tél: +33 1 49 54 22 73 – Fax : +33 1 49 54 21 09
Topological Graph theory
Structural Analysis of Sparse Graphs
Combinatorics
Algorithms
P. Ossona de Mendez, P. Rosenstiehl, “Homomorphism and dimension”, Combinatorics, Probability and Computing 14(5-6), 2005, p. 861–872.
J. Nesetril, P. Ossona de Mendez, “Tree depth, subgraph coloring and homomorphism bounds”, European Journal of Combinatorics 27(6), 2006, p. 1022–1041.
H. de Fraysseix, P. Ossona de Mendez, “Barycentric systems and stretchability”, Discrete Applied Mathematics 155(9), 2007, p. 1079–1095.
H. de Fraysseix, P. Ossona de Mendez, “On representations by contact and intersection of segments”, Algorithmica 47(4), 2007, p. 453–463.
J. Nesetril, P. Ossona de Mendez, “Grad and classes with bounded expansion I. Decompositions”, European Journal of Combinatorics 29(3), 2008, p. 760–776.
J. Nesetril, P. Ossona de Mendez, “Grad and classes with bounded expansion II. algorithmic aspects”, European Journal of Combinatorics 29(3), 2008, p. 777–791.
J. Nesetril, P. Ossona de Mendez, “Grad and classes with bounded expansion III. restricted graph homomorphism dualities”, European Journal of Combinatorics 29(4), 2008, p. 1012–1024.
Dernière mise à jour : 5 février 2010