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)

Dominance Based Monte Carlo Algorithm for Preference Elicitation in the Multi-criteria Sorting Problem: Some Performance Tests. - Tom Denat; Meltem Öztürk (ADT, 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 (2017)

Average-case complexity of a branch-and-bound algorithm for min dominating set. - Tom Denat; Ararat Harutyunyan; Vangelis Th. Paschos (CoRR, 2019)

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., 2024)