Skip to Main content

Researcher identifiers

Number of documents

111

Publications


Journal articles64 documents

  • Jan Dreier, Jakub Gajarský, Yiting Jiang, Patrice Ossona de Mendez, Jean-Florent Raymond. Twin-width and generalized coloring numbers. Discrete Mathematics, Elsevier, 2022, 345 (3), pp.112746. ⟨10.1016/j.disc.2021.112746⟩. ⟨hal-03469918⟩
  • Yiting Jiang, Jaroslav Nešetřil, Patrice Ossona de Mendez. From χ to χp-bounded classes. Journal of Combinatorial Theory, Series B, Elsevier, 2021, ⟨10.1016/j.jctb.2021.05.006⟩. ⟨hal-03373528⟩
  • Jaroslav Nešetřil, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz. Classes of graphs with low complexity: The case of classes with bounded linear rankwidth. European Journal of Combinatorics, Elsevier, 2021, 91, pp.103223. ⟨10.1016/j.ejc.2020.103223⟩. ⟨hal-03039318⟩
  • Jan Dreier, Jakub Gajarsky, Yiting Jiang, Patrice Ossona de Mendez, Jean-Florent Raymond. Twin-width and generalized coloring numbers. Discrete Mathematics, Elsevier, In press. ⟨hal-03450765⟩
  • Yuchao Jiang, J. Nešetřil, Patrice Ossona de Mendez, S. Siebertz. Regular partitions of gentle graphs. Acta Mathematica Hungarica, Springer Verlag, 2020, 161, pp.719-755. ⟨10.1007/s10474-020-01074-x⟩. ⟨hal-02905597⟩
  • Jaroslav Nešetřil, Patrice Ossona de Mendez. A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth. Memoirs of the American Mathematical Society, American Mathematical Society, 2020, 263 (1272), ⟨10.1090/memo/1272⟩. ⟨hal-02901299⟩
  • Patrice Ossona de Mendez, Jakub Gajarsky, Stephan Kreutzer, Jaroslav Nešetřil, Patrice Ossona De Mendez, et al.. First-Order Interpretations of Bounded Expansion Classes. ACM Transactions on Computational Logic, Association for Computing Machinery, 2020, 21 (4), pp.1-41. ⟨10.1145/3382093⟩. ⟨hal-02901296⟩
  • Jaroslav Nešetřil, Patrice Ossona de Mendez, Michał Pilipczuk, Xuding Zhu. Clustering Powers of Sparse Graphs. The Electronic Journal of Combinatorics, Open Journal Systems, 2020, 27 (4), ⟨10.37236/9417⟩. ⟨hal-03039313⟩
  • Patrice Ossona de Mendez, Zdenĕk Dvořák, Patrice Ossona de Mendez, Hehui Wu. 1-Subdivisions, the Fractional Chromatic Number and the Hall Ratio. Combinatorica, Springer Verlag, 2020, ⟨10.1007/s00493-020-4223-9⟩. ⟨hal-03039315⟩
  • Patrice Ossona de Mendez, Kord Eickmeyer, Jan van Den Heuvel, Ken-Ichi Kawarabayashi, Stephan Kreutzer, et al.. Model-Checking on Ordered Structures. ACM Transactions on Computational Logic, Association for Computing Machinery, 2020, 21 (2), pp.1-28. ⟨10.1145/3360011⟩. ⟨hal-02901295⟩
  • Gwenaël Joret, Piotr Micek, Patrice Ossona de Mendez, Veit Wiechert. Nowhere Dense Graph Classes and Dimension. Combinatorica, Springer Verlag, 2019, 39 (5), pp.1055-1079. ⟨10.1007/s00493-019-3892-8⟩. ⟨hal-02437679⟩
  • Patrice Ossona de Mendez, Sang-Il Oum, David Wood. Defective Colouring of Graphs Excluding A Subgraph or Minor. Combinatorica, Springer Verlag, 2019, 39 (2), pp.377-410. ⟨10.1007/s00493-018-3733-1⟩. ⟨hal-02901293⟩
  • Jaroslav Nešetřil, Patrice Ossona de Mendez. EXISTENCE OF MODELING LIMITS FOR SEQUENCES OF SPARSE STRUCTURES. The Journal of Symbolic Logic, Association for Symbolic Logic, 2019, 84 (02), pp.452-472. ⟨10.1017/jsl.2018.32⟩. ⟨hal-02437684⟩
  • Patrice Ossona de Mendez, Robert Ganian, Petr Hliněný, Jaroslav Nešetřil, Jan Obdrzalek. Shrub-depth: Capturing Height of Dense Graphs. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2019, 15 (1). ⟨hal-02437683⟩
  • Patrice Ossona de Mendez, Robert Ganian, Petr Hliněný, Jaroslav Nešetřil, Jan Obdržálek. Shrub-depth: Capturing Height of Dense Graphs. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2019. ⟨hal-02901292⟩
  • Patrice Ossona de Mendez, Jaroslav Nešetřil. Local-Global Convergence, an analytic and structural approach. Commentationes Mathematicae Universitatis Carolinae, 2019, 60 (1), pp.97-129. ⟨10.14712/1213-7243.2015.280⟩. ⟨hal-02437676⟩
  • Patrice Ossona de Mendez, P. Charbit, L. Hosseini. Limits of structures and the example of tree semi-lattices. Discrete Mathematics, Elsevier, 2017, 340 (10), pp.2589 - 2603. ⟨10.1016/j.disc.2017.06.013⟩. ⟨hal-01918180⟩
  • Jan van den Heuvel, Patrice Ossona de Mendez, Daniel Quiroz, Roman Rabinovich, Sebastian Siebertz. On the generalised colouring numbers of graphs that exclude a fixed minor. European Journal of Combinatorics, Elsevier, 2017, 66, pp.129 - 144. ⟨10.1016/j.ejc.2017.06.019⟩. ⟨hal-01918179⟩
  • Lucas Hosseini, Jaroslav Nesetril, Patrice Ossona de Mendez. Limits of mappings. European Journal of Combinatorics, Elsevier, 2017, 66, pp.145 - 159. ⟨10.1016/j.ejc.2017.06.021⟩. ⟨hal-01918177⟩
  • Patrice Ossona de Mendez, Jaroslav Nesetril. Cluster analysis of local convergent sequences of structures. Random Structures and Algorithms, Wiley, 2017, 51 (4), pp.674 - 728. ⟨10.1002/rsa.20719⟩. ⟨hal-01918178⟩
  • Jérémie Chalopin, Louis Esperet, Zhentao Li, Patrice Ossona de Mendez. Restricted frame graphs and a conjecture of Scott. The Electronic Journal of Combinatorics, Open Journal Systems, 2016, 23 (1), pp.#P1.30. ⟨hal-01119809⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez, Xuding Zhu. Colouring Edges with many Colours in Cycles. Journal of Combinatorial Theory, Series B, Elsevier, 2014, 109, pp.102-119. ⟨10.1016/j.jctb.2014.06.002⟩. ⟨hal-00613907⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez, David R. Wood. Characterizations and Examples of Graph Classes with Bounded Expansion. European Journal of Combinatorics, Elsevier, 2012, 33 (3), pp.350-373. ⟨10.1016/j.ejc.2011.09.008⟩. ⟨hal-00656805⟩
  • Hubert de Fraysseix, Patrice Ossona de Mendez. Planarity and Trémaux trees. European Journal of Combinatorics, Elsevier, 2012, 33 (3), pp.279-293. ⟨10.1016/j.ejc.2011.09.012⟩. ⟨hal-00656808⟩
  • Mickael Montassier, Patrice Ossona de Mendez, André Raspaud, Xuding Zhu. Decomposing a graph into forests. Journal of Combinatorial Theory, Series B, Elsevier, 2012, 102 (1), pp.38-52. ⟨10.1016/j.jctb.2011.04.001⟩. ⟨hal-00656800⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez. A Model Theory Approach to Structural Limits. Commentationes Mathematicae Universitatis Carolinae, 2012, 53 (4), pp.581-603. ⟨hal-00799560⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez. On nowhere dense graphs. European Journal of Combinatorics, Elsevier, 2011, 32 (4), pp.600-617. ⟨10.1016/j.ejc.2011.01.006⟩. ⟨hal-00656793⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez. How many F's are there in G?. European Journal of Combinatorics, Elsevier, 2011, 32 (7), pp.1126-1141. ⟨10.1016/j.ejc.2011.03.007⟩. ⟨hal-00656795⟩
  • Francesca Fiorenzi, Pascal Ochem, Patrice Ossona de Mendez, Xuding Zhu. Thue choosability of trees. Discrete Applied Mathematics, Elsevier, 2011, 159, pp.2045-2049. ⟨10.1016/j.dam.2011.07.017⟩. ⟨hal-00656797⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez. First Order Properties on Nowhere Dense Structures. The Journal of Symbolic Logic, Association for Symbolic Logic, 2010, 75 (3), pp.868-887. ⟨hal-00656791⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez. Fraternal augmentations, arrangeability and linear Ramsey numbers. European Journal of Combinatorics, Elsevier, 2009, 30 (7), pp.1696-1703. ⟨10.1016/j.ejc.2009.03.012⟩. ⟨hal-00429952⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez. Grad and classes with bounded expansion III. Restricted graph homomorphism dualities. European Journal of Combinatorics, Elsevier, 2008, 29 (4), pp.1012-1024. ⟨hal-00288113⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez. Grad and classes with bounded expansion II. algorithmic aspects. European Journal of Combinatorics, Elsevier, 2008, 29 (3), pp.777-791. ⟨10.1016/j.ejc.2006.07.014⟩. ⟨hal-00260722⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez. Grad and classes with bounded expansion I. decompositions. European Journal of Combinatorics, Elsevier, 2008, 29 (3), pp.760-776. ⟨10.1016/j.ejc.2006.07.013⟩. ⟨hal-00260721⟩
  • Hubert de Fraysseix, Patrice Ossona de Mendez. Barycentric systems and stretchability. Discrete Applied Mathematics, Elsevier, 2007, 155 (9), pp.1079-1095. ⟨10.1016/j.dam.2005.12.009⟩. ⟨hal-00147454⟩
  • Hubert de Fraysseix, Patrice Ossona de Mendez. Representations by Contact and Intersection of Segments. Algorithmica, Springer Verlag, 2007, 47 (4), pp.453-463. ⟨10.1007/s00453-006-0157-x⟩. ⟨hal-00138575⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez. Folding. Journal of Combinatorial Theory, Series B, Elsevier, 2006, 96-5, pp.730-739. ⟨10.1016/j.jctb.2006.02.002⟩. ⟨hal-00081706⟩
  • Hubert de Fraysseix, Patrice Ossona de Mendez, Pierre Rosenstiehl. Trémaux trees and planarity. International Journal of Foundations of Computer Science, World Scientific Publishing, 2006, 17 (5), pp.1017-1029. ⟨10.1142/S0129054106004248⟩. ⟨hal-00097836⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez. Tree depth, subgraph coloring and homomorphism bounds. European Journal of Combinatorics, Elsevier, 2006, 27(6), pp.1022-1041. ⟨10.1016/j.ejc.2005.01.010⟩. ⟨hal-00023821⟩
  • Hubert de Fraysseix, Patrice Ossona de Mendez. Regular embeddings of multigraphs. Algorithms and Combinatorics, 2006, 26 (Topics in Discrete Mathematics), pp.553-563. ⟨hal-00101456⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez. Cuts and bounds. Discrete Mathematics, Elsevier, 2005, 302(1-3), pp.211-224. ⟨10.1016/j.disc.2004.07.034⟩. ⟨hal-00013787⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez. Grad and classes with bounded expansion I. decompositions.. KAM-DIMATIA Series, 2005, 2005-739, pp.1-21. ⟨hal-00007997⟩
  • Patrice Ossona de Mendez, Pierre Rosenstiehl. Homomorphism and dimension. Combinatorics, Probability and Computing, Cambridge University Press (CUP), 2005, 14 (5-6), pp.861-872. ⟨10.1017/S0963548305007145⟩. ⟨hal-00011203⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez. Grad and classes with bounded expansion III. restricted dualities.. KAM-DIMATIA Series, 2005, 2005-741, pp.1-14. ⟨hal-00007999⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez. Grad and Classes with Bounded Expansion II. Algorithmic Aspects.. KAM-DIMATIA Series, 2005, 2005-740, pp.1-20. ⟨hal-00007998v2⟩
  • Patrice Ossona de Mendez, Pierre Rosenstiehl. Transitivity And Connectivity Of Permutations. Combinatorica, Springer Verlag, 2004, 24(3), pp.487 - 501. ⟨10.1007/s00493-004-0029-4⟩. ⟨hal-00005618⟩
  • Hubert de Fraysseix, Patrice Ossona de Mendez. Connectivity of planar graphs. Graphs Algorithms and Applications, 2004, 2. ⟨hal-00005632⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez. Colorings and homomorphisms of minor closed classes. Discrete and Computational Geometry, Springer Verlag, 2003, The Goodman-Pollack Festschrift, volume 25 of Algorithms and Combinatorics, pp.651-664. ⟨hal-00005631⟩
  • Patrice Ossona de Mendez, Hubert Tonneau. The future of programming languages. Software 2.0, 2003, 100, pp.56-58. ⟨hal-00008537⟩
  • Hubert de Fraysseix, Patrice Ossona de Mendez. On cotree-critical and DFS cotree-critical graphs.. Journal of Graph Algorithms and Applications, Brown University, 2003, 7(4), pp.411-427. ⟨hal-00005630⟩
  • Patrice Ossona de Mendez. Realization of posets. Journal of Graph Algorithms and Applications, Brown University, 2002, 6(1), pp.149-153. ⟨hal-00005629⟩
  • Hubert de Fraysseix, Patrice Ossona de Mendez. On topological aspects of orientations. Discrete Mathematics, Elsevier, 2001, 229 (1-3), pp.57-72. ⟨10.1016/S0012-365X(00)00201-6⟩. ⟨hal-00005628⟩
  • Hubert de Fraysseix, Patrice Ossona de Mendez. Connectivity of planar graphs. Journal of Graph Algorithms and Applications, Brown University, 2001, 5(5), pp.93-105. ⟨hal-00005627⟩
  • Hubert de Fraysseix, Patrice Ossona de Mendez. On a Characterization of Gauss Codes. Discrete and Computational Geometry, Springer Verlag, 1999, 22(2), pp.287-295. ⟨hal-00005626⟩
  • Hubert de Fraysseix, Patrice Ossona de Mendez. Intersection Graphs of Jordan Arcs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 1999, 49, pp.11-28. ⟨hal-00005625⟩
  • Patrice Ossona de Mendez. 3-colorability and contacts of segments. Série du CAMS, 1999, 171, pp.1-2. ⟨hal-00008547⟩
  • Hubert de Fraysseix, Patrice Ossona de Mendez. Planarity and Edge Poset Dimension. European Journal of Combinatorics, Elsevier, 1996, 17 (8), pp.731-740. ⟨10.1006/eujc.1996.0064⟩. ⟨hal-00005624⟩
  • Pierre Rosenstiehl, Hubert Fraysseix (de), Patrice Ossona de Mendez. Bipolar orientations revisited. Discrete Applied Mathematics, Elsevier, 1995, 56, pp.157-179. ⟨hal-00261327⟩
  • Hubert de Fraysseix, Patrice Ossona de Mendez, Pierre Rosenstiehl. Bipolar orientations revisited.. Discrete Applied Mathematics, Elsevier, 1995, 56 (2-3), pp.157-179. ⟨10.1016/0166-218X(94)00085-R⟩. ⟨hal-00005622⟩
  • Hubert de Fraysseix, Patrice Ossona de Mendez, Janos Pach. A Left-First Search Algorithm for Planar Graphs.. Discrete and Computational Geometry, Springer Verlag, 1995, 13, pp.459-468. ⟨hal-00005623⟩
  • Hubert de Fraysseix, Patrice Ossona de Mendez, Pierre Rosenstiehl. On triangle contact graphs. Combinatorics, Probability and Computing, Cambridge University Press (CUP), 1994, 3, pp.233-246. ⟨hal-00005621⟩
  • Pierre Rosenstiehl, Hubert Fraysseix (de), Patrice Ossona de Mendez. On triangle contact graphs. Combinatorics, Probability and Computing, Cambridge University Press (CUP), 1994, 3, pp.233-246. ⟨hal-00261319⟩
  • Hubert de Fraysseix, Patrice Ossona de Mendez, Janos Pach. Representation of planar graphs by segments. Intuitive Geometry, 1991, 63, pp.109-117. ⟨hal-00005620⟩
  • Pierre Rosenstiehl, Marc Bousset, Hubert Fraysseix (de), Patrice Ossona de Mendez. Posters on the automatic generation of layouts of technological networks. Rapport CAMS, 1990, pp.1-7. ⟨hal-00261290⟩

