4/10 - Hans L. Bodlaender: A Tourist Guide through Treewidth. Acta Cybern. 11(1-2): 1-21 (1993) (Martín, Martín, Tomás) [video] [pdf]
11/10 - Martin Charles Golumbic, Udi Rotics: On the Clique-Width of Some Perfect Graph Classes. Int. J. Found. Comput. Sci. 11(3): 423-443 (2000) (Juan Pablo, Micaela) [video] [pdf]
18/10 - Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics: Polynomial-time recognition of clique-width ≤3 graphs. Discret. Appl. Math. 160(6): 834-865 (2012) (Tomás, Antonio, Sofía) [video] [pdf]
25/10 - Sigve Hortemo Sæther, Jan Arne Telle: Between Treewidth and Clique-Width. Algorithmica 75(1): 218-253 (2016) (Pablo)
1/11 - Sigve Hortemo Sæther, Martin Vatshelle: Hardness of computing width parameters based on branch decompositions over the vertex set. Theor. Comput. Sci. 615: 120-125 (2016) (Marco, Ignacio) [video] [pdf]
8/11 - Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, Andreas Pavlogiannis: Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. ACM Trans. Program. Lang. Syst. 40(3): 9:1-9:43 (2018) (Nicolás, Sebastián y Romina) [video] [pdf]
15/11 - Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady: The treewidth of smart contracts. SAC 2019: 400-408 (Guillermo, Ezequiel, Gerónimo)