Mathieu RAFFINOT
Mathieu Raffinot Chargé de Recherches (CNRS)

Équipe LaBRI : Bench to Knowledge and Beyond
Fonction administrative :
Courrier électronique : mathieu.raffinotarobaselabri.fr
Bureau : 301
Tél : +33 (0)5 40 00 36 10


Extrait de publications


Geoffrey Solano, Guillaume Blin, Mathieu Raffinot, Jhoirene Clemente, Jaime Caro. On the Approximability of the Minimum Weight t-partite Clique Problem. Journal of Graph Algorithms and Applications, Brown University, 2020, 24 (3), pp.171-190.

Tristan Braquelaire, Marie Gasparoux, Mathieu Raffinot, Raluca Uricaru. On improving the approximation ratio of the r-shortest common superstring problem. 2019.

Tristan Braquelaire, Marie Gasparoux, Mathieu Raffinot, Raluca Uricaru. On the Shortest Common Superstring of NGS Reads. Theory and Applications of Models of Computation, Apr 2017, Bern, Switzerland. pp.97-111,

Ibrahim Chegrane, Djamal Belazzougui, Mathieu Raffinot. JQuery UI like approximate autocomplete. International Symposium on Web Algorithms, Jun 2015, Deauville, France.

Fabien de Montgolfier, Mathieu Raffinot, Irena Rusu. Easy identification of generalized common and conserved nested intervals. Journal of Computational Biology, Mary Ann Liebert, 2014, 21 (7), pp.520-533.


Page mise à jour le 13/08/2010 à 10:56