Conference papers25 documents

  • Patrice Ossona de Mendez, Jaroslav Nešetřil, Michał Pilipczuk, Roman Rabinovich, Sebastian Siebertz. Rankwidth meets stability. Symposium on Discrete Algorithms (SODA), Jan 2021, Alexandria, United States. ⟨hal-03373553⟩
  • Patrice Ossona de Mendez, Jaroslav Nešetřil, Roman Rabinovich, Sebastian Siebertz. Linear rankwidth meets stability. Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, Jan 2020, Salt Lake City, United States. pp.1180-1199, ⟨10.1137/1.9781611975994.72⟩. ⟨hal-02437542⟩
  • Patrice Ossona de Mendez, Stephan Kreutzer, Irene Muzi, Roman Rabinovich, Sebastian Siebertz. Algorithmic Properties of Sparse Digraphs. 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, Mar 2019, Berlin, Germany. ⟨hal-02437572⟩
  • Saeed Akhoondian Amiri, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz. Distributed Domination on Graph Classes of Bounded Expansion. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, Jul 2018, Vienna, France. ⟨10.1145/3210377.3210383⟩. ⟨hal-01918187⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez. Sparse Combinatorial Structures: Classification and Applications. International Congress of Mathematicians, Aug 2010, Hyderabad, India. pp.2502-2529. ⟨hal-00535086⟩
  • Mickaël Montassier, Patrice Ossona de Mendez, André Raspaud, Xuding Zhu. Decomposing a graph into forests. 8FCC, 2010, Orsay, France. ⟨lirmm-01264344⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez. Counting Homomorphisms to Sparse Graphs. European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009), Sep 2009, Bordeaux, France. pp.393-397, ⟨10.1016/j.endm.2009.07.065⟩. ⟨hal-00429958⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez. From Sparse Graphs to Nowhere Dense Structures: Decompositions, Independence, Dualities and Limits. European Congress of Mathematics, Jul 2008, Amsterdam, Netherlands. pp.135-165. ⟨hal-00535153⟩
  • Hubert de Fraysseix, Patrice Ossona de Mendez, Pierre Rosenstiehl. Representation of planar hypergraphs by contacts of triangles. Graph Drawing 2007, Sep 2007, Sidney, Australia. pp.125-136, ⟨10.1007/978-3-540-77537-9_15⟩. ⟨hal-00250384⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez. Fraternal augmentations of graphs, coloration and minors. Proceedings of the Sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Mar 2007, Prague, Czech Republic. pp.223-230, ⟨10.1016/j.endm.2007.01.030⟩. ⟨hal-00135861⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez. Linear time low tree-width partitions and algorithmic consequences. 2006, pp.391-400. ⟨hal-00077489⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez. The grad of a graph and classes with bounded expansion. 7th International Colloquium on Graph Theory, 2005, Hyeres, France. pp.101-106, ⟨10.1016/j.endm.2005.06.018⟩. ⟨hal-00014741⟩
  • Hubert de Fraysseix, Patrice Ossona de Mendez. Contact and intersection representations. 2004, pp.217-227, ⟨10.1007/b105810⟩. ⟨hal-00005645⟩
  • Patrice Ossona de Mendez, Marcus Vicinius Santos, Isaac Woungang. Pliant: more than a programming language, a flexible e-learning tool.. 2004, pp.505-510. ⟨hal-00005643⟩
  • Hubert de Fraysseix, Patrice Ossona de Mendez. Stretching of Jordan arc contact systems. 2004, pp.71-85, ⟨10.1007/b94919⟩. ⟨hal-00005644⟩
  • Pascal Auillans, Patrice Ossona de Mendez, Pierre Rosenstiehl, Bernard Vatant. A formal model for topic maps. 2002, pp.69. ⟨hal-00005641⟩
  • Hubert de Fraysseix, Patrice Ossona de Mendez. A characterization of DFS cotree critical graphs. 2002, pp.84-95. ⟨hal-00005642⟩
  • Hubert de Fraysseix, Patrice Ossona de Mendez. An algorithm to find a Kuratowski subdivision in DFS cotree critical graphs. 2001, pp.98-105. ⟨hal-00005640⟩
  • Patrice Ossona de Mendez, Pierre Rosenstiehl. What search for graph drawing.. 2000, pp.125-130. ⟨hal-00005639⟩
  • Patrice Ossona de Mendez. Geometric Realization of Simplicial Complexes. 1999, pp.323-332. ⟨hal-00005637⟩
  • Patrice Ossona de Mendez. The Reduced Genus of a Multigraph. STACS 99, 1999, Triest, Germany. pp.16-31. ⟨hal-00005638⟩
  • Hubert de Fraysseix, Patrice Ossona de Mendez. A short proof of a Gauss problem. 1997, pp.230-235. ⟨hal-00005636⟩
  • Hubert de Fraysseix, Patrice Ossona de Mendez. Regular Orientations, Arboricity and Augmentation. 1995, pp.111-118. ⟨hal-00005635⟩
  • Patrice Ossona de Mendez. On Lattice Structures induced by Orientations.. Graph Drawing '93, 1993, Sèvres, France. pp.33-34. ⟨hal-00008544⟩
  • Patrice Ossona de Mendez. The Plane Bipolar Orientations' Lattice. Sixth Franco-Japanese Days on Combinatorics and Optimization, 1993, Paris, France. ⟨hal-00008545⟩

