1. Aboulker, P., Adler, I., Kim, E.J., Sintiari, N.L.D., Trotignon, N.: On the tree-width of evenhole-free graphs. European J. Combin. 98, #103,394 (2021). DOI https://doi.org/10.1016/j.ejc.2021.103394
2. Abrishami, T., Alecu, B., Chudnovsky, M., Hajebi, S., Spirkl, S.: Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs (2022). URL https://arxiv.org/abs/2207.05538
3. Abrishami, T., Alecu, B., Chudnovsky, M., Hajebi, S., Spirkl, S., Vušković, K.: Induced subgraphs and tree decompositions V. One neighbor in a hole (2022). URL https://arxiv.org/abs/2205.04420
4. Abrishami, T., Chudnovsky, M., Dibek, C., Hajebi, S., Rzążewski, P., Spirkl, S., Vušković, K.: Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree (2021). URL https://arxiv.org/abs/2108.01162
5. Abrishami, T., Chudnovsky, M., Hajebi, S., Spirkl, S.: Induced subgraphs and tree decompositions III. Three-path-configurations and logarithmic treewidth. Adv. Comb. #6 (2022). DOI https://doi.org/10.19086/aic.2022.6