Research

I am interested in the algorithmic side of some hard problems (some slides in french here for a tentative explanation of it).

I am in LAMSADE since September 2012. Before that, I was PostDoc in Lehrstuhl Bioinformatik Jena. From october 2008 to september 2011, I was a PhD student in the AlgoB team of the Laboratoire d'Informatique Gaspard Monge (LIGM). I defended my thesis the september 30, 2011. It is called Aspects algorithmiques de la comparaison d’éléments biologiques (Algorithmics aspects of biological entities comparison). It's written in french, but most of the results are in my publications. During my thesis, I was particularly interested in the Graph Motif problem, for which a (tentative) resume of definitions and result can be found here.

Publications

    2018

  1. Parameterized and approximation complexity of Partial VC Dimension
    Cristina Bazgan, Florent Foucaud and Florian Sikora,
    Theoretical Computer Science, 2018.
    URL
  2. Complexity of Grundy Coloring and Its Variants
    Edouard Bonnet, Florent Foucaud, Eun Jung Kim and Florian Sikora,
    Discrete Applied Mathematics, vol. 243, pp. 99-114, 2018.
    URL
  3. Finding disjoint paths on edge-colored graphs: more tractability results
    Riccardo Dondi and Florian Sikora,
    J. Comb. Optim., vol. 36, no. 4, pp. 1315-1332, 2018.
    URL
  4. Parameterized complexity and approximation issues for the colorful components problems
    Riccardo Dondi and Florian Sikora,
    Theor. Comput. Sci., vol. 739, pp. 1-12, 2018.
    URL
  5. QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs
    Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Paweł Rzązewski and Florian Sikora,
    in Proc of the 34th International Symposium on Computational Geometry, SoCG, vol. 99, pp. 12:1-12:15, 2018.
    URL
  6. Designing RNA Secondary Structures is Hard
    Édouard Bonnet, Paweł Rzązewski and Florian Sikora,
    in Proc. of Research in Computational Molecular Biology - 22nd Annual International Conference, RECOMB, vol. 10812, pp. 248-250, 2018.
    URL
  7. The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration
    Édouard Bonnet and Florian Sikora,
    in Proc. of the 13th International Symposium on Parameterized and Exact Computation, IPEC 2018, vol. 115, pp. 26:1-26:15, 2018.
    URL
  8. Covering with Clubs: Complexity and Approximability
    Riccardo Dondi, Giancarlo Mauri, Florian Sikora and Italo Zoppis,
    in Proc. of Combinatorial Algorithms - 29th International Workshop, IWOCA, vol. 10979, pp. 153-164, 2018.
    URL
  9. Parameterized Orientable Deletion
    Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi and Florian Sikora,
    in Proc. of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT, vol. 101, pp. 24:1-24:13, 2018.
    URL
  10. 2017

  11. On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism
    Faisal N. Abu-Khzam, Édouard Bonnet and Florian Sikora,
    Theoretical Computer Science , vol. 697, pp. 69-78, 2017.
    URL
  12. The Graph Motif problem parameterized by the structure of the input graph
    Édouard Bonnet and Florian Sikora,
    Discrete Applied Mathematics, vol. 231, pp. 78-94, 2017.
    URL
  13. 2016

  14. Parameterized Exact and Approximation Algorithms for Maximum k-Set Cover and Related Satisfiability Problems
    Edouard Bonnet, Vangelis Th. Paschos and Florian Sikora,
    RAIRO - Theor. Inf. and Applic., vol. 50, no. 3, pp. 227-240, 2016.
    URL
  15. A note on Edge Isoperimetric Numbers and Regular Graphs
    Edouard Bonnet and Florian Sikora,
    Int. J. Found. Comput. Sci., vol. 27, no. 6, pp. 771-774, 2016.
    URL
  16. Analyse de sequences : des methodes combinatoires et algorithmiques
    Christian J. Michel, Guillaume Blin and Florian Sikora,
    in Informatique Mathématique - Une photographie en 2016, CNRS Alpha, CNRS Editions ed., 2016.
    URL
  17. On the Approximability of Partial VC Dimension
    Cristina Bazgan, Florent Foucaud and Florian Sikora,
    in Proc. of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), vol. 10043, pp. 92-106, 2016.
    URL
  18. Parameterized Complexity and Approximation Issues for the Colorful Components Problems
    Riccardo Dondi and Florian Sikora,
    in Proc. of the 12th Conference on Computability in Europe (CiE), vol. 9709, pp. 261-270, 2016.
    URL
  19. Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis
    Riccardo Dondi and Florian Sikora,
    in Proc. of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), vol. 10043, pp. 113-127, 2016.
    URL
  20. 2015

  21. Some results on more flexible versions of Graph Motif
    Romeo Rizzi and Florian Sikora,
    Theory of Computing Systems, vol. 56, no. 4, pp. 612-629, 2015.
    URL
  22. On the Complexity of QoS-Aware Service Selection Problem
    Faisal N. Abu-Khzam, Cristina Bazgan, Joyce El Haddad and Florian Sikora,
    in Proc. of the 13th International Conference Service-Oriented Computing ICSOC, vol. 9435, pp. 345-352, 2015.
  23. Complexity of Grundy Coloring and Its Variants
    Edouard Bonnet, Florent Foucaud, Eun Jung Kim and Florian Sikora,
    in Proc. of the 21st International Conference Computing and Combinatorics COCOON 2015, vol. 9198, pp. 109-120, 2015.
    URL
  24. The Graph Motif Problem Parameterized by the Structure of the Input Graph
    Edouard Bonnet and Florian Sikora,
    in Proc. of the 10th International Symposium on Parameterized and Exact Computation, IPEC, vol. 43, pp. 319-330, 2015.
    URL
  25. 2014

  26. Parameterized approximability of maximizing the spread of influence in networks
    Cristina Bazgan, Morgan Chopin, André Nichterlein and Florian Sikora,
    J. Discrete Algorithms, vol. 27, pp. 54-65, 2014.
    URL
  27. Parameterized Inapproximability of Target Set Selection and Generalizations
    Cristina Bazgan, Morgan Chopin, André Nichterlein and Florian Sikora,
    Computability, vol. 3, no. 2, pp. 135-145, 2014.
    URL
  28. Complexity Insights of the Minimum Duplication Problem
    Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi and Florian Sikora,
    Theoretical Computer Science, vol. 530, pp. 66-79, 2014.
    URL
  29. On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism
    Faisal N. Abu-Khzam, Edouard Bonnet and Florian Sikora,
    in Combinatorial Algorithms - 25th International Workshop, IWOCA 2014, Revised Selected Papers, vol. 8986, pp. 1-12, 2014.
    URL
  30. Parameterized Inapproximability of Target Set Selection and Generalizations
    Cristina Bazgan, Morgan Chopin, André Nichterlein and Florian Sikora,
    in Proceedings of the 10th Computability in Europe 2014, vol. 8493, pp. 11-20, 2014.
    URL
  31. 2013

  32. Minimum Mosaic Inference of a Set of Recombinants
    Guillaume Blin, Romeo Rizzi, Florian Sikora and Stéphane Vialette,
    International Journal of Foundations of Computer Science (IJFCS), vol. 24, no. 1, pp. 51-66, 2013.
    URL
  33. Finding and counting vertex-colored subtrees
    Sylvain Guillemot and Florian Sikora,
    Algorithmica, vol. 65, no. 4, pp. 828-844, 2013.
    URL
  34. Parameterized Approximability of Maximizing the Spread of Influence in Networks
    Cristina Bazgan, Morgan Chopin, André Nichterlein and Florian Sikora,
    in Proc. of the 19th Annual International Computing and Combinatorics Conference (COCOON'13), no. 7936, pp. 543-554, 2013.
    URL
  35. 2012

  36. On the Parameterized Complexity of the Repetition Free Longest Common Subsequence Problem
    Guillaume Blin, Paola Bonizzoni, Riccardo Dondi and Florian Sikora,
    Information Processing Letters, vol. 112, no. 7, pp. 272 - 276, 2012.
    URL
  37. Complexity Insights of the Minimum Duplication Problem
    Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi and Florian Sikora,
    in Proc. of 38th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2012), vol. 7147, pp. 153-164, 2012.
    URL
  38. Some results on more flexible versions of Graph Motif
    Romeo Rizzi and Florian Sikora,
    in Proc. of the 7th International Computer Science Symposium in Russia (CSR 2012), vol. 7353, pp. 278-289, 2012.
    URL
  39. An Algorithmic View on Multi-related-segments: a unifying model for approximate common interval
    Xiao Yang, Florian Sikora, Guillaume Blin, Sylvie Hamel, Romeo Rizzi and Srinivas Aluru,
    in Proc. of the 9th annual conference on Theory and Applications of Models of Computation (TAMC 2012), vol. 7287, pp. 319-329, 2012.
    URL
  40. 2011

  41. Algorithmic Aspects of Heterogeneous Biological Networks Comparison
    Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu, Florian Sikora and Stéphane Vialette,
    in 5th Annual International Conference on Combinatorial Optimization and Applications (COCOA'11), vol. 6831, pp. 272-286, 2011.
    URL
  42. Minimum Mosaic Inference of a Set of Recombinants
    Guillaume Blin, Romeo Rizzi, Florian Sikora and Stéphane Vialette,
    in 17th Computing: the Australasian Theory Symposium (CATS'11), vol. 119, pp. 23-30, 2011.
    URL
  43. Aspects algorithmiques de la comparaison d'éléments biologiques
    Florian Sikora,
    Université Paris-Est , 2011. In French.
    URL
  44. 2010

  45. Querying Graphs in Protein-Protein Interactions Networks using Feedback Vertex Set
    Guillaume Blin, Florian Sikora and Stéphane Vialette,
    IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 7, no. 4, pp. 628-635, October 2010. Special Issue-ISBRA 2009-Bioinformatics Research and Applications.
    URL
  46. GraMoFoNe: a Cytoscape plugin for querying motifs without topology in Protein-Protein Interactions networks
    Guillaume Blin, Florian Sikora and Stéphane Vialette,
    in 2nd International Conference on Bioinformatics and Computational Biology (BICoB'10), pp. 38-43, 2010.
    URL
  47. Finding and counting vertex-colored subtrees
    Sylvain Guillemot and Florian Sikora,
    in 35th International Symposium on Mathematical Foundations of Computer Science (MFCS'10), vol. 6281, pp. 405-416, 2010.
    URL
  48. 2009

  49. The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximated
    Guillaume Blin, Guillaume Fertin, Florian Sikora and Stéphane Vialette,
    in 3rd Annual Workshop on Algorithms and Computation (WALCOM'09), vol. 5431, pp. 357-368, 2009.
    URL
  50. Querying Protein-Protein Interaction Networks
    Guillaume Blin, Florian Sikora and Stéphane Vialette,
    in 5th International Symposium on Bioinformatics Research and Applications (ISBRA'09), vol. 5542, pp. 52-62, 2009.

Science popularization...

This is also part of the mission of a french scientist, as stated here

  1. The shortest way to visit all metro lines in Paris
    Florian Sikora

Other talks

Software

SC