default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrançois Nicolas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c8]Alexandre Bône, Samy Ammari, Jean-Philippe Lamarque, Mickael Elhaik, Emilie Chouzenoux, François Nicolas, Philippe Robert, Corinne Balleyguier, Nathalie Lassau, Marc-Michel Rohé:
Contrast-Enhanced Brain MRI Synthesis With Deep Learning: Key Input Modalities and Asymptotic Performance. ISBI 2021: 1159-1163
2010 – 2019
- 2014
- [i10]Julien Cassaigne, Vesa Halava, Tero Harju, François Nicolas:
Tighter Undecidability Bounds for Matrix Mortality, Zero-in-the-Corner Problems, and More. CoRR abs/1404.0644 (2014) - 2013
- [j12]Imran Rauf, Florian Rasche, François Nicolas, Sebastian Böcker
:
Finding Maximum Colorful Subtrees in Practice. J. Comput. Biol. 20(4): 311-321 (2013) - 2012
- [j11]Julien Cassaigne, François Nicolas:
On the decidability of semigroup freeness. RAIRO Theor. Informatics Appl. 46(3): 355-399 (2012) - [c7]Imran Rauf, Florian Rasche, François Nicolas, Sebastian Böcker:
Finding Maximum Colorful Subtrees in Practice. RECOMB 2012: 213-223 - 2011
- [i9]François Nicolas, Sebastian Böcker:
Various complexity results for computational mass spectrometry problems. CoRR abs/1109.3367 (2011) - [i8]Sebastian Böcker, Quang Bao Anh Bui, François Nicolas, Anke Truß:
Intractability of the Minimum-Flip Supertree problem and its variants. CoRR abs/1112.4536 (2011) - 2010
- [j10]Morris Michael, François Nicolas, Esko Ukkonen:
On the complexity of finding gapped motifs. J. Discrete Algorithms 8(2): 131-142 (2010)
2000 – 2009
- 2009
- [j9]Sylvain Guillemot, François Nicolas, Vincent Berry, Christophe Paul:
On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems. Discret. Appl. Math. 157(7): 1555-1570 (2009) - [j8]François Nicolas, Yuri Pritykin:
On Uniformly Recurrent Morphic Sequences. Int. J. Found. Comput. Sci. 20(5): 919-940 (2009) - [j7]Vincent Berry, Christophe Paul, Sylvain Guillemot, François Nicolas:
Linear time 3-approximation for the MAST problem. ACM Trans. Algorithms 5(2): 23:1-23:18 (2009) - [j6]François Nicolas, Veli Mäkinen, Esko Ukkonen:
Efficient construction of maximal and minimal representations of motifs of a string. Theor. Comput. Sci. 410(30-32): 2999-3005 (2009) - [i7]Julien Cassaigne, François Nicolas:
On the Morse-Hedlund complexity gap. CoRR abs/0903.1627 (2009) - [i6]Julien Cassaigne, François Nicolas:
On polynomial growth functions of D0L-systems. CoRR abs/0904.1752 (2009) - 2008
- [j5]François Nicolas, Eric Rivals:
Hardness of optimal spaced seed design. J. Comput. Syst. Sci. 74(5): 831-849 (2008) - [i5]Sylvain Guillemot, François Nicolas:
Solving the Maximum Agreement SubTree and the Maximum Compatible Tree problems on many bounded degree trees. CoRR abs/0802.0024 (2008) - [i4]François Nicolas:
(Generalized) Post Correspondence Problem and semi-Thue systems. CoRR abs/0802.0726 (2008) - [i3]Julien Cassaigne, Christian Mauduit, François Nicolas:
Asymptotic behavior of growth functions of D0L-systems. CoRR abs/0804.1327 (2008) - [i2]François Nicolas:
A simple, polynomial-time algorithm for the matrix torsion problem. CoRR abs/0806.2068 (2008) - [i1]Julien Cassaigne, François Nicolas:
On the decidability of semigroup freeness. CoRR abs/0808.3112 (2008) - 2007
- [j4]Vincent Berry, François Nicolas:
Maximum agreement and compatible supertrees. J. Discrete Algorithms 5(3): 564-591 (2007) - [j3]François Nicolas, Eric Rivals:
Longest common subsequence problem for unoriented and cyclic strings. Theor. Comput. Sci. 370(1-3): 1-18 (2007) - 2006
- [j2]Vincent Berry, François Nicolas:
Improved Parameterized Complexity of the Maximum Agreement Subtree and Maximum Compatible Tree Problems. IEEE ACM Trans. Comput. Biol. Bioinform. 3(3): 289-302 (2006) - [c6]Sylvain Guillemot, François Nicolas:
Solving the Maximum Agreement SubTree and the Maximum Compatible Tree Problems on Many Bounded Degree Trees. CPM 2006: 165-176 - 2005
- [j1]François Nicolas, Eric Rivals:
Hardness results for the center and median string problems under the weighted and unweighted edit distances. J. Discrete Algorithms 3(2-4): 390-415 (2005) - [c5]Vincent Berry, Sylvain Guillemot, François Nicolas, Christophe Paul:
On the Approximation of Computing Evolutionary Trees. COCOON 2005: 115-125 - [c4]François Nicolas, Eric Rivals:
Hardness of Optimal Spaced Seed Design. CPM 2005: 144-155 - 2004
- [c3]Vincent Berry, François Nicolas:
Maximum Agreement and Compatible Supertrees (Extended Abstract). CPM 2004: 205-219 - 2003
- [c2]François Nicolas, Eric Rivals:
Complexities of the Centre and Median String Problems. CPM 2003: 315-327 - 2001
- [c1]Nicolas Misdariis, François Nicolas, Olivier Warusfel, René Caussé:
Radiation Control on Multi-Loudspeaker Device : La Timée. ICMC 2001
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
