Florian Sikora
Florian Sikora
Email verificata su dauphine.fr - Home page
TitoloCitata daAnno
Finding and counting vertex-colored subtrees
S Guillemot, F Sikora
Algorithmica 65 (4), 828-844, 2013
622013
The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated
G Blin, G Fertin, F Sikora, S Vialette
International Workshop on Algorithms and Computation, 357-368, 2009
392009
Querying graphs in protein-protein interactions networks using feedback vertex set
G Blin, F Sikora, S Vialette
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) 7 …, 2010
322010
Parameterized approximability of maximizing the spread of influence in networks
C Bazgan, M Chopin, A Nichterlein, F Sikora
Journal of Discrete Algorithms 27, 54-65, 2014
312014
GraMoFoNe: a Cytoscape plugin for querying motifs without topology in Protein-Protein Interactions networks
G Blin, F Sikora, S Vialette
Bioinformatics and Computational Biology (BICoB'10), 38–43, 2010
212010
On the parameterized complexity of the repetition free longest common subsequence problem
G Blin, P Bonizzoni, R Dondi, F Sikora
Information Processing Letters 112 (7), 272-276, 2012
152012
Some results on more flexible versions of graph motif
R Rizzi, F Sikora
Theory of Computing Systems 56 (4), 612-629, 2015
142015
Complexity insights of the minimum duplication problem
G Blin, P Bonizzoni, R Dondi, R Rizzi, F Sikora
Theoretical Computer Science 530, 66-79, 2014
142014
Multiparameterizations for max k-set cover and related satisfiability problems
E Bonnet, VT Paschos, F Sikora
CoRR abs/1309.4718, 2013
14*2013
The graph motif problem parameterized by the structure of the input graph
É Bonnet, F Sikora
Discrete Applied Mathematics 231, 78-94, 2017
132017
Complexity of Grundy coloring and its variants
É Bonnet, F Foucaud, EJ Kim, F Sikora
Discrete Applied Mathematics 243, 99-114, 2018
102018
Parameterized inapproximability of target set selection and generalizations
C Bazgan, M Chopin, A Nichterlein, F Sikora
Computability 3 (2), 135-145, 2014
102014
Minimum mosaic inference of a set of recombinants
G Blin, R Rizzi, F Sikora, S Vialette
International Journal of Foundations of Computer Science 24 (01), 51-66, 2013
102013
An (almost complete) state of the art around the graph motif problem
F Sikora
Université Paris-Est Technical reports, 2012
102012
Algorithmic aspects of heterogeneous biological networks comparison
G Blin, G Fertin, H Mohamed-Babou, I Rusu, F Sikora, S Vialette
International Conference on Combinatorial Optimization and Applications, 272-286, 2011
102011
Aspects algorithmiques de la comparaison d'éléments biologiques
F Sikora
Université Paris-Est, 2011
92011
Querying protein-protein interaction networks
G Blin, F Sikora, S Vialette
International Symposium on Bioinformatics Research and Applications, 52-62, 2009
92009
Designing RNA Secondary Structures Is Hard.
É Bonnet, P Rzazewski, F Sikora
RECOMB, 248-250, 2018
72018
Parameterized complexity and approximation issues for the colorful components problems
R Dondi, F Sikora
Theoretical Computer Science 739, 1-12, 2018
62018
Covering with clubs: Complexity and approximability
R Dondi, G Mauri, F Sikora, I Zoppis
International Workshop on Combinatorial Algorithms, 153-164, 2018
62018
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20