Books1 document

  • Jaroslav Nesetril, Patrice Ossona de Mendez. Sparsity (Graphs, Structures, and Algorithms). Springer, pp.457, 2012, Algorithms and Combinatorics, 978-3-642-27874-7. ⟨hal-00768681⟩

Book sections8 documents

  • Patrice Ossona de Mendez. Sparsity and model theory. Lowell W. Beineke, Martin Charles Golumbic, Robin J. Wilson. Topics in Algorithmic Graph Theory, Cambridge University Press, 2021, ⟨10.1017/9781108592376⟩. ⟨hal-03373461⟩
  • Patrice Ossona de Mendez, Jaroslav Nesetril. Approximation of Mappings. Building Bridges II, 28, Springer, 2020, Bolyai Society Mathematical Studies, 978-3-662-59203-8. ⟨hal-02437671⟩
  • Jaroslav Nešetřil, Patrice Ossona de Mendez. Approximations of Mappings. Building Bridges II, pp.337-375, 2019, ⟨10.1007/978-3-662-59204-5_11⟩. ⟨hal-02901287⟩
  • John Gimbel, Patrice Ossona de Mendez, Pavel Valtr. Obstacle Numbers of Planar Graphs. Graph Drawing and Network Visualization, pp.67-80, 2018. ⟨hal-01953795⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez. Extremal problems for sparse graphs. An irregular mind (zemerédi is 70), Springer, pp.447-490, 2010, Bolyai Society Mathematical Studies - Vol 21. ⟨hal-00535107⟩
  • Patrice Ossona de Mendez. Représentations des graphes. Jean-Claude Fournier. Graphes et applications 2, Hermès Science, pp.129-160, 2007, Série Informatique et Systèmes d'Information, traité IC2. ⟨hal-00184930⟩
  • Patrice Ossona de Mendez, Pierre Rosenstiehl. Encoding pointed maps by double occurrence words. University of Piraeus. olume of essays in honour of Professor Antonios C. Panayotopoulos, Eptalofos, pp.701-712, 2006. ⟨hal-00007477⟩
  • Hubert de Fraysseix, Patrice Ossona de Mendez, Pierre Rosenstiehl. On Triangle Contact Graphs. Bela Bollobas. Combinatorics, Geometry and Probability, Cambridge University Press, pp.165-178, 1997. ⟨hal-00008999⟩

