2025
Transducing paths in graph classes with unbounded shrubdepth.
Eur. J. Comb., 2025
Distributed domination on sparse graph classes.
Eur. J. Comb., 2025
2024
Twin-Width IV: Ordered Graphs and Matrices.
J. ACM, June, 2024
Corrigendum to "Twin-width and generalized coloring numbers" [Discrete Math. 345 (3) (2022) 112746].
Discret. Math., January, 2024
Twin-width and permutations.
Log. Methods Comput. Sci., 2024
Discrepancy and sparsity.
J. Comb. Theory B, 2024
Special Issue dedicated to the memory of Pierre Rosenstiehl.
Eur. J. Comb., 2024
2023
Eur. J. Comb., June, 2023
From <i>χ</i>- to <i>χ</i><sub><i>p</i></sub>-bounded classes.
J. Comb. Theory B, 2023
Subchromatic numbers of powers of graphs with excluded minors.
CoRR, 2023
Twin-Width V: Linear Minors, Modular Counting, and Matrix Multiplication.
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023
2022
Twin-width and generalized coloring numbers.
Discret. Math., 2022
Modulo-Counting First-Order Logic on Bounded Expansion Classes.
CoRR, 2022
Decomposition horizons: from graph sparsity to model-theoretic dividing lines.
CoRR, 2022
On the first-order transduction quasiorder of hereditary classes of graphs.
CoRR, 2022
Structural Properties of the First-Order Transduction Quasiorder.
Proceedings of the 30th EACSL Annual Conference on Computer Science Logic, 2022
2021
Classes of graphs with low complexity: The case of classes with bounded linear rankwidth.
Eur. J. Comb., 2021
On the discrepancy of set systems definable in sparse graph classes.
CoRR, 2021
First-Order Transductions of Graphs (Invited Talk).
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021
Rankwidth meets stability.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
2020
First-Order Interpretations of Bounded Expansion Classes.
ACM Trans. Comput. Log., 2020
Model-Checking on Ordered Structures.
ACM Trans. Comput. Log., 2020
Towards an arboretum of monadically stable classes of graphs.
CoRR, 2020
Regular partitions of gentle graphs.
CoRR, 2020
Clustering Powers of Sparse Graphs.
Electron. J. Comb., 2020
1-Subdivisions, the Fractional Chromatic Number and the Hall Ratio.
Comb., 2020
Linear rankwidth meets stability.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
2019
Shrub-depth: Capturing Height of Dense Graphs.
Log. Methods Comput. Sci., 2019
Existence of Modeling Limits for sequences of Sparse Structures.
J. Symb. Log., 2019
Defective Colouring of Graphs Excluding A Subgraph or Minor.
Comb., 2019
Nowhere Dense Graph Classes and Dimension.
Comb., 2019
Algorithmic Properties of Sparse Digraphs.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019
2018
Distributed Domination on Graph Classes of Bounded Expansion.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018
2017
Cluster analysis of local convergent sequences of structures.
Random Struct. Algorithms, 2017
Announcement from the Editors.
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 Comput., 2016
Modeling Limits in Hereditary Classes: Reduction and Application to Trees.
Electron. J. Comb., 2016
Restricted Frame Graphs and a Conjecture of Scott.
Electron. J. Comb., 2016
2015
A Note on Circular Chromatic Number of Graphs with Large Girth and Similar Problems.
J. Graph Theory, 2015
On Low Tree-Depth Decompositions.
Graphs Comb., 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
2014
Colouring edges with many colours in cycles.
J. Comb. Theory B, 2014
On first-order definable colorings.
Proceedings of the Geometry, Structure and Randomness in Combinatorics, 2014
2013
Proceedings of the Handbook on Graph Drawing and Visualization., 2013
2012
Decomposing a graph into forests.
J. Comb. Theory B, 2012
Characterisations and examples of graph classes with bounded expansion.
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
How many F's are there in G?
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
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
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
2004
Transitivity And Connectivity Of Permutations.
Comb., 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
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.
Discret. Comput. Geom., 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.
Discret. Comput. Geom., 1995
Bipolar orientations Revisited.
Discret. Appl. Math., 1995
1994
On Triangle Contact Graphs.
Comb. Probab. Comput., 1994
Regular Orientations, Arboricity, and Augmentation.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994
