18 citations · 30 across the 11 of their papers we have counts for
20 papers
A Logic for Minor-Free Graph Classes: Model Checking, Dependence, and Combinatorial Reconfiguration
Nikolas Mählmann, Patrice {Ossona de Mendez}, Nicole Schirrmacher +4
We introduce \emph{sub-connectivity logic}, denoted by , an extension of first-order logic for graphs with a specified set of admissible edges. Its additional…
A few words about maps
Robert Cori, Yiting Jiang, Patrice Ossona de Mendez +1
In this paper, we survey some properties, encoding, and bijections involving combinatorial maps, double occurrence words, and chord diagrams. We particularly study quasi-trees from…
Twin-width V: linear minors, modular counting, and matrix multiplication
Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez +1
We continue developing the theory around the twin-width of totally ordered binary structures, initiated in the previous paper of the series. We first introduce the notion of parity…
Twin-width and generalized coloring numbers
Jan Dreier, Jakub Gajarsky, Yiting Jiang +2
In this paper, we prove that a graph with no -subgraph and twin-width has -admissibility and -coloring numbers bounded from above by an exponential function…
Füredi-Hajnal and Stanley-Wilf conjectures in higher dimensions
Y. Jang, J. Nesetril, P. Ossona de Mendez
In this paper we discuss analogs of Füredi-Hajnal and Stanley-Wilf conjectures for -dimensional matrices with .
Twin-width IV: ordered graphs and matrices
Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez +3
We establish a list of characterizations of bounded twin-width for hereditary, totally ordered binary structures. This has several consequences. First, it allows us to show that a…