Current Algorithms for Detecting Subgraphs of Bounded Treewidth Are Probably Optimal. - Karl Bringmann; Jasper Slusallek (ICALP, 2021)

Computing Square Colorings on Bounded-Treewidth and Planar Graphs. - Akanksha Agrawal 001; Dániel Marx; Daniel Neuen; Jasper Slusallek (SODA, 2023)