Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size. - Mathieu Chapelle; Manfred Cochefert; Dieter Kratsch; Romain Letourneur; Mathieu Liedloff (IPEC, 2014)

On the number of minimal dominating sets on some graph classes. - Jean-François Couturier 001; Romain Letourneur; Mathieu Liedloff (Theor. Comput. Sci., 2015)

Algorithmes exacts et exponentiels pour des problèmes de graphes. (Exact exponential algorithms for solving graph problems summary). - Romain Letourneur (2015)

Exact exponential algorithms to find tropical connected sets of minimum size. - Mathieu Chapelle; Manfred Cochefert; Dieter Kratsch; Romain Letourneur; Mathieu Liedloff (Theor. Comput. Sci., 2017)

Exact algorithms for weak Roman domination. - Mathieu Chapelle; Manfred Cochefert; Jean-François Couturier 001; Dieter Kratsch; Romain Letourneur; Mathieu Liedloff; Anthony Perez 001 (Discret. Appl. Math., 2018)