Radiation Control on Multi-Loudspeaker Device : La Timée. - Nicolas Misdariis; François Nicolas; Olivier Warusfel; René Caussé (ICMC, 2001)

Complexities of the Centre and Median String Problems. - François Nicolas; Eric Rivals (CPM, 2003)

Maximum Agreement and Compatible Supertrees (Extended Abstract). - Vincent Berry; François Nicolas (CPM, 2004)

On the Approximation of Computing Evolutionary Trees. - Vincent Berry; Sylvain Guillemot; François Nicolas; Christophe Paul (COCOON, 2005)

Hardness results for the center and median string problems under the weighted and unweighted edit distances. - François Nicolas; Eric Rivals (J. Discrete Algorithms, 2005)

Solving the Maximum Agreement SubTree and the Maximum Compatible Tree Problems on Many Bounded Degree Trees. - Sylvain Guillemot; François Nicolas (CPM, 2006)

Improved Parameterized Complexity of the Maximum Agreement Subtree and Maximum Compatible Tree Problems. - Vincent Berry; François Nicolas (IEEE ACM Trans. Comput. Biol. Bioinform., 2006)

Maximum agreement and compatible supertrees. - Vincent Berry; François Nicolas (J. Discrete Algorithms, 2007)

Longest common subsequence problem for unoriented and cyclic strings. - François Nicolas; Eric Rivals (Theor. Comput. Sci., 2007)

(Generalized) Post Correspondence Problem and semi-Thue systems - François Nicolas (CoRR, 2008)

Asymptotic behavior of growth functions of D0L-systems - Julien Cassaigne; Christian Mauduit; François Nicolas (CoRR, 2008)

A simple, polynomial-time algorithm for the matrix torsion problem - François Nicolas (CoRR, 2008)

Hardness of optimal spaced seed design. - François Nicolas; Eric Rivals (J. Comput. Syst. Sci., 2008)

On the Morse-Hedlund complexity gap - Julien Cassaigne; François Nicolas (CoRR, 2009)

On polynomial growth functions of D0L-systems - Julien Cassaigne; François Nicolas (CoRR, 2009)

On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems. - Sylvain Guillemot; François Nicolas; Vincent Berry; Christophe Paul (Discret. Appl. Math., 2009)

On Uniformly Recurrent Morphic Sequences. - François Nicolas; Yuri Pritykin (Int. J. Found. Comput. Sci., 2009)

Linear time 3-approximation for the MAST problem. - Vincent Berry; Christophe Paul; Sylvain Guillemot; François Nicolas (ACM Trans. Algorithms, 2009)

Efficient construction of maximal and minimal representations of motifs of a string. - François Nicolas; Veli Mäkinen; Esko Ukkonen (Theor. Comput. Sci., 2009)

On the complexity of finding gapped motifs. - Morris Michael; François Nicolas; Esko Ukkonen (J. Discrete Algorithms, 2010)

Various complexity results for computational mass spectrometry problems - François Nicolas; Sebastian Böcker (CoRR, 2011)

Intractability of the Minimum-Flip Supertree problem and its variants - Sebastian Böcker; Quang Bao Anh Bui; François Nicolas; Anke Truß (CoRR, 2011)

On the decidability of semigroup freeness. - Julien Cassaigne; François Nicolas (RAIRO Theor. Informatics Appl., 2012)

Finding Maximum Colorful Subtrees in Practice. - Imran Rauf; Florian Rasche; François Nicolas; Sebastian Böcker (J. Comput. Biol., 2013)

Tighter Undecidability Bounds for Matrix Mortality, Zero-in-the-Corner Problems, and More. - Julien Cassaigne; Vesa Halava; Tero Harju; François Nicolas (CoRR, 2014)

Contrast-Enhanced Brain MRI Synthesis With Deep Learning: Key Input Modalities and Asymptotic Performance. - Alexandre Bône; Samy Ammari; Jean-Philippe Lamarque; Mickael Elhaik; Emilie Chouzenoux; François Nicolas; Philippe Robert; Corinne Balleyguier; Nathalie Lassau; Marc-Michel Rohé (ISBI, 2021)