Publications

Most of my publications can be found on dblp. Drafts can be different from the final version.

    2025

  1. Recognizing unit multiple interval graphs is hard
    Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora and Stéphane Vialette,
    Discret. Appl. Math.
    DRAFT
    DOI

    2. 2024

  2. Generalizing Roberts' Characterization of Unit Interval Graphs
    Virginia Ardévol Martínez, Romeo Rizzi, Abdallah Saffidine, Florian Sikora and Stéphane Vialette,
    in MFCS 2024
    DRAFT
    DOI
  3. Parity Permutation Pattern Matching
    Virginia Ardévol Martínez, Florian Sikora and Stéphane Vialette,
    Algorithmica
    DRAFT
    DOI

    4. 2023

  4. Grundy Coloring and Friends, Half-Graphs, Bicliques
    Pierre Aboulker, Édouard Bonnet, Eun Jung Kim and Florian Sikora,
    Algorithmica
    DRAFT
    DOI
    SLIDES
  5. Recognizing Unit Multiple Intervals Is Hard
    Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora and Stéphane Vialette,
    in ISAAC 2023
    DRAFT
    DOI
  6. Hardness of Balanced Mobiles
    Virginia Ardévol Martínez, Romeo Rizzi and Florian Sikora,
    in IWOCA 2023
    DRAFT
    DOI
  7. Parity Permutation Pattern Matching
    Virginia Ardévol Martínez, Florian Sikora and Stéphane Vialette,
    in WALCOM 2023
    DRAFT
    DOI
  8. Extension of some edge graph problems: Standard, parameterized and approximation complexity
    Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot and Florian Sikora,
    Discret. Appl. Math.
    DRAFT
    DOI
    SLIDES

    9. 2022

  9. On the complexity of solution extension of optimization problems
    Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot and Florian Sikora,
    Theoretical Computer Science
    DOI

    10. 2021

  10. Graph Homomorphism Features: Why Not Sample?
    Paul Beaujean, Florian Sikora and Florian Yger,
    in PKDD/ECML Workshops 2021
    DOI
    SLIDES
  11. Token Sliding on Split Graphs
    Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi and Florian Sikora,
    Theory Comput. Syst.
    DRAFT
    DOI
  12. EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs
    Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Paweł Rzążewski, Florian Sikora and Stéphan Thomassé,
    Journal of the ACM
    DRAFT
    DOI
  13. SOFSEM 2021: Theory and Practice of Computer Science - 47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021, Proceedings
    Tomás Bures, Riccardo Dondi, Johann Gamper, Giovanna Guerrini, Tomasz Jurdzinski, Claus Pahl, Florian Sikora and Prudence W. H. Wong,
    DOI
  14. Abundant Extensions
    Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot and Florian Sikora,
    in CIAC 2021
    DOI
    SLIDES
  15. Monte Carlo Graph Coloring
    Tristan Cazenave, Benjamin Negrevergne and Florian Sikora,
    in MCS 2020
    DOI
    SLIDES
  16. The Longest Run Subsequence Problem: Further Complexity Results
    Riccardo Dondi and Florian Sikora,
    in CPM 2021
    DRAFT
    DOI
    SLIDES
  17. On the Complexity of Broadcast Domination and Multipacking in Digraphs
    Florent Foucaud, Benjamin Gras, Anthony Perez and Florian Sikora,
    Algorithmica
    DRAFT
    DOI
    SLIDES
  18. Neural Maximum Independent Set
    Thomas Pontoizeau, Florian Sikora, Florian Yger and Tristan Cazenave,
    in PKDD/ECML Workshops 2021
    DOI
    SLIDES
  19. Arc Routing Based on the Zero-Suppressed Binary Decision Diagram
    Renzo Roel P. Tan, Florian Sikora, Kazushi Ikeda and Kyle Stephen S. See,
    in Transactions on Engineering Technologies 2021
    DOI

    20. 2020

  20. Grundy Coloring & Friends, Half-Graphs, Bicliques
    Pierre Aboulker, Édouard Bonnet, Eun Jung Kim and Florian Sikora,
    in STACS 2020
    DRAFT
    DOI
    SLIDES
  21. Designing RNA Secondary Structures Is Hard
    Edouard Bonnet, Paweł Rzążewski and Florian Sikora,
    Journal of Computational Biology
    DRAFT
    DOI
    SLIDES
  22. SOFSEM 2020: Theory and Practice of Computer Science - 46th International Conference on Current Trends in Theory and Practice of Informatics, Proceedings
    Alexander Chatzigeorgiou, Riccardo Dondi, Herodotos Herodotou, Christos A. Kapoutsis, Yannis Manolopoulos, George A. Papadopoulos and Florian Sikora,
    DOI
  23. On the Complexity of Broadcast Domination and Multipacking in Digraphs
    Florent Foucaud, Benjamin Gras, Anthony Perez and Florian Sikora,
    in IWOCA 2020 Best Student Paper Award (shared).
    DRAFT
    DOI
    SLIDES
  24. Parameterized Orientable Deletion
    Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi and Florian Sikora,
    Algorithmica
    DRAFT
    DOI
    SLIDES
  25. Weighted Upper Edge Cover: Complexity and Approximability
    Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot and Florian Sikora,
    J. Graph Algorithms Appl.
    DRAFT
    DOI
    SLIDES

    26. 2019

  26. Parameterized and approximation complexity of Partial VC Dimension
    Cristina Bazgan, Florent Foucaud and Florian Sikora,
    Theoretical Computer Science
    DRAFT
    DOI
    SLIDES
  27. Token Sliding on Split Graphs
    Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi and Florian Sikora,
    in STACS 2019
    DRAFT
    DOI
  28. Extension of Vertex Cover and Independent Set in Some Classes of Graphs
    Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot and Florian Sikora,
    in CIAC 2019
    DRAFT
    DOI
    SLIDES
  29. Extension of Some Edge Graph Problems: Standard and Parameterized Complexity
    Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot and Florian Sikora,
    in FCT 2019
    DRAFT
    DOI
    SLIDES
  30. Covering a Graph with Clubs
    Riccardo Dondi, Giancarlo Mauri, Florian Sikora and Italo Zoppis,
    J. Graph Algorithms Appl.
    DRAFT
    DOI
    SLIDES
  31. Weighted Upper Edge Cover: Complexity and Approximability
    Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot and Florian Sikora,
    in WALCOM 2019
    DRAFT
    DOI
    SLIDES

    32. 2018

  32. Complexity of Grundy Coloring and Its Variants
    Edouard Bonnet, Florent Foucaud, Eun Jung Kim and Florian Sikora,
    Discrete Applied Mathematics
    DRAFT
    DOI
    SLIDES
  33. QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs
    Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Paweł Rzążewski and Florian Sikora,
    in SoCG 2018
    DRAFT
    DOI
    SLIDES
  34. Designing RNA Secondary Structures is Hard
    Édouard Bonnet, Paweł Rzążewski and Florian Sikora,
    in RECOMB 2018
    DRAFT
    DOI
    SLIDES
  35. The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration
    Édouard Bonnet and Florian Sikora,
    in IPEC 2018
    DRAFT
    DOI
    SLIDES
  36. Finding disjoint paths on edge-colored graphs: more tractability results
    Riccardo Dondi and Florian Sikora,
    J. Comb. Optim.
    DRAFT
    DOI
    SLIDES
  37. Parameterized complexity and approximation issues for the colorful components problems
    Riccardo Dondi and Florian Sikora,
    Theor. Comput. Sci.
    DRAFT
    DOI
    SLIDES
  38. Covering with Clubs: Complexity and Approximability
    Riccardo Dondi, Giancarlo Mauri, Florian Sikora and Italo Zoppis,
    in IWOCA 2018
    DRAFT
    DOI
    SLIDES
  39. Parameterized Orientable Deletion
    Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi and Florian Sikora,
    in SWAT 2018
    DRAFT
    DOI
    SLIDES

    40. 2017

  40. On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism
    Faisal N. Abu-Khzam, Édouard Bonnet and Florian Sikora,
    Theoretical Computer Science
    DRAFT
    DOI
    SLIDES
  41. The Graph Motif problem parameterized by the structure of the input graph
    Édouard Bonnet and Florian Sikora,
    Discrete Applied Mathematics
    DRAFT
    DOI
    SLIDES

    42. 2016

  42. On the Approximability of Partial VC Dimension
    Cristina Bazgan, Florent Foucaud and Florian Sikora,
    in COCOA 2016
    DRAFT
    DOI
    SLIDES
  43. A note on Edge Isoperimetric Numbers and Regular Graphs
    Edouard Bonnet and Florian Sikora,
    Int. J. Found. Comput. Sci.
    DRAFT
    DOI
  44. 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.
    DRAFT
    DOI
  45. Parameterized Complexity and Approximation Issues for the Colorful Components Problems
    Riccardo Dondi and Florian Sikora,
    in CiE 2016
    DRAFT
    DOI
    SLIDES
  46. Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis
    Riccardo Dondi and Florian Sikora,
    in COCOA 2016
    DRAFT
    DOI
    SLIDES
  47. 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.
    DRAFT

    48. 2015

  48. On the Complexity of QoS-Aware Service Selection Problem
    Faisal N. Abu-Khzam, Cristina Bazgan, Joyce El Haddad and Florian Sikora,
    in ICSOC 2015
    DOI
  49. Complexity of Grundy Coloring and Its Variants
    Edouard Bonnet, Florent Foucaud, Eun Jung Kim and Florian Sikora,
    in COCOON 2015
    DRAFT
    DOI
    SLIDES
  50. The Graph Motif Problem Parameterized by the Structure of the Input Graph
    Edouard Bonnet and Florian Sikora,
    in IPEC 2015
    DRAFT
    DOI
    SLIDES
  51. Some results on more flexible versions of Graph Motif
    Romeo Rizzi and Florian Sikora,
    Theory of Computing Systems
    DRAFT
    DOI
    SLIDES

    52. 2014

  52. On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism
    Faisal N. Abu-Khzam, Edouard Bonnet and Florian Sikora,
    in IWOCA 2014
    DRAFT
    DOI
    SLIDES
  53. Parameterized Inapproximability of Target Set Selection and Generalizations
    Cristina Bazgan, Morgan Chopin, André Nichterlein and Florian Sikora,
    in CiE 2014
    DRAFT
    DOI
    SLIDES
  54. Parameterized approximability of maximizing the spread of influence in networks
    Cristina Bazgan, Morgan Chopin, André Nichterlein and Florian Sikora,
    J. Discrete Algorithms
    DRAFT
    DOI
    SLIDES
  55. Parameterized Inapproximability of Target Set Selection and Generalizations
    Cristina Bazgan, Morgan Chopin, André Nichterlein and Florian Sikora,
    Computability
    DRAFT
    DOI
    SLIDES
  56. Complexity Insights of the Minimum Duplication Problem
    Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi and Florian Sikora,
    Theoretical Computer Science
    DRAFT
    DOI
    SLIDES

    57. 2013

  57. Parameterized Approximability of Maximizing the Spread of Influence in Networks
    Cristina Bazgan, Morgan Chopin, André Nichterlein and Florian Sikora,
    in COCOON 2013
    DRAFT
    DOI
    SLIDES
  58. 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)
    DRAFT
    DOI
    SLIDES
  59. Finding and counting vertex-colored subtrees
    Sylvain Guillemot and Florian Sikora,
    Algorithmica
    DRAFT
    DOI

    60. 2012

  60. Complexity Insights of the Minimum Duplication Problem
    Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi and Florian Sikora,
    in SOFSEM 2012
    DRAFT
    DOI
    SLIDES
  61. On the Parameterized Complexity of the Repetition Free Longest Common Subsequence Problem
    Guillaume Blin, Paola Bonizzoni, Riccardo Dondi and Florian Sikora,
    Information Processing Letters
    DRAFT
    DOI
    SLIDES
  62. Some results on more flexible versions of Graph Motif
    Romeo Rizzi and Florian Sikora,
    in CSR 2012
    DRAFT
    DOI
    SLIDES
  63. 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 TAMC 2012
    DRAFT
    DOI
    SLIDES

    64. 2011

  64. Algorithmic Aspects of Heterogeneous Biological Networks Comparison
    Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu, Florian Sikora and Stéphane Vialette,
    in COCOA 2011
    DRAFT
    DOI
  65. Minimum Mosaic Inference of a Set of Recombinants
    Guillaume Blin, Romeo Rizzi, Florian Sikora and Stéphane Vialette,
    in CATS 2011
    DRAFT
    SLIDES
  66. Aspects algorithmiques de la comparaison d'éléments biologiques
    Florian Sikora,
    Université Paris-Est , 2011. In French.
    URL
    SLIDES

    67. 2010

  67. GraMoFoNe: a Cytoscape plugin for querying motifs without topology in Protein-Protein Interactions networks
    Guillaume Blin, Florian Sikora and Stéphane Vialette,
    in BICoB 2010
    DRAFT
    SLIDES
  68. 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
    DRAFT
    DOI
  69. Finding and counting vertex-colored subtrees
    Sylvain Guillemot and Florian Sikora,
    in MFCS 2010
    DRAFT
    DOI

    70. 2009

  70. The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximated
    Guillaume Blin, Guillaume Fertin, Florian Sikora and Stéphane Vialette,
    in WALCOM 2009
    DRAFT
    DOI
    SLIDES
  71. Querying Protein-Protein Interaction Networks
    Guillaume Blin, Florian Sikora and Stéphane Vialette,
    in ISBRA 2009
    DOI