Florian Sikora
Florian Sikora
Verified email at - Homepage
Cited by
Cited by
Finding and counting vertex-colored subtrees
S Guillemot, F Sikora
Algorithmica 65, 828-844, 2013
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
The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated
G Blin, G Fertin, F Sikora, S Vialette
WALCOM: Algorithms and Computation: Third International Workshop, WALCOM …, 2009
Designing RNA secondary structures is hard
É Bonnet, P Rzążewski, F Sikora
Journal of Computational Biology 27 (3), 302-316, 2020
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 7 (4), 628-635, 2010
Token sliding on split graphs
R Belmonte, EJ Kim, M Lampis, V Mitsou, Y Otachi, F Sikora
Theory of Computing Systems 65, 662-686, 2021
The PACE 2018 parameterized algorithms and computational experiments challenge: The third iteration
É Bonnet, F Sikora
IPEC 2018, 2018
Multiparameterizations for max k-set cover and related satisfiability problems
E Bonnet, VT Paschos, F Sikora
CoRR abs/1309.4718, 2013
The graph motif problem parameterized by the structure of the input graph
É Bonnet, F Sikora
Discrete Applied Mathematics 231, 78-94, 2017
On the complexity of solution extension of optimization problems
K Casel, H Fernau, MK Ghadikolaei, J Monnot, F Sikora
Theoretical Computer Science 904, 48-65, 2022
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
Complexity of Grundy coloring and its variants
É Bonnet, F Foucaud, EJ Kim, F Sikora
Discrete Applied Mathematics 243, 99-114, 2018
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
Parameterized inapproximability of target set selection and generalizations
C Bazgan, M Chopin, A Nichterlein, F Sikora
Computability 3 (2), 135-145, 2014
EPTAS and subexponential algorithm for maximum clique on disk and unit ball graphs
M Bonamy, É Bonnet, N Bousquet, P Charbit, P Giannopoulos, EJ Kim, ...
Journal of the ACM (JACM) 68 (2), 1-38, 2021
Extension of vertex cover and independent set in some classes of graphs
K Casel, H Fernau, MK Ghadikoalei, J Monnot, F Sikora
International Conference on Algorithms and Complexity, 124-136, 2019
QPTAS and subexponential algorithm for maximum clique on disk graphs
É Bonnet, P Giannopoulos, EJ Kim, P Rzążewski, F Sikora
arXiv preprint arXiv:1712.05010, 2017
Some results on more flexible versions of graph motif
R Rizzi, F Sikora
Theory of Computing Systems 56, 612-629, 2015
Monte Carlo graph coloring
T Cazenave, B Negrevergne, F Sikora
Monte Carlo Search: First Workshop, MCS 2020, Held in Conjunction with IJCAI …, 2021
Covering a graph with clubs
R Dondi, G Mauri, F Sikora, Z Italo
Journal of Graph Algorithms and Applications 23 (2), 2019
The system can't perform the operation now. Try again later.
Articles 1–20