1. Interpreting nowhere dense graph classes as a classical notion of model theory
2. Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths
3. Second-order quantifiers and the complexity of theories.
4. Achim Blumensath and Bruno Courcelle . 2010. On the Monadic Second-Order Transduction Hierarchy. Log. Methods Comput. Sci. 6, 2 ( 2010 ). https://doi.org/10.2168/LMCS-6(2:2)2010 Achim Blumensath and Bruno Courcelle. 2010. On the Monadic Second-Order Transduction Hierarchy. Log. Methods Comput. Sci. 6, 2 (2010). https://doi.org/10.2168/LMCS-6(2:2)2010
5. Marthe Bonamy and Michał Pilipczuk . 2020. Graphs of bounded cliquewidth are polynomially χ-bounded. Advances in Combinatorics2020:8 ( 2020 ). Marthe Bonamy and Michał Pilipczuk. 2020. Graphs of bounded cliquewidth are polynomially χ-bounded. Advances in Combinatorics2020:8 (2020).