Thomas Bellitto

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 30

Top Venues

CoRR

J. Graph Theory

Theor. Comput. Sci.

Discret. Math. Theor. Comput. Sci.

University of Bordeaux, France (PHD)

Education History

University of Bordeaux, France

PHD

Publications

Thomas Bellitto, Johanne Cohen, Bruno Escoffier, Minh-Hang Nguyen, Mikaël Rabie
Canadian Traveller Problems in Temporal Graphs. CoRR (2024)
Thomas Bellitto, Caroline Brosse, Benjamin Lévêque, Aline Parreau
Locating-dominating sets in local tournaments. Discret. Appl. Math. 337 (2023)
Thomas Bellitto, Nicolas Bousquet, Adam Kabela, Théo Pierron
The smallest 5-chromatic tournament. Math. Comput. 93 (345) (2023)
Thomas Bellitto, Cyril Conchon-Kerjan, Bruno Escoffier
Restless Exploration of Periodic Temporal Graphs. SAND (2023)
Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge
The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs. Algorithmica 85 (5) (2023)
Thomas Bellitto, Christopher Duffy, Gary MacGillivray
Homomorphically Full Oriented Graphs. CoRR (2022)
Thomas Bellitto, Nicolas Bousquet, Adam Kabela, Théo Pierron
The smallest 5-chromatic tournament. CoRR (2022)
Pierre Aboulker, Thomas Bellitto, Frédéric Havet, Clément Rambaud
On the minimum number of arcs in k-dicritical oriented graphs. CoRR (2022)
Hugo Jacob, Thomas Bellitto, Oscar Defrain, Marcin Pilipczuk
Close relatives (of Feedback Vertex Set), revisited. CoRR (2021)
Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo
On Supereulerian 2-Edge-Coloured Graphs. Graphs Comb. 37 (6) (2021)
Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo
Proper-walk connection number of graphs. J. Graph Theory 96 (1) (2021)
Thomas Bellitto, Caroline Brosse, Benjamin Lévêque, Aline Parreau
Locating Dominating Sets in local tournaments. CoRR (2021)
Hugo Jacob, Thomas Bellitto, Oscar Defrain, Marcin Pilipczuk
Close Relatives (Of Feedback Vertex Set), Revisited. IPEC (2021)
Thomas Bellitto, Arnaud Pêcher, Antoine Sédillot
On the density of sets of the Euclidean plane avoiding distance 1. Discret. Math. Theor. Comput. Sci. 23 (1) (2021)
Thomas Bellitto, Tereza Klimosová, Martin Merker, Marcin Witkowski, Yelena Yuditsky
Counterexamples to Thomassen's Conjecture on Decomposition of Cubic Graphs. Graphs Comb. 37 (6) (2021)
Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge
The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs. ISAAC (2020)
Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge
The Complexity of Connectivity Problems in Forbidden-Transition Graphs and Edge-Colored Graphs. CoRR (2020)
Jørgen Bang-Jensen, Thomas Bellitto, Thomas Schweser, Michael Stiebitz
On DP-coloring of digraphs. J. Graph Theory 95 (1) (2020)
Jørgen Bang-Jensen, Thomas Bellitto, Thomas Schweser, Michael Stiebitz
Hajós and Ore Constructions for Digraphs. Electron. J. Comb. 27 (1) (2020)
Jørgen Bang-Jensen, Thomas Bellitto, William Lochet, Anders Yeo
The directed 2-linkage problem with length constraints. Theor. Comput. Sci. 814 (2020)
Christine Bachoc, Thomas Bellitto, Philippe Moustrou, Arnaud Pêcher
On the Density of Sets Avoiding Parallelohedron Distance 1. Discret. Comput. Geom. 62 (3) (2019)
Jørgen Bang-Jensen, Thomas Bellitto, William Lochet, Anders Yeo
The directed 2-linkage problem with length constraints. CoRR (2019)
Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo
Connecting edge-colouring. CoRR (2019)
Stefan Bard, Thomas Bellitto, Christopher Duffy, Gary MacGillivray, Feiran Yang
Complexity of locally-injective homomorphisms to tournaments. Discret. Math. Theor. Comput. Sci. 20 (2) (2018)
Thomas Bellitto
Separating codes and traffic monitoring. Theor. Comput. Sci. 717 (2018)
Thomas Bellitto, Benjamin Bergougnoux
On Minimum Connecting Transition Sets in Graphs. WG (2018)
Thomas Bellitto, Benjamin Bergougnoux
On Minimum Connecting Transition Sets in Graphs. CoRR (2018)
Thomas Bellitto, Arnaud Pêcher, Antoine Sédillot
On the density of sets of the Euclidean plane avoiding distance 1. CoRR (2018)
Stefan Bard, Thomas Bellitto, Christopher Duffy, Gary MacGillivray, Feiran Yang
Complexity of locally-injective homomorphisms to tournaments. CoRR (2017)
Thomas Bellitto
Separating Codes and Traffic Monitoring. AAIM (2016)
Thomas Bellitto, Tobias Marschall, Alexander Schönhuth, Gunnar W. Klau
Next generation cluster editing. PeerJ Prepr. 3 (2015)
Thomas Bellitto, Tobias Marschall, Alexander Schönhuth, Gunnar W. Klau
Next Generation Cluster Editing. CoRR (2013)

Thomas Bellitto.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Thomas Bellitto