Suivre
Davot Tom
Davot Tom
Heudiasyc
Adresse e-mail validée de hds.utc.fr - Page d'accueil
Titre
Citée par
Citée par
Année
A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions
O Baudon, J Bensmail, T Davot, H Hocquard, J Przybyło, M Senhaji, ...
Discrete Mathematics & Theoretical Computer Science 21, 2019
182019
On the approximation hardness of geodetic set and its variants
T Davot, L Isenmann, J Thiebaut
Computing and Combinatorics: 27th International Conference, COCOON 2021 …, 2021
112021
New results about the linearization of scaffolds sharing repeated contigs
D Tabary, T Davot, M Weller, A Chateau, R Giroudeau
Combinatorial Optimization and Applications: 12th International Conference …, 2018
42018
On the hardness of approximating Linearization of Scaffolds sharing Repeated Contigs
T Davot, A Chateau, R Giroudeau, M Weller
Comparative Genomics: 16th International Conference, RECOMB-CG 2018, Magog …, 2018
42018
Degreewidth: A New Parameter for Solving Problems on Tournaments
T Davot, L Isenmann, S Roy, J Thiebaut
International Workshop on Graph-Theoretic Concepts in Computer Science, 246-260, 2023
32023
Linearizing genomes: Exact methods and local search
T Davot, A Chateau, R Giroudeau, M Weller
SOFSEM 2020: Theory and Practice of Computer Science: 46th International …, 2020
32020
On the enumeration of non-dominated spanning trees with imprecise weights
T Davot, S Destercke, D Savourey
European Conference on Symbolic and Quantitative Approaches with Uncertainty …, 2023
22023
New polynomial-time algorithm around the scaffolding problem
T Davot, A Chateau, R Giroudeau, M Weller
International Conference on Algorithms for Computational Biology, 25-38, 2019
22019
On the Complexity of 2-club Cluster Editing with Vertex Splitting
FN Abu-Khzam, T Davot, L Isenmann, S Thoumi
arXiv preprint arXiv:2411.04846, 2024
12024
On a greedy approach for genome scaffolding
T Davot, A Chateau, R Fossé, R Giroudeau, M Weller
Algorithms for Molecular Biology 17 (1), 16, 2022
12022
Complexity and Approximation Results on the Shared Transportation Problem
T Davot, R Giroudeau, JC König
International Conference on Combinatorial Optimization and Applications, 140-151, 2021
12021
Efficient assembly consensus algorithms for divergent contig sets
A Chateau, T Davot, M Lafond
Computational Biology and Chemistry 93, 107516, 2021
12021
Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve
T Davot, J Enright, J Madathil, K Meeks
arXiv preprint arXiv:2412.09567, 2024
2024
Temporal Triadic Closure: Finding Dense Substructures in Social Networks That Evolve Over Time
T Davot, J Enright, J Madathil, K Meeks
2024
On the enumeration of non-dominated matroids with imprecise weights
T Davot, TA Vu, S Destercke, D Savourey
International Journal of Approximate Reasoning 174, 109266, 2024
2024
On the Shared Transportation Problem: Computational Hardness and Exact Approach
T Davot, R Giroudeau, JC König
International Journal of Foundations of Computer Science 35 (06), 741-756, 2024
2024
Ricochet Robots with Infinite Horizontal Board is Turing-complete
S Masseport, T Davot, R Giroudeau
Journal of Information Processing 31, 413-420, 2023
2023
K-partitioning with imprecise probabilistic edges
T Davot, S Destercke, D Savourey
International Conference on Soft Methods in Probability and Statistics, 87-95, 2022
2022
Producing Genomic Sequences after Genome Scaffolding with Ambiguous Paths: Complexity, Approximation and Lower Bounds
T Davot, A Chateau, R Giroudeau, M Weller, D Tabary
Algorithmica 83 (7), 2063-2095, 2021
2021
Towards perfect scaffolding: efficient, of good quality and guaranteed
T Davot
< bound method Organization. get_name_with_acronym of< Organization: TEL …, 2020
2020
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20