Professor Uéverton Souza from the Ijnstitute of Computing of Fluminense Federal University was in a scientific visit to the Laboratoire d’Informatique, by Robotique et de Microelectronique de Montpellier (LIRMM – Université Montpellier), and promoted the continuity of his research project on algorithms and parameterized complexity, more specifically studies on vertex deletion problems in graphs with bounded treewidth to obtain free structures of certain induced subgraphs. From October 29 to November 6, 2019, in collaboration with prof. Ignasi Sau (LIRMM – Université Montpellier), single-exponential time algorithms have been developed with respect to the input graph treewidth for solving problems such as vertex deletion to obtain free graphs of independent induced sets of size k for all natural constant k .
