Tom Denat

According to our database, Tom Denat authored at least 5 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Average-case complexity of a branch-and-bound algorithm for Min Dominating Set.

Tom Denat, Ararat Harutyunyan, Nikolaos Melissinos, Vangelis Th. Paschos

Discret. Appl. Math., March, 2024

2019

Average-case complexity of a branch-and-bound algorithm for min dominating set.

Tom Denat, Ararat Harutyunyan, Vangelis Th. Paschos

CoRR, 2019

2017

Creation of a Biodiversity Severity Index to evaluate the risks of accidental pollutions in the industry : a multi-criteria sorting approach. (Création d'un indice de gravité sur la biodiversité pour évaluer les risques de pollutions accidentelles dans l'industrie : une approche de tri multi-critères).

Tom Denat

PhD thesis, 2017

Dominance Based Monte Carlo Algorithm for Preference Elicitation in the Multi-criteria Sorting Problem: Some Performance Tests.

Tom Denat, Meltem Öztürk

Proceedings of the Algorithmic Decision Theory - 5th International Conference, 2017

2015

Average-case complexity of a branch-and-bound algorithm for maximum independent set, under the $\mathcal{G}(n, p)$ random model.

Nicolas Bourgeois, R. Catellier, Tom Denat, Vangelis Th. Paschos

CoRR, 2015