Patrice Ossona de Mendez
119
Documents
Identifiants chercheurs
- pom
- ResearcherId : C-1974-2008
- 0000-0003-0724-3729
- IdRef : 160167906
- ResearcherId : http://www.researcherid.com/rid/C-1974-2008
Présentation
Publications
- 29
- 24
- 15
- 14
- 11
- 10
- 6
- 4
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 6
- 2
Modulo-counting first-order logic on bounded expansion classesDiscrete Mathematics, 2023, pp.113700. ⟨10.1016/j.disc.2023.113700⟩
Article dans une revue
hal-04314339v1
|
|
Distributed domination on sparse graph classesEuropean Journal of Combinatorics, 2023, pp.103773. ⟨10.1016/j.ejc.2023.103773⟩
Article dans une revue
hal-04314312v1
|
|
From χ- to χ-bounded classesJournal of Combinatorial Theory, Series B, 2023, 158, pp.186-209. ⟨10.1016/j.jctb.2021.05.006⟩
Article dans une revue
hal-04314324v1
|
|
|
From χ to χp-bounded classesJournal of Combinatorial Theory, Series B, 2023, Robin Thomas 1962-2020, 158 (1), pp.186-209. ⟨10.1016/j.jctb.2021.05.006⟩
Article dans une revue
hal-03373528v1
|
A few words about mapsEuropean Journal of Combinatorics, 2023, pp.103810. ⟨10.1016/j.ejc.2023.103810⟩
Article dans une revue
hal-04314300v1
|
|
|
Twin-width and generalized coloring numbersDiscrete Mathematics, 2022, 345 (3), pp.112746. ⟨10.1016/j.disc.2021.112746⟩
Article dans une revue
hal-03450765v1
|
|
Classes of graphs with low complexity: The case of classes with bounded linear rankwidthEuropean Journal of Combinatorics, 2021, 91, pp.103223. ⟨10.1016/j.ejc.2020.103223⟩
Article dans une revue
hal-03039318v1
|
Model-Checking on Ordered StructuresACM Transactions on Computational Logic, 2020, 21 (2), pp.1-28. ⟨10.1145/3360011⟩
Article dans une revue
hal-02901295v1
|
|
A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-DepthMemoirs of the American Mathematical Society, 2020, 263 (1272), ⟨10.1090/memo/1272⟩
Article dans une revue
hal-02901299v1
|
|
Clustering Powers of Sparse GraphsThe Electronic Journal of Combinatorics, 2020, 27 (4), ⟨10.37236/9417⟩
Article dans une revue
hal-03039313v1
|
|
First-Order Interpretations of Bounded Expansion ClassesACM Transactions on Computational Logic, 2020, 21 (4), pp.1-41. ⟨10.1145/3382093⟩
Article dans une revue
hal-02901296v1
|
|
1-Subdivisions, the Fractional Chromatic Number and the Hall RatioCombinatorica, 2020, ⟨10.1007/s00493-020-4223-9⟩
Article dans une revue
hal-03039315v1
|
|
Regular partitions of gentle graphsActa Mathematica Hungarica, 2020, 161, pp.719-755. ⟨10.1007/s10474-020-01074-x⟩
Article dans une revue
hal-02905597v1
|
|
Local-Global Convergence, an analytic and structural approachCommentationes Mathematicae Universitatis Carolinae, 2019, 60 (1), pp.97-129. ⟨10.14712/1213-7243.2015.280⟩
Article dans une revue
hal-02437676v1
|
|
Nowhere Dense Graph Classes and DimensionCombinatorica, 2019, 39 (5), pp.1055-1079. ⟨10.1007/s00493-019-3892-8⟩
Article dans une revue
hal-02437679v1
|
|
Defective Colouring of Graphs Excluding A Subgraph or MinorCombinatorica, 2019, 39 (2), pp.377-410. ⟨10.1007/s00493-018-3733-1⟩
Article dans une revue
hal-02901293v1
|
|
EXISTENCE OF MODELING LIMITS FOR SEQUENCES OF SPARSE STRUCTURESThe Journal of Symbolic Logic, 2019, 84 (02), pp.452-472. ⟨10.1017/jsl.2018.32⟩
Article dans une revue
hal-02437684v1
|
|
Shrub-depth: Capturing Height of Dense GraphsLogical Methods in Computer Science, 2019, 15 (1)
Article dans une revue
hal-02437683v1
|
|
Shrub-depth: Capturing Height of Dense GraphsLogical Methods in Computer Science, 2019
Article dans une revue
hal-02901292v1
|
|
On the generalised colouring numbers of graphs that exclude a fixed minorEuropean Journal of Combinatorics, 2017, 66, pp.129 - 144. ⟨10.1016/j.ejc.2017.06.019⟩
Article dans une revue
hal-01918179v1
|
|
Limits of mappingsEuropean Journal of Combinatorics, 2017, 66, pp.145 - 159. ⟨10.1016/j.ejc.2017.06.021⟩
Article dans une revue
hal-01918177v1
|
|
Limits of structures and the example of tree semi-latticesDiscrete Mathematics, 2017, 340 (10), pp.2589 - 2603. ⟨10.1016/j.disc.2017.06.013⟩
Article dans une revue
hal-01918180v1
|
|
Cluster analysis of local convergent sequences of structuresRandom Structures and Algorithms, 2017, 51 (4), pp.674 - 728. ⟨10.1002/rsa.20719⟩
Article dans une revue
hal-01918178v1
|
|
Restricted frame graphs and a conjecture of ScottThe Electronic Journal of Combinatorics, 2016, 23 (1), pp.#P1.30. ⟨10.37236/4424⟩
Article dans une revue
hal-01119809v1
|
|
|
Colouring Edges with many Colours in CyclesJournal of Combinatorial Theory, Series B, 2014, 109, pp.102-119. ⟨10.1016/j.jctb.2014.06.002⟩
Article dans une revue
hal-00613907v1
|
Decomposing a graph into forestsJournal of Combinatorial Theory, Series B, 2012, 102 (1), pp.38-52. ⟨10.1016/j.jctb.2011.04.001⟩
Article dans une revue
hal-00656800v1
|
|
Characterizations and Examples of Graph Classes with Bounded ExpansionEuropean Journal of Combinatorics, 2012, 33 (3), pp.350-373. ⟨10.1016/j.ejc.2011.09.008⟩
Article dans une revue
hal-00656805v1
|
|
|
A Model Theory Approach to Structural LimitsCommentationes Mathematicae Universitatis Carolinae, 2012, 53 (4), pp.581-603
Article dans une revue
hal-00799560v1
|
Planarity and Trémaux treesEuropean Journal of Combinatorics, 2012, 33 (3), pp.279-293. ⟨10.1016/j.ejc.2011.09.012⟩
Article dans une revue
hal-00656808v1
|
|
On nowhere dense graphsEuropean Journal of Combinatorics, 2011, 32 (4), pp.600-617. ⟨10.1016/j.ejc.2011.01.006⟩
Article dans une revue
hal-00656793v1
|
|
Thue choosability of treesDiscrete Applied Mathematics, 2011, 159, pp.2045-2049. ⟨10.1016/j.dam.2011.07.017⟩
Article dans une revue
hal-00656797v1
|
|
How many F's are there in G?European Journal of Combinatorics, 2011, 32 (7), pp.1126-1141. ⟨10.1016/j.ejc.2011.03.007⟩
Article dans une revue
hal-00656795v1
|
|
First Order Properties on Nowhere Dense StructuresThe Journal of Symbolic Logic, 2010, 75 (3), pp.868-887. ⟨10.2178/jsl/1278682204⟩
Article dans une revue
hal-00656791v1
|
|
Fraternal augmentations, arrangeability and linear Ramsey numbersEuropean Journal of Combinatorics, 2009, 30 (7), pp.1696-1703. ⟨10.1016/j.ejc.2009.03.012⟩
Article dans une revue
hal-00429952v1
|
|
Grad and classes with bounded expansion III. Restricted graph homomorphism dualitiesEuropean Journal of Combinatorics, 2008, 29 (4), pp.1012-1024
Article dans une revue
hal-00288113v1
|
|
Grad and classes with bounded expansion II. algorithmic aspectsEuropean Journal of Combinatorics, 2008, 29 (3), pp.777-791. ⟨10.1016/j.ejc.2006.07.014⟩
Article dans une revue
hal-00260722v1
|
|
Grad and classes with bounded expansion I. decompositionsEuropean Journal of Combinatorics, 2008, 29 (3), pp.760-776. ⟨10.1016/j.ejc.2006.07.013⟩
Article dans une revue
hal-00260721v1
|
|
Barycentric systems and stretchabilityDiscrete Applied Mathematics, 2007, 155 (9), pp.1079-1095. ⟨10.1016/j.dam.2005.12.009⟩
Article dans une revue
hal-00147454v1
|
|
Representations by Contact and Intersection of SegmentsAlgorithmica, 2007, 47 (4), pp.453-463. ⟨10.1007/s00453-006-0157-x⟩
Article dans une revue
hal-00138575v1
|
|
Tree depth, subgraph coloring and homomorphism boundsEuropean Journal of Combinatorics, 2006, 27(6), pp.1022-1041. ⟨10.1016/j.ejc.2005.01.010⟩
Article dans une revue
hal-00023821v1
|
|
|
Regular embeddings of multigraphsAlgorithms and Combinatorics, 2006, 26 (Topics in Discrete Mathematics), pp.553-563
Article dans une revue
hal-00101456v1
|
|
Trémaux trees and planarityInternational Journal of Foundations of Computer Science, 2006, 17 (5), pp.1017-1029. ⟨10.1142/S0129054106004248⟩
Article dans une revue
hal-00097836v1
|
FoldingJournal of Combinatorial Theory, Series B, 2006, 96-5, pp.730-739. ⟨10.1016/j.jctb.2006.02.002⟩
Article dans une revue
hal-00081706v1
|
|
|
Grad and classes with bounded expansion I. decompositions.KAM-DIMATIA Series, 2005, 2005-739, pp.1-21
Article dans une revue
hal-00007997v1
|
Homomorphism and dimensionCombinatorics, Probability and Computing, 2005, 14 (5-6), pp.861-872. ⟨10.1017/S0963548305007145⟩
Article dans une revue
hal-00011203v1
|
|
Cuts and boundsDiscrete Mathematics, 2005, 302(1-3), pp.211-224. ⟨10.1016/j.disc.2004.07.034⟩
Article dans une revue
hal-00013787v1
|
|
|
Grad and Classes with Bounded Expansion II. Algorithmic Aspects.KAM-DIMATIA Series, 2005, 2005-740, pp.1-20
Article dans une revue
hal-00007998v2
|
|
Grad and classes with bounded expansion III. restricted dualities.KAM-DIMATIA Series, 2005, 2005-741, pp.1-14
Article dans une revue
hal-00007999v1
|
Connectivity of planar graphsGraphs Algorithms and Applications, 2004, 2
Article dans une revue
hal-00005632v1
|
|
Transitivity And Connectivity Of PermutationsCombinatorica, 2004, 24(3), pp.487 - 501. ⟨10.1007/s00493-004-0029-4⟩
Article dans une revue
hal-00005618v1
|
|
On cotree-critical and DFS cotree-critical graphs.Journal of Graph Algorithms and Applications, 2003, 7(4), pp.411-427
Article dans une revue
hal-00005630v1
|
|
Colorings and homomorphisms of minor closed classesDiscrete and Computational Geometry, 2003, The Goodman-Pollack Festschrift, volume 25 of Algorithms and Combinatorics, pp.651-664
Article dans une revue
hal-00005631v1
|
|
|
The future of programming languagesSoftware 2.0, 2003, 100, pp.56-58
Article dans une revue
hal-00008537v1
|
Realization of posetsJournal of Graph Algorithms and Applications, 2002, 6(1), pp.149-153
Article dans une revue
hal-00005629v1
|
|
Connectivity of planar graphsJournal of Graph Algorithms and Applications, 2001, 5(5), pp.93-105
Article dans une revue
hal-00005627v1
|
|
On topological aspects of orientationsDiscrete Mathematics, 2001, 229 (1-3), pp.57-72. ⟨10.1016/S0012-365X(00)00201-6⟩
Article dans une revue
hal-00005628v1
|
|
|
Intersection Graphs of Jordan ArcsDiscrete Mathematics and Theoretical Computer Science, 1999, 49, pp.11-28
Article dans une revue
hal-00005625v1
|
|
3-colorability and contacts of segmentsSérie du CAMS, 1999, 171, pp.1-2
Article dans une revue
hal-00008547v1
|
On a Characterization of Gauss CodesDiscrete and Computational Geometry, 1999, 22(2), pp.287-295
Article dans une revue
hal-00005626v1
|
|
Planarity and Edge Poset DimensionEuropean Journal of Combinatorics, 1996, 17 (8), pp.731-740. ⟨10.1006/eujc.1996.0064⟩
Article dans une revue
hal-00005624v1
|
|
|
A Left-First Search Algorithm for Planar Graphs.Discrete and Computational Geometry, 1995, 13, pp.459-468
Article dans une revue
hal-00005623v1
|
Bipolar orientations revisited.Discrete Applied Mathematics, 1995, 56 (2-3), pp.157-179. ⟨10.1016/0166-218X(94)00085-R⟩
Article dans une revue
hal-00005622v1
|
|
Bipolar orientations revisitedDiscrete Applied Mathematics, 1995, 56, pp.157-179
Article dans une revue
hal-00261327v1
|
|
On triangle contact graphsCombinatorics, Probability and Computing, 1994, 3, pp.233-246
Article dans une revue
hal-00261319v1
|
|
On triangle contact graphsCombinatorics, Probability and Computing, 1994, 3, pp.233-246
Article dans une revue
hal-00005621v1
|
|
Representation of planar graphs by segmentsIntuitive Geometry, 1991, 63, pp.109-117
Article dans une revue
hal-00005620v1
|
|
Posters on the automatic generation of layouts of technological networksRapport CAMS, 1990, P 070, pp.1-7
Article dans une revue
hal-00261290v1
|
Twin-width and permutationsEurocomb 2023, Aug 2023, Prague (CZ), Czech Republic. pp.156-162, ⟨10.5817/CZ.MUNI.EUROCOMB23-022⟩
Communication dans un congrès
hal-04314372v1
|
|
Decomposition horizons: from graph sparsity to model-theoretic dividing linesEurocomb 2023, Aug 2023, Prague (CZ), Czech Republic. pp.216-222, ⟨10.5817/CZ.MUNI.EUROCOMB23-030⟩
Communication dans un congrès
hal-04314385v1
|
|
Twin-Width V: Linear Minors, Modular Counting, and Matrix MultiplicationSTACS 2023, Mar 2023, Hamburg, Germany. ⟨10.4230/LIPIcs.STACS.2023.15⟩
Communication dans un congrès
hal-04314365v1
|
|
|
Twin-width IV: ordered graphs and matricesSTOC 2022, Jun 2022, Rome, Italy
Communication dans un congrès
hal-03714452v1
|
|
Structural Properties of the First-Order Transduction Quasiorder30th EACSL Annual Conference on Computer Science Logic CSL 2022, Feb 2022, Göttingen, Germany. pp.31:1 -31:16, ⟨10.4230/LIPIcs.CSL.2022.31⟩
Communication dans un congrès
hal-03765457v1
|
|
Rankwidth meets stabilitySymposium on Discrete Algorithms (SODA), Jan 2021, Alexandria, United States
Communication dans un congrès
hal-03373553v1
|
Linear rankwidth meets stabilityProceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, Jan 2020, Salt Lake City, United States. pp.1180-1199, ⟨10.1137/1.9781611975994.72⟩
Communication dans un congrès
hal-02437542v1
|
|
Algorithmic Properties of Sparse Digraphs36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, Mar 2019, Berlin, Germany
Communication dans un congrès
hal-02437572v1
|
|
Distributed Domination on Graph Classes of Bounded ExpansionProceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, Jul 2018, Vienna, France. ⟨10.1145/3210377.3210383⟩
Communication dans un congrès
hal-01918187v1
|
|
Decomposing a graph into forests8FCC, 2010, Orsay, France
Communication dans un congrès
lirmm-01264344v1
|
|
|
Sparse Combinatorial Structures: Classification and ApplicationsInternational Congress of Mathematicians, Aug 2010, Hyderabad, India. pp.2502-2529
Communication dans un congrès
hal-00535086v1
|
Counting Homomorphisms to Sparse GraphsEuropean Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009), Sep 2009, Bordeaux, France. pp.393-397, ⟨10.1016/j.endm.2009.07.065⟩
Communication dans un congrès
hal-00429958v1
|
|
From Sparse Graphs to Nowhere Dense Structures: Decompositions, Independence, Dualities and LimitsEuropean Congress of Mathematics, Jul 2008, Amsterdam, Netherlands. pp.135-165
Communication dans un congrès
hal-00535153v1
|
|
Fraternal augmentations of graphs, coloration and minorsProceedings 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⟩
Communication dans un congrès
hal-00135861v1
|
|
Representation of planar hypergraphs by contacts of trianglesGraph Drawing 2007, Sep 2007, Sidney, Australia. pp.125-136, ⟨10.1007/978-3-540-77537-9_15⟩
Communication dans un congrès
hal-00250384v1
|
|
Linear time low tree-width partitions and algorithmic consequences2006, pp.391-400
Communication dans un congrès
hal-00077489v1
|
|
The grad of a graph and classes with bounded expansion7th International Colloquium on Graph Theory, 2005, Hyeres, France. pp.101-106, ⟨10.1016/j.endm.2005.06.018⟩
Communication dans un congrès
hal-00014741v1
|
|
Contact and intersection representations2004, pp.217-227, ⟨10.1007/b105810⟩
Communication dans un congrès
hal-00005645v1
|
|
Stretching of Jordan arc contact systems2004, pp.71-85, ⟨10.1007/b94919⟩
Communication dans un congrès
hal-00005644v1
|
|
|
Pliant: more than a programming language, a flexible e-learning tool.2004, pp.505-510
Communication dans un congrès
hal-00005643v1
|
A formal model for topic maps2002, pp.69
Communication dans un congrès
hal-00005641v1
|
|
A characterization of DFS cotree critical graphs2002, pp.84-95
Communication dans un congrès
hal-00005642v1
|
|
An algorithm to find a Kuratowski subdivision in DFS cotree critical graphs2001, pp.98-105
Communication dans un congrès
hal-00005640v1
|
|
What search for graph drawing.2000, pp.125-130
Communication dans un congrès
hal-00005639v1
|
|
Geometric Realization of Simplicial Complexes1999, pp.323-332
Communication dans un congrès
hal-00005637v1
|
|
The Reduced Genus of a MultigraphSTACS 99, 1999, Triest, Germany. pp.16-31
Communication dans un congrès
hal-00005638v1
|
|
A short proof of a Gauss problem1997, pp.230-235
Communication dans un congrès
hal-00005636v1
|
|
Regular Orientations, Arboricity and Augmentation1995, pp.111-118
Communication dans un congrès
hal-00005635v1
|
|
On Lattice Structures induced by Orientations.Graph Drawing '93, 1993, Sèvres, France. pp.33-34
Communication dans un congrès
hal-00008544v1
|
|
The Plane Bipolar Orientations' LatticeSixth Franco-Japanese Days on Combinatorics and Optimization, 1993, Paris, France
Communication dans un congrès
hal-00008545v1
|
Sparsity (Graphs, Structures, and Algorithms)Springer, pp.457, 2012, Algorithms and Combinatorics, 978-3-642-27874-7
Ouvrages
hal-00768681v1
|
Sparsity and model theoryLowell W. Beineke, Martin Charles Golumbic, Robin J. Wilson. Topics in Algorithmic Graph Theory, Cambridge University Press, 2021, ⟨10.1017/9781108592376⟩
Chapitre d'ouvrage
hal-03373461v1
|
|
Approximation of MappingsBuilding Bridges II, 28, Springer, 2020, Bolyai Society Mathematical Studies, 978-3-662-59203-8
Chapitre d'ouvrage
hal-02437671v1
|
|
Approximations of MappingsBuilding Bridges II, pp.337-375, 2019, ⟨10.1007/978-3-662-59204-5_11⟩
Chapitre d'ouvrage
hal-02901287v1
|
|
Obstacle Numbers of Planar GraphsGraph Drawing and Network Visualization, pp.67-80, 2018
Chapitre d'ouvrage
hal-01953795v1
|
|
Extremal problems for sparse graphsAn irregular mind ({S}zemerédi is 70), Springer, pp.447-490, 2010, Bolyai Society Mathematical Studies - Vol 21
Chapitre d'ouvrage
hal-00535107v1
|
|
Représentations des graphesJean-Claude Fournier. Graphes et applications 2, Hermès Science, pp.129-160, 2007, Série Informatique et Systèmes d'Information, traité IC2
Chapitre d'ouvrage
hal-00184930v1
|
|
|
Encoding pointed maps by double occurrence wordsUniversity of Piraeus. olume of essays in honour of Professor Antonios C. Panayotopoulos, Eptalofos, pp.701-712, 2006
Chapitre d'ouvrage
hal-00007477v1
|
On Triangle Contact GraphsBela Bollobas. Combinatorics, Geometry and Probability, Cambridge University Press, pp.165-178, 1997
Chapitre d'ouvrage
hal-00008999v1
|
Systèmes Mémoires Accessibles par leur Adresses ou leur ContenuFrance, N° de brevet: 82.07 777. 1982
Brevet
hal-00005633v1
|
Mathématique Sociale (Série ``Savoir et Mémoire'').1993
Autre publication scientifique
hal-00008541v1
|