Patrice Ossona de Mendez
patrice.ossona-de-mendez@ehess.frCentre d’analyse et de mathématique sociales
École des hautes études en sciences sociales
54, boulevard Raspail – 75006 Paris – France
Bureau A4-31 – 4e étage
Tél: +33 1 49 54 22 73 – Fax : +33 1 49 54 21 09
Chercheur.e statutaire
Chargé de recherche au CNRS, HDR Centre d'analyse et de mathématique socialesIdentifiant Orcid : 0000-0003-0724-3729
Thèmes de recherche
-
Topological Graph theory
-
Structural Analysis of Sparse Graphs
-
Combinatorics
-
Algorithms
Publications scientifiques
-
J. Nešetřil, P. Ossona de Mendez,“Linear time low tree-width partitions and algorithmic consequences”, in STOC’06. Proceedings of the 38thAnnual ACM Symposium on Theory of Computing, p. 391–400. ACM Press, 2006.2.
-
J. Nešetřil, P. Ossona de Mendez,“Sparse combinatorial structures: Classification and applications”. In R. Bhatia and A. Pal, editors, Proceedings of the International Congress of Mathematicians 2010 (ICM 2010), volume IV, pages 2502–2529, Hyderabad, India, 2010. World Scientific.
-
J. Nešetřil, P. Ossona de Mendez, “Sparsity (Graphs, Structures, and Algorithms)”, volume 28 of Algorithms and Combinatorics. Springer, 2012. 465 pages.
-
J. Nešetřil, P. Ossona de Mendez, “Structural sparsity”. Uspekhi Matematicheskikh Nauk, 71(1):85–116, 2016. (Russian Math. Surveys 71:1 79-107).
-
J. Nešetřil, P. Ossona de Mendez, “Cluster analysis of local convergent sequences of structures”. Random Structures & Algorithms, 2017. available online.
-
J. Nešetřil, P. Ossona de Mendez, “A unified approach to structural limits (with application to the study of limits of graphs with bounded tree-depth)”. Memoirs of the American Mathematical Society, 2017. accepted.
Enseignements
Sparsity: mini-course, Institut de Recherche en Informatique Fondamentale (IRIF), 2020: slides here.
Édition
Editor in Chief of European Journal of Combinatorics (Elsevier)
