Querying Protein-Protein Interaction Networks. - Guillaume Blin; Florian Sikora; Stéphane Vialette (ISBRA, 2009)

The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated. - Guillaume Blin; Guillaume Fertin; Florian Sikora; Stéphane Vialette (WALCOM, 2009)

GraMoFoNe: a Cytoscape Plugin for Querying Motifs without Topology in Protein-Protein Interactions Networks. - Guillaume Blin; Florian Sikora; Stéphane Vialette (BICoB, 2010)

Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set. - Guillaume Blin; Florian Sikora; Stéphane Vialette (IEEE ACM Trans. Comput. Biol. Bioinform., 2010)

Algorithmic Aspects of Heterogeneous Biological Networks Comparison. - Guillaume Blin; Guillaume Fertin; Hafedh Mohamed-Babou; Irena Rusu; Florian Sikora; Stéphane Vialette (COCOA, 2011)

Aspects algorithmiques de la comparaison d'éléments biologiques. (Algorithmics aspects of biological entities comparison). - Florian Sikora (2011)

An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval. - Xiao Yang; Florian Sikora; Guillaume Blin; Sylvie Hamel; Romeo Rizzi; Srinivas Aluru (TAMC, 2012)

On the parameterized complexity of the repetition free longest common subsequence problem. - Guillaume Blin; Paola Bonizzoni; Riccardo Dondi; Florian Sikora (Inf. Process. Lett., 2012)

Finding and Counting Vertex-Colored Subtrees. - Sylvain Guillemot; Florian Sikora (Algorithmica, 2013)

Multiparameterizations for max $k$-set cover and related satisfiability problems. - Edouard Bonnet; Vangelis Th. Paschos; Florian Sikora (CoRR, 2013)

Minimum Mosaic Inference of a Set of Recombinants. - Guillaume Blin; Romeo Rizzi; Florian Sikora; Stéphane Vialette (Int. J. Found. Comput. Sci., 2013)

Parameterized Inapproximability of Target Set Selection and Generalizations. - Cristina Bazgan; Morgan Chopin; André Nichterlein; Florian Sikora (Comput., 2014)

Parameterized approximability of maximizing the spread of influence in networks. - Cristina Bazgan; Morgan Chopin; André Nichterlein; Florian Sikora (J. Discrete Algorithms, 2014)

Complexity insights of the Minimum Duplication problem. - Guillaume Blin; Paola Bonizzoni; Riccardo Dondi; Romeo Rizzi; Florian Sikora (Theor. Comput. Sci., 2014)

On the Complexity of QoS-Aware Service Selection Problem. - Faisal N. Abu-Khzam; Cristina Bazgan; Joyce El Haddad; Florian Sikora (ICSOC, 2015)

The parameterized complexity of Graph Motif relatively to the structure of the input graph. - Edouard Bonnet; Florian Sikora (CoRR, 2015)

Some Results on More Flexible Versions of Graph Motif. - Romeo Rizzi; Florian Sikora (Theory Comput. Syst., 2015)

On the Approximability of Partial VC Dimension. - Cristina Bazgan; Florent Foucaud; Florian Sikora (COCOA, 2016)

Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis. - Riccardo Dondi; Florian Sikora (COCOA, 2016)

A Note on Edge Isoperimetric Numbers and Regular Graphs. - Édouard Bonnet; Florian Sikora (Int. J. Found. Comput. Sci., 2016)

Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems. - Édouard Bonnet; Vangelis Th. Paschos; Florian Sikora (RAIRO Theor. Informatics Appl., 2016)

The shortest way to visit all metro lines in Paris. - Florian Sikora (CoRR, 2017)

The Graph Motif problem parameterized by the structure of the input graph. - Édouard Bonnet; Florian Sikora (Discret. Appl. Math., 2017)

On the complexity of various parameterizations of common induced subgraph isomorphism. - Faisal N. Abu-Khzam; Édouard Bonnet; Florian Sikora (Theor. Comput. Sci., 2017)

QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. - Édouard Bonnet; Panos Giannopoulos; Eun Jung Kim 002; Pawel Rzazewski; Florian Sikora (SoCG, 2018)

Covering with Clubs: Complexity and Approximability. - Riccardo Dondi; Giancarlo Mauri; Florian Sikora; Italo Zoppis (IWOCA, 2018)

The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration. - Édouard Bonnet; Florian Sikora (IPEC, 2018)

Extension of vertex cover and independent set in some classes of graphs and generalizations. - Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (CoRR, 2018)

Complexity of Grundy coloring and its variants. - Édouard Bonnet; Florent Foucaud; Eun Jung Kim 002; Florian Sikora (Discret. Appl. Math., 2018)

Finding disjoint paths on edge-colored graphs: more tractability results. - Riccardo Dondi; Florian Sikora (J. Comb. Optim., 2018)

Parameterized complexity and approximation issues for the colorful components problems. - Riccardo Dondi; Florian Sikora (Theor. Comput. Sci., 2018)

Extension of Vertex Cover and Independent Set in Some Classes of Graphs. - Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (CIAC, 2019)

Extension of Some Edge Graph Problems: Standard and Parameterized Complexity. - Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (FCT, 2019)

Correction to: Weighted Upper Edge Cover: Complexity and Approximability. - Kaveh Khoshkhah; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (WALCOM, 2019)

Covering a Graph with Clubs. - Riccardo Dondi; Giancarlo Mauri; Florian Sikora; Italo Zoppis (J. Graph Algorithms Appl., 2019)

Parameterized and approximation complexity of Partial VC Dimension. - Cristina Bazgan; Florent Foucaud; Florian Sikora (Theor. Comput. Sci., 2019)

Monte Carlo Graph Coloring. - Tristan Cazenave; Benjamin Négrevergne; Florian Sikora (MCS@IJCAI, 2020)

Grundy Coloring & Friends, Half-Graphs, Bicliques. - Pierre Aboulker; Édouard Bonnet; Eun Jung Kim 002; Florian Sikora (STACS, 2020)

Parameterized Orientable Deletion. - Tesshu Hanaka; Ioannis Katsikarelis; Michael Lampis; Yota Otachi; Florian Sikora (Algorithmica, 2020)

Designing RNA Secondary Structures Is Hard. - Édouard Bonnet; Pawel Rzazewski; Florian Sikora (J. Comput. Biol., 2020)

Weighted Upper Edge Cover: Complexity and Approximability. - Kaveh Khoshkhah; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (J. Graph Algorithms Appl., 2020)

Abundant Extensions. - Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (CIAC, 2021)

The Longest Run Subsequence Problem: Further Complexity Results. - Riccardo Dondi; Florian Sikora (CPM, 2021)

Graph Homomorphism Features: Why Not Sample? - Paul Beaujean; Florian Sikora; Florian Yger (PKDD/ECML Workshops (1), 2021)

Neural Maximum Independent Set. - Thomas Pontoizeau; Florian Sikora; Florian Yger; Tristan Cazenave (PKDD/ECML Workshops (1), 2021)

On the Complexity of Broadcast Domination and Multipacking in Digraphs. - Florent Foucaud; Benjamin Gras 002; Anthony Perez 001; Florian Sikora (Algorithmica, 2021)

Scaling up graph homomorphism for classification via sampling. - Paul Beaujean; Florian Sikora; Florian Yger (CoRR, 2021)

EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. - Marthe Bonamy; Édouard Bonnet; Nicolas Bousquet 001; Pierre Charbit; Panos Giannopoulos; Eun Jung Kim 002; Pawel Rzazewski; Florian Sikora; Stéphan Thomassé (J. ACM, 2021)

Token Sliding on Split Graphs. - Rémy Belmonte; Eun Jung Kim 002; Michael Lampis; Valia Mitsou; Yota Otachi; Florian Sikora (Theory Comput. Syst., 2021)

On the complexity of solution extension of optimization problems. - Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (Theor. Comput. Sci., 2022)

Recognizing Unit Multiple Intervals Is Hard. - Virginia Ardévol Martínez; Romeo Rizzi; Florian Sikora; Stéphane Vialette (ISAAC, 2023)

Hardness of Balanced Mobiles. - Virginia Ardévol Martínez; Romeo Rizzi; Florian Sikora (IWOCA, 2023)

Grundy Coloring and Friends, Half-Graphs, Bicliques. - Pierre Aboulker; Édouard Bonnet; Eun Jung Kim 002; Florian Sikora (Algorithmica, 2023)

Extension of some edge graph problems: Standard, parameterized and approximation complexity. - Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (Discret. Appl. Math., 2023)

Generalizing Roberts' Characterization of Unit Interval Graphs. - Virginia Ardévol Martínez; Romeo Rizzi; Abdallah Saffidine; Florian Sikora; Stéphane Vialette (MFCS, 2024)

Fair Railway Network Design. - Zixu He; Sirin Botan; Jérôme Lang; Abdallah Saffidine; Florian Sikora; Silas Workman (CoRR, 2024)

Parity Permutation Pattern Matching. - Virginia Ardévol Martínez; Florian Sikora; Stéphane Vialette (Algorithmica, 2024)

Recognizing unit multiple interval graphs is hard. - Virginia Ardévol Martínez; Romeo Rizzi; Florian Sikora; Stéphane Vialette (Discret. Appl. Math., 2025)