Complexity and inapproximability results for balanced connected subgraph problem. - Timothée Martinod; Valentin Pollet; Benoît Darties; Rodolphe Giroudeau; Jean-Claude König (Theor. Comput. Sci., 2021)

On the complexity of independent dominating set with obligations in graphs. - Christian Laforest; Timothée Martinod (Theor. Comput. Sci., 2022)

Introduction to Routing Problems with Mandatory Transitions. - Christian Laforest; Timothée Martinod (SOFSEM, 2023)

Étude de complexité algorithmique pour des problèmes de domination et de tournées dans les graphes avec obligations. (Algorithmic complexity study for domination and routing problems in graphs with obligations). - Timothée Martinod (2023)

Making Graphs Irregular through Irregularising Walks. - Julien Bensmail; Romain Bourneuf; Paul Colinot; Samuel Humeau 002; Timothée Martinod (CoRR, 2025)