Patrice Ossona de Mendez

patrice.ossona-de-mendez@ehess.fr

Centre 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 sociales

Identifiant Orcid : 0000-0003-0724-3729 

Thèmes de recherche

  • Topological Graph theory

  • Structural Analysis of Sparse Graphs

  • Combinatorics

  • Algorithms

Publications scientifiques

Pour la liste complète voir ici ou sur ORCID.

Sélection de publications :

  • 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, “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. arXiv:1510.07788

  • 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,  AMS 2020. 117 pages.

  •  E. Bonnet, U. Giocanti, P. Ossona de Mendez, P. Simon, S. Thomassé, and S. Toruńczyk. Twin-width IV: ordered graphs and matrices. In STOC 2022: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022.

  • E. Bonnet, U. Giocanti, P. Ossona de Mendez, and S. Thomassé. Twin-width V: linear minors, modular counting, and matrix multiplication. In STACS 2023, volume 254. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023. accepted

Ouvrages

J. Nešetřil, P. Ossona de Mendez, “Sparsity (Graphs, Structures, and Algorithms)”, volume 28 of Algorithms and Combinatorics. Springer, 2012. 465 pages.

Enseignements

Sparsity: mini-course, Institut de Recherche en Informatique Fondamentale (IRIF), 2020: slides here.

Édition

Editor in Chief of European Journal of Combinatorics (Elsevier)

European Journal of Combinatorics

Tous les contenus associés

Evénement(1)

2022

Publication(1)

2012