François Nicolas

According to our database1, François Nicolas authored at least 26 papers between 2001 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Contrast-Enhanced Brain MRI Synthesis With Deep Learning: Key Input Modalities and Asymptotic Performance.
Proceedings of the 18th IEEE International Symposium on Biomedical Imaging, 2021

2014
Tighter Undecidability Bounds for Matrix Mortality, Zero-in-the-Corner Problems, and More.
CoRR, 2014

2013
Finding Maximum Colorful Subtrees in Practice.
J. Comput. Biol., 2013

2012
On the decidability of semigroup freeness.
RAIRO Theor. Informatics Appl., 2012

2011
Intractability of the Minimum-Flip Supertree problem and its variants
CoRR, 2011

Various complexity results for computational mass spectrometry problems
CoRR, 2011

2010
On the complexity of finding gapped motifs.
J. Discrete Algorithms, 2010

2009
Efficient construction of maximal and minimal representations of motifs of a string.
Theor. Comput. Sci., 2009

Linear time 3-approximation for the MAST problem.
ACM Trans. Algorithms, 2009

On Uniformly Recurrent Morphic Sequences.
Int. J. Found. Comput. Sci., 2009

On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems.
Discret. Appl. Math., 2009

On polynomial growth functions of D0L-systems
CoRR, 2009

On the Morse-Hedlund complexity gap
CoRR, 2009

2008
Hardness of optimal spaced seed design.
J. Comput. Syst. Sci., 2008

A simple, polynomial-time algorithm for the matrix torsion problem
CoRR, 2008

Asymptotic behavior of growth functions of D0L-systems
CoRR, 2008

(Generalized) Post Correspondence Problem and semi-Thue systems
CoRR, 2008

2007
Longest common subsequence problem for unoriented and cyclic strings.
Theor. Comput. Sci., 2007

Maximum agreement and compatible supertrees.
J. Discrete Algorithms, 2007

2006
Improved Parameterized Complexity of the Maximum Agreement Subtree and Maximum Compatible Tree Problems.
IEEE ACM Trans. Comput. Biol. Bioinform., 2006

Solving the Maximum Agreement SubTree and the Maximum Compatible Tree Problems on Many Bounded Degree Trees.
Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

2005
Hardness results for the center and median string problems under the weighted and unweighted edit distances.
J. Discrete Algorithms, 2005

On the Approximation of Computing Evolutionary Trees.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
Maximum Agreement and Compatible Supertrees (Extended Abstract).
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

2003
Complexities of the Centre and Median String Problems.
Proceedings of the Combinatorial Pattern Matching, 14th Annual Symposium, 2003

2001
Radiation Control on Multi-Loudspeaker Device : La Timée.
Proceedings of the 2001 International Computer Music Conference, 2001


  Loading...