Thomas Bellitto

39 papers B 4C 1Journal 31Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Inversion diameter and 2-edge-colored homomorphisms.
CoRR
Carmen Arana, Thomas Bellitto, Hector Buffière, Quentin Chuet, Théo Pierron, Amadeus Reinald
2025 B conf
Canadian Traveler Problems in Temporal Graphs.
WG
Thomas Bellitto, Johanne Cohen, Bruno Escoffier, Minh-Hang Nguyen, Mikaël Rabie
2025 — conf
Temporal Connectivity Augmentation.
SAND
Thomas Bellitto, Jules Bouton Popper, Bruno Escoffier
2025 J jnl
Temporal Connectivity Augmentation.
CoRR
Thomas Bellitto, Jules Bouton Popper, Bruno Escoffier
2024 J jnl
Canadian Traveller Problems in Temporal Graphs.
CoRR
Thomas Bellitto, Johanne Cohen, Bruno Escoffier, Minh-Hang Nguyen, Mikaël Rabie
2024 J jnl
On the Minimum Number of Arcs in \(\boldsymbol{k}\)-Dicritical Oriented Graphs.
SIAM J. Discret. Math.
Pierre Aboulker, Thomas Bellitto, Frédéric Havet, Clément Rambaud
2023 J jnl
Homomorphically Full Oriented Graphs.
Discret. Math. Theor. Comput. Sci.
Thomas Bellitto, Christopher Duffy, Gary MacGillivray
2023 J jnl
Locating-dominating sets in local tournaments.
Discret. Appl. Math.
Thomas Bellitto, Caroline Brosse, Benjamin Lévêque, Aline Parreau
2023 — conf
Restless Exploration of Periodic Temporal Graphs.
SAND
Thomas Bellitto, Cyril Conchon-Kerjan, Bruno Escoffier
2023 J jnl
The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs.
Algorithmica
Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge
2023 J jnl
The smallest 5-chromatic tournament.
Math. Comput.
Thomas Bellitto, Nicolas Bousquet, Adam Kabela, Théo Pierron
2022 J jnl
Homomorphically Full Oriented Graphs.
CoRR
Thomas Bellitto, Christopher Duffy, Gary MacGillivray
2022 J jnl
On the minimum number of arcs in k-dicritical oriented graphs.
CoRR
Pierre Aboulker, Thomas Bellitto, Frédéric Havet, Clément Rambaud
2022 J jnl
The smallest 5-chromatic tournament.
CoRR
Thomas Bellitto, Nicolas Bousquet, Adam Kabela, Théo Pierron
2021 B conf
Close Relatives (Of Feedback Vertex Set), Revisited.
IPEC
Hugo Jacob, Thomas Bellitto, Oscar Defrain, Marcin Pilipczuk
2021 J jnl
Close relatives (of Feedback Vertex Set), revisited.
CoRR
Hugo Jacob, Thomas Bellitto, Oscar Defrain, Marcin Pilipczuk
2021 J jnl
Counterexamples to Thomassen's Conjecture on Decomposition of Cubic Graphs.
Graphs Comb.
Thomas Bellitto, Tereza Klimosová, Martin Merker, Marcin Witkowski, Yelena Yuditsky
2021 J jnl
Locating Dominating Sets in local tournaments.
CoRR
Thomas Bellitto, Caroline Brosse, Benjamin Lévêque, Aline Parreau
2021 J jnl
On Supereulerian 2-Edge-Coloured Graphs.
Graphs Comb.
Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo
2021 J jnl
On the density of sets of the Euclidean plane avoiding distance 1.
Discret. Math. Theor. Comput. Sci.
Thomas Bellitto, Arnaud Pêcher, Antoine Sédillot
2021 J jnl
Proper-walk connection number of graphs.
J. Graph Theory
Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo
2020 J jnl
Hajós and Ore Constructions for Digraphs.
Electron. J. Comb.
Jørgen Bang-Jensen, Thomas Bellitto, Thomas Schweser, Michael Stiebitz
2020 J jnl
On DP-coloring of digraphs.
J. Graph Theory
Jørgen Bang-Jensen, Thomas Bellitto, Thomas Schweser, Michael Stiebitz
2020 B conf
The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs.
ISAAC
Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge
2020 J jnl
The Complexity of Connectivity Problems in Forbidden-Transition Graphs and Edge-Colored Graphs.
CoRR
Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge
2020 J jnl
The directed 2-linkage problem with length constraints.
Theor. Comput. Sci.
Jørgen Bang-Jensen, Thomas Bellitto, William Lochet, Anders Yeo
2019 J jnl
Connecting edge-colouring.
CoRR
Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo
2019 J jnl
On the Density of Sets Avoiding Parallelohedron Distance 1.
Discret. Comput. Geom.
Christine Bachoc, Thomas Bellitto, Philippe Moustrou, Arnaud Pêcher
2019 J jnl
The directed 2-linkage problem with length constraints.
CoRR
Jørgen Bang-Jensen, Thomas Bellitto, William Lochet, Anders Yeo
2018 J jnl
Complexity of locally-injective homomorphisms to tournaments.
Discret. Math. Theor. Comput. Sci.
Stefan Bard, Thomas Bellitto, Christopher Duffy, Gary MacGillivray, Feiran Yang
2018 B conf
On Minimum Connecting Transition Sets in Graphs.
WG
Thomas Bellitto, Benjamin Bergougnoux
2018 J jnl
On Minimum Connecting Transition Sets in Graphs.
CoRR
Thomas Bellitto, Benjamin Bergougnoux
2018 J jnl
On the density of sets of the Euclidean plane avoiding distance 1.
CoRR
Thomas Bellitto, Arnaud Pêcher, Antoine Sédillot
2018 J jnl
Separating codes and traffic monitoring.
Theor. Comput. Sci.
Thomas Bellitto
2018 — —
Walks, Transitions and Geometric Distances in Graphs. (Marches, Transitions et Distances Géométriques dans les Graphes).
Thomas Bellitto
2017 J jnl
Complexity of locally-injective homomorphisms to tournaments.
CoRR
Stefan Bard, Thomas Bellitto, Christopher Duffy, Gary MacGillivray, Feiran Yang
2016 C conf
Separating Codes and Traffic Monitoring.
AAIM
Thomas Bellitto
2015 J jnl
Next generation cluster editing.
PeerJ Prepr.
Thomas Bellitto, Tobias Marschall, Alexander Schönhuth, Gunnar W. Klau
2013 J jnl
Next Generation Cluster Editing.
CoRR
Thomas Bellitto, Tobias Marschall, Alexander Schönhuth, Gunnar W. Klau