Thomas Bellitto

According to our database, Thomas Bellitto authored at least 24 papers between 2015 and 2024.

Collaborative distances:

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

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

Canadian Traveller Problems in Temporal Graphs.

Thomas Bellitto, Johanne Cohen, Bruno Escoffier, Minh-Hang Nguyen, Mikaël Rabie

CoRR, 2024

2023

Locating-dominating sets in local tournaments.

Thomas Bellitto, Caroline Brosse, Benjamin Lévêque, Aline Parreau

Discret. Appl. Math., October, 2023

The smallest 5-chromatic tournament.

Thomas Bellitto, Nicolas Bousquet, Adam Kabela, Théo Pierron

Math. Comput., August, 2023

The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs.

Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge

Algorithmica, May, 2023

Homomorphically Full Oriented Graphs.

Thomas Bellitto, Christopher Duffy, Gary MacGillivray

Discret. Math. Theor. Comput. Sci., 2023

Restless Exploration of Periodic Temporal Graphs.

Thomas Bellitto, Cyril Conchon-Kerjan, Bruno Escoffier

Proceedings of the 2nd Symposium on Algorithmic Foundations of Dynamic Networks, 2023

2022

On the minimum number of arcs in k-dicritical oriented graphs.

Pierre Aboulker, Thomas Bellitto, Frédéric Havet, Clément Rambaud

CoRR, 2022

2021

Proper-walk connection number of graphs.

Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo

J. Graph Theory, 2021

Counterexamples to Thomassen's Conjecture on Decomposition of Cubic Graphs.

Thomas Bellitto, Tereza Klimosová, Martin Merker, Marcin Witkowski, Yelena Yuditsky

Graphs Comb., 2021

On Supereulerian 2-Edge-Coloured Graphs.

Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo

Graphs Comb., 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

Close Relatives (Of Feedback Vertex Set), Revisited.

Hugo Jacob, Thomas Bellitto, Oscar Defrain, Marcin Pilipczuk

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

2020

The directed 2-linkage problem with length constraints.

Jørgen Bang-Jensen, Thomas Bellitto, William Lochet, Anders Yeo

Theor. Comput. Sci., 2020

On DP-coloring of digraphs.

Jørgen Bang-Jensen, Thomas Bellitto, Thomas Schweser, Michael Stiebitz

J. Graph Theory, 2020

Hajós and Ore Constructions for Digraphs.

Jørgen Bang-Jensen, Thomas Bellitto, Thomas Schweser, Michael Stiebitz

Electron. J. Comb., 2020

The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs.

Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

2019

On the Density of Sets Avoiding Parallelohedron Distance 1.

Christine Bachoc, Thomas Bellitto, Philippe Moustrou, Arnaud Pêcher

Discret. Comput. Geom., 2019

Connecting edge-colouring.

Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo

CoRR, 2019

2018

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

Thomas Bellitto

PhD thesis, 2018

Separating codes and traffic monitoring.

Thomas Bellitto

Theor. Comput. Sci., 2018

Complexity of locally-injective homomorphisms to tournaments.

Stefan Bard, Thomas Bellitto, Christopher Duffy, Gary MacGillivray, Feiran Yang

Discret. Math. Theor. Comput. Sci., 2018

On Minimum Connecting Transition Sets in Graphs.

Thomas Bellitto, Benjamin Bergougnoux

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

2015

Next generation cluster editing.

Thomas Bellitto, Tobias Marschall, Alexander Schönhuth, Gunnar W. Klau

PeerJ Prepr., 2015