default search action
Patrice Ossona de Mendez
Person information
- affiliation: Centre National de la Recherche Scientifique
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [j71]Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz:
Transducing paths in graph classes with unbounded shrubdepth. Eur. J. Comb. 123: 103660 (2025) - [j70]Ozan Heydt, Simeon Kublenz, Patrice Ossona de Mendez, Sebastian Siebertz, Alexandre Vigny:
Distributed domination on sparse graph classes. Eur. J. Comb. 123: 103773 (2025) - 2024
- [j69]Jan Dreier
, Jakub Gajarský, Yiting Jiang, Patrice Ossona de Mendez
Corrigendum to "Twin-width and generalized coloring numbers" [Discrete Math. 345 (3) (2022) 112746]. Discret. Math. 347(1): 113750 (2024) - [j68]Robert Cori, Jaroslav Nesetril, Patrice Ossona de Mendez:
Special Issue dedicated to the memory of Pierre Rosenstiehl. Eur. J. Comb. 119: 103800 (2024) - [j67]Robert Cori, Yiting Jiang, Patrice Ossona de Mendez, Pierre Rosenstiehl:
A few words about maps. Eur. J. Comb. 119: 103810 (2024) - [j66]Édouard Bonnet
Twin-Width IV: Ordered Graphs and Matrices. J. ACM 71(3): 21 (2024) - [j65]Mario Grobler, Yiting Jiang, Patrice Ossona de Mendez, Sebastian Siebertz
Discrepancy and sparsity. J. Comb. Theory B 169: 96-133 (2024) - [j64]Édouard Bonnet, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz, Stéphan Thomassé:
Twin-width and permutations. Log. Methods Comput. Sci. 20(3) (2024) - 2023
- [j63]Marthe Bonamy, Patrice Ossona de Mendez, Éric Colin de Verdière, Mathilde Bouvel:
Forty years of history. Eur. J. Comb. 111: 103689 (2023) - [j62]Yiting Jiang
From χ- to χp-bounded classes. J. Comb. Theory B 158(Part): 186-209 (2023) - [c22]Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Stéphan Thomassé:
Twin-Width V: Linear Minors, Modular Counting, and Matrix Multiplication. STACS 2023: 15:1-15:16 - [i23]Pedro P. Cortés, Pankaj Kumar, Benjamin R. Moore, Patrice Ossona de Mendez, Daniel A. Quiroz:
Subchromatic numbers of powers of graphs with excluded minors. CoRR abs/2306.02195 (2023) - 2022
- [j61]Jan Dreier
Twin-width and generalized coloring numbers. Discret. Math. 345(3): 112746 (2022) - [c21]Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz:
Structural Properties of the First-Order Transduction Quasiorder. CSL 2022: 31:1-31:16 - [c20]Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Torunczyk:
Twin-width IV: ordered graphs and matrices. STOC 2022: 924-937 - [i22]Michal Pilipczuk, Patrice Ossona de Mendez, Sebastian Siebertz:
Transducing paths in graph classes with unbounded shrubdepth. CoRR abs/2203.16900 (2022) - [i21]Ozan Heydt, Simeon Kublenz, Patrice Ossona de Mendez, Sebastian Siebertz, Alexandre Vigny:
Distributed domination on sparse graph classes. CoRR abs/2207.02669 (2022) - [i20]Samuel Braunfeld
On the first-order transduction quasiorder of hereditary classes of graphs. CoRR abs/2208.14412 (2022) - [i19]Samuel Braunfeld
Decomposition horizons: from graph sparsity to model-theoretic dividing lines. CoRR abs/2209.11229 (2022) - [i18]Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Stéphan Thomassé:
Twin-width V: linear minors, modular counting, and matrix multiplication. CoRR abs/2209.12023 (2022) - [i17]Jarik Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz:
Modulo-Counting First-Order Logic on Bounded Expansion Classes. CoRR abs/2211.03704 (2022) - 2021
- [j60]Jaroslav Nesetril
Classes of graphs with low complexity: The case of classes with bounded linear rankwidth. Eur. J. Comb. 91: 103223 (2021) - [c19]Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz:
Rankwidth meets stability. SODA 2021: 2014-2033 - [c18]Patrice Ossona de Mendez:
First-Order Transductions of Graphs (Invited Talk). STACS 2021: 2:1-2:7 - [i16]Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Torunczyk:
Twin-width IV: ordered graphs and matrices. CoRR abs/2102.03117 (2021) - [i15]Édouard Bonnet, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz, Stéphan Thomassé:
Twin-width and permutations. CoRR abs/2102.06880 (2021) - [i14]Mario Grobler, Patrice Ossona de Mendez, Sebastian Siebertz, Alexandre Vigny:
On the discrepancy of set systems definable in sparse graph classes. CoRR abs/2105.03693 (2021) - 2020
- [j59]Zdenek Dvorák
1-Subdivisions, the Fractional Chromatic Number and the Hall Ratio. Comb. 40(6): 759-774 (2020) - [j58]Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Xuding Zhu:
Clustering Powers of Sparse Graphs. Electron. J. Comb. 27(4): 4 (2020) - [j57]Kord Eickmeyer
Model-Checking on Ordered Structures. ACM Trans. Comput. Log. 21(2): 11:1-11:28 (2020) - [j56]Jakub Gajarský
First-Order Interpretations of Bounded Expansion Classes. ACM Trans. Comput. Log. 21(4): 29:1-29:41 (2020) - [c17]Jaroslav Nesetril, Roman Rabinovich, Patrice Ossona de Mendez
Linear rankwidth meets stability. SODA 2020: 1180-1199 - [i13]Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Xuding Zhu:
Clustering powers of sparse graphs. CoRR abs/2003.03605 (2020) - [i12]Yiting Jiang, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz:
Regular partitions of gentle graphs. CoRR abs/2003.11692 (2020) - [i11]Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz:
Rankwidth meets stability. CoRR abs/2007.07857 (2020) - [i10]Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz:
Towards an arboretum of monadically stable classes of graphs. CoRR abs/2010.02607 (2020)
2010 – 2019
- 2019
- [j55]Patrice Ossona de Mendez
Defective Colouring of Graphs Excluding A Subgraph or Minor. Comb. 39(2): 377-410 (2019) - [j54]Gwenaël Joret, Piotr Micek, Patrice Ossona de Mendez, Veit Wiechert:
Nowhere Dense Graph Classes and Dimension. Comb. 39(5): 1055-1079 (2019) - [j53]Jaroslav Nesetril, Patrice Ossona de Mendez
Existence of Modeling Limits for sequences of Sparse Structures. J. Symb. Log. 84(2): 452-472 (2019) - [j52]Robert Ganian, Petr Hlinený
Shrub-depth: Capturing Height of Dense Graphs. Log. Methods Comput. Sci. 15(1) (2019) - [c16]Stephan Kreutzer, Irene Muzi, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz
Algorithmic Properties of Sparse Digraphs. STACS 2019: 46:1-46:20 - [i9]Jaroslav Nesetril, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz:
Classes of graphs with low complexity: the case of classes with bounded linear rankwidth. CoRR abs/1909.01564 (2019) - [i8]Jaroslav Nesetril, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz:
Linear rankwidth meets stability. CoRR abs/1911.07748 (2019) - 2018
- [c15]Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez
First-Order Interpretations of Bounded Expansion Classes. ICALP 2018: 126:1-126:14 - [c14]Saeed Akhoondian Amiri, Patrice Ossona de Mendez
Distributed Domination on Graph Classes of Bounded Expansion. SPAA 2018: 143-151 - [i7]Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
First-order interpretations of bounded expansion classes. CoRR abs/1810.02389 (2018) - [i6]Kord Eickmeyer, Jan van den Heuvel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Patrice Ossona de Mendez, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz:
Model-Checking on Ordered Structures. CoRR abs/1812.08003 (2018) - 2017
- [j51]Pierre Charbit
Limits of structures and the example of tree semi-lattices. Discret. Math. 340(10): 2589-2603 (2017) - [j50]Patrice Ossona de Mendez
Announcement from the Editors. Eur. J. Comb. 62: 286 (2017) - [j49]Jan van den Heuvel
On the generalised colouring numbers of graphs that exclude a fixed minor. Eur. J. Comb. 66: 129-144 (2017) - [j48]Lucas Hosseini, Jaroslav Nesetril
Limits of mappings. Eur. J. Comb. 66: 145-159 (2017) - [j47]Jaroslav Nesetril
Cluster analysis of local convergent sequences of structures. Random Struct. Algorithms 51(4): 674-728 (2017) - [c13]John Gimbel, Patrice Ossona de Mendez
Obstacle Numbers of Planar Graphs. GD 2017: 67-80 - [i5]Saeed Akhoondian Amiri, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz:
Distributed Domination on Graph Classes of Bounded Expansion. CoRR abs/1702.02848 (2017) - [i4]Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez:
Shrub-depth: Capturing Height of Dense Graphs. CoRR abs/1707.00359 (2017) - [i3]Stephan Kreutzer, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz:
Algorithmic Properties of Sparse Digraphs. CoRR abs/1707.01701 (2017) - [i2]Gwenaël Joret, Piotr Micek, Patrice Ossona de Mendez, Veit Wiechert:
Nowhere Dense Graph Classes and Dimension. CoRR abs/1708.05424 (2017) - 2016
- [j46]Jérémie Chalopin, Louis Esperet, Zhentao Li, Patrice Ossona de Mendez:
Restricted Frame Graphs and a Conjecture of Scott. Electron. J. Comb. 23(1): 1 (2016) - [j45]Jaroslav Nesetril, Patrice Ossona de Mendez:
Modeling Limits in Hereditary Classes: Reduction and Application to Trees. Electron. J. Comb. 23(2): 2 (2016) - [j44]Jaroslav Nesetril
A distributed low tree-depth decomposition algorithm for bounded expansion classes. Distributed Comput. 29(1): 39-49 (2016) - [j43]Jaroslav Nesetril
First-order limits, an analytical perspective. Eur. J. Comb. 52: 368-388 (2016) - [j42]Andrew J. Goodall
Strongly polynomial sequences as interpretations. J. Appl. Log. 18: 129-149 (2016) - [i1]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. CoRR abs/1602.09052 (2016) - 2015
- [j41]Patrice Ossona de Mendez
Foreword. Eur. J. Comb. 48: 1 (2015) - [j40]Jan van den Heuvel, Patrice Ossona de Mendez
On the generalised colouring numbers of graphs that exclude a fixed minor. Electron. Notes Discret. Math. 49: 523-530 (2015) - [j39]Jaroslav Nesetril
Structural Limits and Approximations of Mappings. Electron. Notes Discret. Math. 49: 531-539 (2015) - [j38]Jaroslav Nesetril
On Low Tree-Depth Decompositions. Graphs Comb. 31(6): 1941-1963 (2015) - [j37]Jaroslav Nesetril
A Note on Circular Chromatic Number of Graphs with Large Girth and Similar Problems. J. Graph Theory 80(4): 268-276 (2015) - 2014
- [j36]Jaroslav Nesetril
Colouring edges with many colours in cycles. J. Comb. Theory B 109: 102-119 (2014) - [p1]Jaroslav Nesetril, Patrice Ossona de Mendez:
On first-order definable colorings. Geometry, Structure and Randomness in Combinatorics 2014: 99-122 - 2013
- [r1]Hubert de Fraysseix, Patrice Ossona de Mendez:
PIGALE. Handbook of Graph Drawing and Visualization 2013: 599-620 - 2012
- [b1]Jaroslav Nesetril, Patrice Ossona de Mendez:
Sparsity - Graphs, Structures, and Algorithms. Algorithms and combinatorics 28, Springer 2012, ISBN 978-3-642-27874-7, pp. I-XXIII, 1-457 - [j35]A. Machì, Jaroslav Nesetril
Preface. Eur. J. Comb. 33(3): 277-278 (2012) - [j34]Hubert de Fraysseix, Patrice Ossona de Mendez
Trémaux trees and planarity. Eur. J. Comb. 33(3): 279-293 (2012) - [j33]Jaroslav Nesetril
Characterisations and examples of graph classes with bounded expansion. Eur. J. Comb. 33(3): 350-373 (2012) - [j32]Mickaël Montassier, Patrice Ossona de Mendez
Decomposing a graph into forests. J. Comb. Theory B 102(1): 38-52 (2012) - [c12]Robert Ganian
When Trees Grow Low: Shrubs and Fast MSO1. MFCS 2012: 419-430 - 2011
- [j31]Francesca Fiorenzi, Pascal Ochem, Patrice Ossona de Mendez
Thue choosability of trees. Discret. Appl. Math. 159(17): 2045-2049 (2011) - [j30]Jaroslav Nesetril
On nowhere dense graphs. Eur. J. Comb. 32(4): 600-617 (2011) - [j29]László Lovász, Jaroslav Nesetril
Preface. Eur. J. Comb. 32(7): 951-953 (2011) - [j28]Jaroslav Nesetril
How many F's are there in G? Eur. J. Comb. 32(7): 1126-1141 (2011) - 2010
- [j27]Jaroslav Nesetril
First order properties on nowhere dense structures. J. Symb. Log. 75(3): 868-887 (2010)
2000 – 2009
- 2009
- [j26]Jaroslav Nesetril
Fraternal augmentations, arrangeability and linear Ramsey numbers. Eur. J. Comb. 30(7): 1696-1703 (2009) - [j25]Jaroslav Nesetril
Counting Homomorphisms to Sparse Graphs. Electron. Notes Discret. Math. 34: 393-397 (2009) - 2008
- [j24]Jaroslav Nesetril
Grad and classes with bounded expansion I. Decompositions. Eur. J. Comb. 29(3): 760-776 (2008) - [j23]Jaroslav Nesetril
Grad and classes with bounded expansion II. Algorithmic aspects. Eur. J. Comb. 29(3): 777-791 (2008) - [j22]Jaroslav Nesetril
Grad and classes with bounded expansion III. Restricted graph homomorphism dualities. Eur. J. Comb. 29(4): 1012-1024 (2008) - [j21]Patrice Ossona de Mendez
Preface. Electron. Notes Discret. Math. 31: 1-4 (2008) - [j20]Frédéric Demangeon, Patrice Ossona de Mendez
... : The Way of the Bow. Electron. Notes Discret. Math. 31: 17 (2008) - 2007
- [j19]Hubert de Fraysseix, Patrice Ossona de Mendez
Representations by Contact and Intersection of Segments. Algorithmica 47(4): 453-463 (2007) - [j18]Hubert de Fraysseix, Patrice Ossona de Mendez
Barycentric systems and stretchability. Discret. Appl. Math. 155(9): 1079-1095 (2007) - [j17]Jaroslav Nesetril
Fraternal Augmentations of graphs, Coloration and Minors. Electron. Notes Discret. Math. 28: 223-230 (2007) - [c11]Hubert de Fraysseix, Patrice Ossona de Mendez
Representation of Planar Hypergraphs by Contacts of Triangles. GD 2007: 125-136 - 2006
- [j16]Jaroslav Nesetril
Tree-depth, subgraph coloring and homomorphism bounds. Eur. J. Comb. 27(6): 1022-1041 (2006) - [j15]Hubert de Fraysseix, Patrice Ossona de Mendez
Trémaux Trees and Planarity. Int. J. Found. Comput. Sci. 17(5): 1017-1030 (2006) - [j14]Jaroslav Nesetril
Folding. J. Comb. Theory B 96(5): 730-739 (2006) - [c10]Jaroslav Nesetril, Patrice Ossona de Mendez:
Linear time low tree-width partitions and algorithmic consequences. STOC 2006: 391-400 - 2005
- [j13]Jaroslav Nesetril
Cuts and bounds. Discret. Math. 302(1-3): 211-224 (2005) - [j12]Jaroslav Nesetril
The Grad of a Graph and Classes with Bounded Expansion. Electron. Notes Discret. Math. 22: 101-106 (2005) - 2004
- [j11]Patrice Ossona de Mendez, Pierre Rosenstiehl:
Transitivity And Connectivity Of Permutations. Comb. 24(3): 487-501 (2004) - [c9]Hubert de Fraysseix, Patrice Ossona de Mendez:
Contact and Intersection Representations. GD 2004: 217-227 - 2003
- [j10]Hubert de Fraysseix, Patrice Ossona de Mendez
On Cotree-Critical and DFS Cotree-Critical Graphs. J. Graph Algorithms Appl. 7(4): 411-427 (2003) - [c8]Hubert de Fraysseix, Patrice Ossona de Mendez:
Stretching of Jordan Arc Contact Systems. GD 2003: 71-85 - 2002
- [j9]Patrice Ossona de Mendez:
Realization of Posets. J. Graph Algorithms Appl. 6(1): 149-153 (2002) - [c7]Pascal Auillans, Patrice Ossona de Mendez, Pierre Rosenstiehl, Bernard Vatant:
A Formal Model for Topic Maps. ISWC 2002: 69-83 - 2001
- [j8]Hubert de Fraysseix, Patrice Ossona de Mendez
On topological aspects of orientations. Discret. Math. 229(1-3): 57-72 (2001) - [j7]Hubert de Fraysseix, Patrice Ossona de Mendez:
Connectivity of Planar Graphs. J. Graph Algorithms Appl. 5(5): 93-105 (2001) - [c6]Hubert de Fraysseix, Patrice Ossona de Mendez:
A Characterization of DFS Cotree Critical Graphs. GD 2001: 84-95 - 2000
- [j6]Patrice Ossona de Mendez
Coding Properties of Breadth-First Search Orderings. Electron. Notes Discret. Math. 5: 253-255 (2000)
1990 – 1999
- 1999
- [j5]Hubert de Fraysseix, Patrice Ossona de Mendez:
On a Characterization of Gauss Codes. Discret. Comput. Geom. 22(2): 287-295 (1999) - [c5]Patrice Ossona de Mendez
Geometric Realization of Simplicial Complexes. GD 1999: 323-332 - [c4]Patrice Ossona de Mendez:
The Reduced Genus of a Multigraph. STACS 1999: 16-31 - 1997
- [c3]Patrice Ossona de Mendez, Hubert de Fraysseix:
Intersection graphs of Jordan arcs. Contemporary Trends in Discrete Mathematics 1997: 11-28 - [c2]Hubert de Fraysseix, Patrice Ossona de Mendez
A Short Proof of a Gauss Problem. GD 1997: 230-235 - 1996
- [j4]Hubert de Fraysseix, Patrice Ossona de Mendez
Planarity and Edge Poset Dimension. Eur. J. Comb. 17(8): 731-740 (1996) - 1995
- [j3]Hubert de Fraysseix, Patrice Ossona de Mendez
Bipolar orientations Revisited. Discret. Appl. Math. 56(2-3): 157-179 (1995) - [j2]Hubert de Fraysseix, Patrice Ossona de Mendez
A Left-First Search Algorithm for Planar Graphs. Discret. Comput. Geom. 13: 459-468 (1995) - 1994
- [j1]Hubert de Fraysseix, Patrice Ossona de Mendez
On Triangle Contact Graphs. Comb. Probab. Comput. 3: 233-246 (1994) - [c1]Hubert de Fraysseix, Patrice Ossona de Mendez
Regular Orientations, Arboricity, and Augmentation. GD 1994: 111-118
Coauthor Index
Jaroslav Nesetril
aka: Jarik Nesetril
aka: Jarik Nesetril
[j68] [j64] [j62] [c21] [i20] [i19] [i17] [j60] [c19] [i15] [j58] [j56] [c17] [i13] [i12] [i11] [i10] [j53] [j52] [i9] [i8] [c15] [i7] [j48] [j47] [i4] [j45] [j44] [j43] [j42] [j39] [j38] [j37] [j36] [p1] [b1] [j35] [j33] [c12] [j30] [j29] [j28] [j27] [j26] [j25] [j24] [j23] [j22] [j17] [j16] [j14] [c10] [j13] [j12]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-04 20:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: