A new paper extends Courcelle's theorem by proving that models of MSO2 formulas with free variables fit within decision diagrams of parameterized linear size. The researchers established specific upper bounds for sentential decision diagrams based on graph treewidth. This optimization reduces the memory overhead for checking graph properties in parameterized complexity.