We prove that a number of computational problems that ask for the larges...
We consider the flip-width of geometric graphs, a notion of graph width
...
A class of graphs 𝒞 is monadically stable if for any unary
expansion 𝒞 o...
A grounded L-graph is the intersection graph of a collection of "L" shap...
Curve pseudo-visibility graphs generalize polygon and pseudo-polygon
vis...
Shrub-depth and rank-depth are dense analogues of the tree-depth of a gr...