Next generation cluster editing. - Thomas Bellitto; Tobias Marschall; Alexander Schönhuth; Gunnar W. Klau (PeerJ Prepr., 2015)

On Minimum Connecting Transition Sets in Graphs. - Thomas Bellitto; Benjamin Bergougnoux (WG, 2018)

Complexity of locally-injective homomorphisms to tournaments. - Stefan Bard; Thomas Bellitto; Christopher Duffy 001; Gary MacGillivray; Feiran Yang 003 (Discret. Math. Theor. Comput. Sci., 2018)

Separating codes and traffic monitoring. - Thomas Bellitto (Theor. Comput. Sci., 2018)

Walks, Transitions and Geometric Distances in Graphs. (Marches, Transitions et Distances Géométriques dans les Graphes). - Thomas Bellitto (2018)

Connecting edge-colouring. - Jørgen Bang-Jensen; Thomas Bellitto; Anders Yeo (CoRR, 2019)

On the Density of Sets Avoiding Parallelohedron Distance 1. - Christine Bachoc; Thomas Bellitto; Philippe Moustrou; Arnaud Pêcher (Discret. Comput. Geom., 2019)

The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs. - Thomas Bellitto; Shaohua Li 005; Karolina Okrasa; Marcin Pilipczuk; Manuel Sorge (ISAAC, 2020)

Hajós and Ore Constructions for Digraphs. - Jørgen Bang-Jensen; Thomas Bellitto; Thomas Schweser; Michael Stiebitz (Electron. J. Comb., 2020)

On DP-coloring of digraphs. - Jørgen Bang-Jensen; Thomas Bellitto; Thomas Schweser; Michael Stiebitz (J. Graph Theory, 2020)

The directed 2-linkage problem with length constraints. - Jørgen Bang-Jensen; Thomas Bellitto; William Lochet; Anders Yeo (Theor. Comput. Sci., 2020)

Close Relatives (Of Feedback Vertex Set), Revisited. - Hugo Jacob 001; Thomas Bellitto; Oscar Defrain; Marcin Pilipczuk (IPEC, 2021)

On the density of sets of the Euclidean plane avoiding distance 1. - Thomas Bellitto; Arnaud Pêcher; Antoine Sédillot (Discret. Math. Theor. Comput. Sci., 2021)

On Supereulerian 2-Edge-Coloured Graphs. - Jørgen Bang-Jensen; Thomas Bellitto; Anders Yeo (Graphs Comb., 2021)

Counterexamples to Thomassen's Conjecture on Decomposition of Cubic Graphs. - Thomas Bellitto; Tereza Klimosová; Martin Merker; Marcin Witkowski; Yelena Yuditsky (Graphs Comb., 2021)

Proper-walk connection number of graphs. - Jørgen Bang-Jensen; Thomas Bellitto; Anders Yeo (J. Graph Theory, 2021)

On the minimum number of arcs in k-dicritical oriented graphs. - Pierre Aboulker; Thomas Bellitto; Frédéric Havet; Clément Rambaud (CoRR, 2022)

Restless Exploration of Periodic Temporal Graphs. - Thomas Bellitto; Cyril Conchon-Kerjan; Bruno Escoffier (SAND, 2023)

Homomorphically Full Oriented Graphs. - Thomas Bellitto; Christopher Duffy 001; Gary MacGillivray (Discret. Math. Theor. Comput. Sci., 2023)

The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs. - Thomas Bellitto; Shaohua Li 005; Karolina Okrasa; Marcin Pilipczuk; Manuel Sorge (Algorithmica, 2023)

The smallest 5-chromatic tournament. - Thomas Bellitto; Nicolas Bousquet 001; Adam Kabela; Théo Pierron (Math. Comput., 2023)

Locating-dominating sets in local tournaments. - Thomas Bellitto; Caroline Brosse; Benjamin Lévêque; Aline Parreau (Discret. Appl. Math., 2023)

Canadian Traveller Problems in Temporal Graphs. - Thomas Bellitto; Johanne Cohen; Bruno Escoffier; Minh-Hang Nguyen; Mikaël Rabie (CoRR, 2024)

On the Minimum Number of Arcs in ( boldsymbol{k} )-Dicritical Oriented Graphs. - Pierre Aboulker; Thomas Bellitto; Frédéric Havet; Clément Rambaud (SIAM J. Discret. Math., 2024)

Temporal Connectivity Augmentation. - Thomas Bellitto; Jules Bouton Popper; Bruno Escoffier (SAND, 2025)