Patrice Ossona de Mendez

According to our database1, Patrice Ossona de Mendez authored at least 78 papers between 1994 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Linear rankwidth meets stability.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Shrub-depth: Capturing Height of Dense Graphs.
Logical Methods in Computer Science, 2019

Existence of Modeling Limits for sequences of Sparse Structures.
J. Symb. Log., 2019

Classes of graphs with low complexity: the case of classes with bounded linear rankwidth.
CoRR, 2019

Defective Colouring of Graphs Excluding A Subgraph or Minor.
Combinatorica, 2019

Nowhere Dense Graph Classes and Dimension.
Combinatorica, 2019

Algorithmic Properties of Sparse Digraphs.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

2018
Model-Checking on Ordered Structures.
CoRR, 2018

Distributed Domination on Graph Classes of Bounded Expansion.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

First-Order Interpretations of Bounded Expansion Classes.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Cluster analysis of local convergent sequences of structures.
Random Struct. Algorithms, 2017

Announcement from the Editors.
Eur. J. Comb., 2017

Limits of mappings.
Eur. J. Comb., 2017

On the generalised colouring numbers of graphs that exclude a fixed minor.
Eur. J. Comb., 2017

Limits of structures and the example of tree semi-lattices.
Discret. Math., 2017

Algorithmic Properties of Sparse Digraphs.
CoRR, 2017

Obstacle Numbers of Planar Graphs.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

2016
Strongly polynomial sequences as interpretations.
J. Appl. Log., 2016

First-order limits, an analytical perspective.
Eur. J. Comb., 2016

A distributed low tree-depth decomposition algorithm for bounded expansion classes.
Distributed Computing, 2016

Modeling Limits in Hereditary Classes: Reduction and Application to Trees.
Electr. J. Comb., 2016

Restricted Frame Graphs and a Conjecture of Scott.
Electr. J. Comb., 2016

2015
A Note on Circular Chromatic Number of Graphs with Large Girth and Similar Problems.
Journal of Graph Theory, 2015

On Low Tree-Depth Decompositions.
Graphs and Combinatorics, 2015

Structural Limits and Approximations of Mappings.
Electron. Notes Discret. Math., 2015

On the generalised colouring numbers of graphs that exclude a fixed minor.
Electron. Notes Discret. Math., 2015

Foreword.
Eur. J. Comb., 2015

2014
Colouring edges with many colours in cycles.
J. Comb. Theory, Ser. B, 2014

On first-order definable colorings.
Proceedings of the Geometry, Structure and Randomness in Combinatorics, 2014

2013
PIGALE.
Proceedings of the Handbook on Graph Drawing and Visualization., 2013

2012
Decomposing a graph into forests.
J. Comb. Theory, Ser. B, 2012

Characterisations and examples of graph classes with bounded expansion.
Eur. J. Comb., 2012

Preface.
Eur. J. Comb., 2012

Trémaux trees and planarity.
Eur. J. Comb., 2012

When Trees Grow Low: Shrubs and Fast MSO1.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Sparsity - Graphs, Structures, and Algorithms.
Algorithms and combinatorics 28, Springer, ISBN: 978-3-642-27874-7, 2012

2011
On nowhere dense graphs.
Eur. J. Comb., 2011

How many F's are there in G?
Eur. J. Comb., 2011

Preface.
Eur. J. Comb., 2011

Thue choosability of trees.
Discret. Appl. Math., 2011

2010
First order properties on nowhere dense structures.
J. Symb. Log., 2010

2009
Counting Homomorphisms to Sparse Graphs.
Electron. Notes Discret. Math., 2009

Fraternal augmentations, arrangeability and linear Ramsey numbers.
Eur. J. Comb., 2009

2008
Preface.
Electron. Notes Discret. Math., 2008

... : The Way of the Bow.
Electron. Notes Discret. Math., 2008

Grad and classes with bounded expansion III. Restricted graph homomorphism dualities.
Eur. J. Comb., 2008

Grad and classes with bounded expansion II. Algorithmic aspects.
Eur. J. Comb., 2008

Grad and classes with bounded expansion I. Decompositions.
Eur. J. Comb., 2008

2007
Fraternal Augmentations of graphs, Coloration and Minors.
Electron. Notes Discret. Math., 2007

Barycentric systems and stretchability.
Discret. Appl. Math., 2007

Representations by Contact and Intersection of Segments.
Algorithmica, 2007

Representation of Planar Hypergraphs by Contacts of Triangles.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

2006
Folding.
J. Comb. Theory, Ser. B, 2006

Trémaux Trees and Planarity.
Int. J. Found. Comput. Sci., 2006

Tree-depth, subgraph coloring and homomorphism bounds.
Eur. J. Comb., 2006

Linear time low tree-width partitions and algorithmic consequences.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

2005
The Grad of a Graph and Classes with Bounded Expansion.
Electron. Notes Discret. Math., 2005

Cuts and bounds.
Discret. Math., 2005

2004
Transitivity And Connectivity Of Permutations.
Combinatorica, 2004

Contact and Intersection Representations.
Proceedings of the Graph Drawing, 12th International Symposium, 2004

2003
On Cotree-Critical and DFS Cotree-Critical Graphs.
J. Graph Algorithms Appl., 2003

Stretching of Jordan Arc Contact Systems.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

2002
Realization of Posets.
J. Graph Algorithms Appl., 2002

A Formal Model for Topic Maps.
Proceedings of the Semantic Web, 2002

2001
Connectivity of Planar Graphs.
J. Graph Algorithms Appl., 2001

On topological aspects of orientations.
Discret. Math., 2001

A Characterization of DFS Cotree Critical Graphs.
Proceedings of the Graph Drawing, 9th International Symposium, 2001

2000
Coding Properties of Breadth-First Search Orderings.
Electron. Notes Discret. Math., 2000

1999
On a Characterization of Gauss Codes.
Discrete & Computational Geometry, 1999

The Reduced Genus of a Multigraph.
Proceedings of the STACS 99, 1999

Geometric Realization of Simplicial Complexes.
Proceedings of the Graph Drawing, 7th International Symposium, 1999

1997
A Short Proof of a Gauss Problem.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

Intersection graphs of Jordan arcs.
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1996
Planarity and Edge Poset Dimension.
Eur. J. Comb., 1996

1995
A Left-First Search Algorithm for Planar Graphs.
Discrete & Computational Geometry, 1995

Bipolar orientations Revisited.
Discret. Appl. Math., 1995

1994
On Triangle Contact Graphs.
Combinatorics, Probability & Computing, 1994

Regular Orientations, Arboricity, and Augmentation.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994


  Loading...