Timothée Martinod

According to our database, Timothée Martinod authored at least 5 papers between 2021 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2026

Making graphs irregular through irregularising walks.

Julien Bensmail, Romain Bourneuf, Paul Colinot, Samuel Humeau, Timothée Martinod

Theor. Comput. Sci., 2026

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

PhD thesis, 2023

Introduction to Routing Problems with Mandatory Transitions.

Christian Laforest, Timothée Martinod

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

2022

On the complexity of independent dominating set with obligations in graphs.

Christian Laforest, Timothée Martinod

Theor. Comput. Sci., 2022

2021

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