default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Bellitto
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Pierre Aboulker, Thomas Bellitto, Frédéric Havet, Clément Rambaud:
On the Minimum Number of Arcs in \(\boldsymbol{k}\)-Dicritical Oriented Graphs. SIAM J. Discret. Math. 38(2): 1863-1901 (2024)- [i14]Thomas Bellitto, Johanne Cohen, Bruno Escoffier, Minh-Hang Nguyen, Mikaël Rabie:
Canadian Traveller Problems in Temporal Graphs. CoRR abs/2407.16491 (2024) - 2023
- [j13]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): 1202-1250 (2023) - [j12]Thomas Bellitto, Caroline Brosse, Benjamin Lévêque, Aline Parreau:
Locating-dominating sets in local tournaments. Discret. Appl. Math. 337: 14-24 (2023) - [j11]Thomas Bellitto, Nicolas Bousquet, Adam Kabela, Théo Pierron:
The smallest 5-chromatic tournament. Math. Comput. 93(345): 443-458 (2023) - [c5]Thomas Bellitto, Cyril Conchon-Kerjan, Bruno Escoffier:
Restless Exploration of Periodic Temporal Graphs. SAND 2023: 13:1-13:15 - 2022
- [i13]Pierre Aboulker, Thomas Bellitto, Frédéric Havet, Clément Rambaud:
On the minimum number of arcs in k-dicritical oriented graphs. CoRR abs/2207.01051 (2022) - [i12]Thomas Bellitto, Christopher Duffy, Gary MacGillivray:
Homomorphically Full Oriented Graphs. CoRR abs/2208.10727 (2022) - [i11]Thomas Bellitto, Nicolas Bousquet, Adam Kabela, Théo Pierron:
The smallest 5-chromatic tournament. CoRR abs/2210.09936 (2022) - 2021
- [j10]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) - [j9]Thomas Bellitto, Tereza Klimosová, Martin Merker, Marcin Witkowski, Yelena Yuditsky:
Counterexamples to Thomassen's Conjecture on Decomposition of Cubic Graphs. Graphs Comb. 37(6): 2595-2599 (2021) - [j8]Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo:
On Supereulerian 2-Edge-Coloured Graphs. Graphs Comb. 37(6): 2601-2620 (2021) - [j7]Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo:
Proper-walk connection number of graphs. J. Graph Theory 96(1): 137-159 (2021) - [c4]Hugo Jacob, Thomas Bellitto, Oscar Defrain, Marcin Pilipczuk:
Close Relatives (Of Feedback Vertex Set), Revisited. IPEC 2021: 21:1-21:15 - [i10]Hugo Jacob, Thomas Bellitto, Oscar Defrain, Marcin Pilipczuk:
Close relatives (of Feedback Vertex Set), revisited. CoRR abs/2106.16015 (2021) - [i9]Thomas Bellitto, Caroline Brosse, Benjamin Lévêque, Aline Parreau:
Locating Dominating Sets in local tournaments. CoRR abs/2109.03102 (2021) - 2020
- [j6]Jørgen Bang-Jensen, Thomas Bellitto, Thomas Schweser, Michael Stiebitz:
Hajós and Ore Constructions for Digraphs. Electron. J. Comb. 27(1): 1 (2020) - [j5]Jørgen Bang-Jensen, Thomas Bellitto, Thomas Schweser, Michael Stiebitz:
On DP-coloring of digraphs. J. Graph Theory 95(1): 76-98 (2020) - [j4]Jørgen Bang-Jensen, Thomas Bellitto, William Lochet, Anders Yeo:
The directed 2-linkage problem with length constraints. Theor. Comput. Sci. 814: 69-73 (2020) - [c3]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: 59:1-59:15 - [i8]Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge:
The Complexity of Connectivity Problems in Forbidden-Transition Graphs and Edge-Colored Graphs. CoRR abs/2009.12892 (2020)
2010 – 2019
- 2019
- [j3]Christine Bachoc, Thomas Bellitto, Philippe Moustrou, Arnaud Pêcher:
On the Density of Sets Avoiding Parallelohedron Distance 1. Discret. Comput. Geom. 62(3): 497-524 (2019) - [i7]Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo:
Connecting edge-colouring. CoRR abs/1907.00428 (2019) - [i6]Jørgen Bang-Jensen, Thomas Bellitto, William Lochet, Anders Yeo:
The directed 2-linkage problem with length constraints. CoRR abs/1907.00817 (2019) - 2018
- [b1]Thomas Bellitto:
Walks, Transitions and Geometric Distances in Graphs. (Marches, Transitions et Distances Géométriques dans les Graphes). University of Bordeaux, France, 2018 - [j2]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) - [j1]Thomas Bellitto:
Separating codes and traffic monitoring. Theor. Comput. Sci. 717: 73-85 (2018) - [c2]Thomas Bellitto, Benjamin Bergougnoux:
On Minimum Connecting Transition Sets in Graphs. WG 2018: 40-51 - [i5]Thomas Bellitto, Benjamin Bergougnoux:
On Minimum Connecting Transition Sets in Graphs. CoRR abs/1807.08463 (2018) - [i4]Thomas Bellitto, Arnaud Pêcher, Antoine Sédillot:
On the density of sets of the Euclidean plane avoiding distance 1. CoRR abs/1810.00960 (2018) - 2017
- [i3]Stefan Bard, Thomas Bellitto, Christopher Duffy, Gary MacGillivray, Feiran Yang:
Complexity of locally-injective homomorphisms to tournaments. CoRR abs/1710.08825 (2017) - 2016
- [c1]Thomas Bellitto:
Separating Codes and Traffic Monitoring. AAIM 2016: 89-100 - 2015
- [i2]Thomas Bellitto, Tobias Marschall, Alexander Schönhuth, Gunnar W. Klau:
Next generation cluster editing. PeerJ Prepr. 3: e1301 (2015) - 2013
- [i1]Thomas Bellitto, Tobias Marschall, Alexander Schönhuth, Gunnar W. Klau:
Next Generation Cluster Editing. CoRR abs/1310.3353 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-18 23:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