Patents1 document

  • Patrice Ossona de Mendez. Systèmes Mémoires Accessibles par leur Adresses ou leur Contenu. France, N° de brevet: 82.07 777. 1982. ⟨hal-00005633⟩

Other publications1 document

  • George Th. Guilbaud, Ernest Coumet, Patrice Ossona de Mendez, Pierre Rosenstiehl. Mathématique Sociale (Série ``Savoir et Mémoire'').. 1993. ⟨hal-00008541⟩

Preprints, Working Papers, ...11 documents

  • Lucas Hosseini, Patrice Ossona de Mendez. Treeable Graphings are Local Limits of Finite Graphs. 2016. ⟨hal-01252409⟩
  • Pierre Charbit, Lucas Hosseini, Patrice Ossona de Mendez. Limits of Structures and the Example of Tree-Semilattices. 2015. ⟨hal-01150659v2⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez. Cluster Analysis of Local Convergent Sequences of Structures. 2015. ⟨hal-01216529v2⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez. On Low Tree-Depth Decompositions. 2014. ⟨hal-01081579⟩
  • A.J Goodall, Jaroslav Nesetril, Patrice Ossona de Mendez. Strongly Polynomial Sequences as Interpretations. 2014. ⟨hal-00989251⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez. On First-Order Definable Colorings. 2014. ⟨hal-00957088v2⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez. First-order limits, an analytical perspective . 2014. ⟨hal-01135593⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez. A note on circular chromatic number of graphs with large girth and similar problems. 2014. ⟨hal-00946134⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez. A unified approach to structural limits, and limits of graphs with bounded tree-depth. 2013. ⟨hal-00804823v2⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez. Modeling Limits in Hereditary Classes: Reduction and Application to Trees. 2013. ⟨hal-00912153⟩
  • Jaroslav Nesetril, Patrice Ossona de Mendez. A note on Fiedler value of classes with sublinear separators. 2012. ⟨hal-00724093⟩