default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTom Davot
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Tom Davot, Tuan-Anh Vu, Sébastien Destercke
, David Savourey:
On the enumeration of non-dominated matroids with imprecise weights. Int. J. Approx. Reason. 174: 109266 (2024)- [j6]Tom Davot, Rodolphe Giroudeau, Jean-Claude König:
On the Shared Transportation Problem: Computational Hardness and Exact Approach. Int. J. Found. Comput. Sci. 35(6): 741-756 (2024) - [i3]Faisal N. Abu-Khzam, Tom Davot, Lucas Isenmann, Sergio Thoumi:
On the Complexity of 2-club Cluster Editing with Vertex Splitting. CoRR abs/2411.04846 (2024) - [i2]Tom Davot, Jessica A. Enright, Jayakrishnan Madathil, Kitty Meeks:
Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve. CoRR abs/2412.09567 (2024) - 2023
- [j5]Samuel Masseport, Tom Davot, Rodolphe Giroudeau:
Ricochet Robots with Infinite Horizontal Board is Turing-complete. J. Inf. Process. 31: 413-420 (2023) - [c8]Tom Davot, Sébastien Destercke, David Savourey:
On the Enumeration of Non-dominated Spanning Trees with Imprecise Weights. ECSQARU 2023: 348-358 - [c7]Tom Davot, Lucas Isenmann, Sanjukta Roy, Jocelyn Thiebaut:
Degreewidth: A New Parameter for Solving Problems on Tournaments. WG 2023: 246-260 - 2022
- [j4]Tom Davot, Annie Chateau, Rohan Fossé, Rodolphe Giroudeau, Mathias Weller:
On a greedy approach for genome scaffolding. Algorithms Mol. Biol. 17(1): 16 (2022) - [i1]Tom Davot, Lucas Isenmann, Sanjukta Roy, Jocelyn Thiebaut:
Degreewidth: a New Parameter for Solving Problems on Tournaments. CoRR abs/2212.06007 (2022) - 2021
- [j3]Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller, Dorine Tabary:
Producing Genomic Sequences after Genome Scaffolding with Ambiguous Paths: Complexity, Approximation and Lower Bounds. Algorithmica 83(7): 2063-2095 (2021) - [j2]Annie Chateau, Tom Davot, Manuel Lafond:
Efficient assembly consensus algorithms for divergent contig sets. Comput. Biol. Chem. 93: 107516 (2021) - [c6]Tom Davot, Rodolphe Giroudeau, Jean-Claude König:
Complexity and Approximation Results on the Shared Transportation Problem. COCOA 2021: 140-151 - [c5]Tom Davot, Lucas Isenmann, Jocelyn Thiebaut:
On the Approximation Hardness of Geodetic Set and Its Variants. COCOON 2021: 76-88 - 2020
- [b1]Tom Davot:
À la recherche de l'échafaudage parfait : efficace, de qualité et garanti. (Looking for the perfect scaffolding: efficient, quality and guaranteed). University of Montpellier, France, 2020 - [c4]Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
Linearizing Genomes: Exact Methods and Local Search. SOFSEM 2020: 505-518
2010 – 2019
- 2019
- [j1]Olivier Baudon, Julien Bensmail, Tom Davot, Hervé Hocquard, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak:
A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions. Discret. Math. Theor. Comput. Sci. 21(1) (2019) - [c3]Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
New Polynomial-Time Algorithm Around the Scaffolding Problem. AlCoB 2019: 25-38 - 2018
- [c2]Dorine Tabary, Tom Davot, Mathias Weller, Annie Chateau, Rodolphe Giroudeau:
New Results About the Linearization of Scaffolds Sharing Repeated Contigs. COCOA 2018: 94-107 - [c1]Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
On the Hardness of Approximating Linearization of Scaffolds Sharing Repeated Contigs. RECOMB-CG 2018: 91-107
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 2025-01-21 21:19 CET 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:
