Florian Sikora

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 62

Top Venues

University of Paris-Est, France (PHD)

Education History

University of Paris-Est, France

PHD

Publications

Virginia Ardévol Martínez, Romeo Rizzi, Abdallah Saffidine, Florian Sikora, Stéphane Vialette
Generalizing Roberts' Characterization of Unit Interval Graphs. MFCS (2024)
Virginia Ardévol Martínez, Florian Sikora, Stéphane Vialette
Parity Permutation Pattern Matching. Algorithmica 86 (8) (2024)
Virginia Ardévol Martínez, Romeo Rizzi, Abdallah Saffidine, Florian Sikora, Stéphane Vialette
Generalizing Roberts' characterization of unit interval graphs. CoRR (2024)
Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette
Recognizing unit multiple intervals is hard. CoRR (2023)
Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora
Grundy Coloring and Friends, Half-Graphs, Bicliques. Algorithmica 85 (1) (2023)
Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette
Recognizing Unit Multiple Intervals Is Hard. ISAAC (2023)
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
Extension of some edge graph problems: Standard, parameterized and approximation complexity. Discret. Appl. Math. 340 (2023)
Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora
Hardness of Balanced Mobiles. IWOCA (2023)
Virginia Ardévol Martínez, Florian Sikora, Stéphane Vialette
Parity Permutation Pattern Matching. WALCOM (2023)
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
On the complexity of solution extension of optimization problems. Theor. Comput. Sci. 904 (2022)
Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. CoRR (2021)
Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. J. ACM 68 (2) (2021)
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
Abundant Extensions. CIAC (2021)
Paul Beaujean, Florian Sikora, Florian Yger
Scaling up graph homomorphism for classification via sampling. CoRR (2021)
Paul Beaujean, Florian Sikora, Florian Yger
Graph Homomorphism Features: Why Not Sample? PKDD/ECML Workshops (1) (2021)
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
Token Sliding on Split Graphs. Theory Comput. Syst. 65 (4) (2021)
Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora
On the Complexity of Broadcast Domination and Multipacking in Digraphs. Algorithmica 83 (9) (2021)
Thomas Pontoizeau, Florian Sikora, Florian Yger, Tristan Cazenave
Neural Maximum Independent Set. PKDD/ECML Workshops (1) (2021)
Riccardo Dondi, Florian Sikora
The Longest Run Subsequence Problem: Further Complexity Results. CPM (2021)
Édouard Bonnet, Pawel Rzazewski, Florian Sikora
Designing RNA Secondary Structures Is Hard. J. Comput. Biol. 27 (3) (2020)
Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora
On the Complexity of Broadcast Domination and Multipacking in Digraphs. IWOCA (2020)
Riccardo Dondi, Florian Sikora
The Longest Run Subsequence Problem: Further Complexity Results. CoRR (2020)
Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora
On the complexity of Broadcast Domination and Multipacking in digraphs. CoRR (2020)
Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
Weighted Upper Edge Cover: Complexity and Approximability. J. Graph Algorithms Appl. 24 (2) (2020)
Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora
Grundy Coloring & Friends, Half-Graphs, Bicliques. STACS (2020)
Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora
Grundy Coloring & friends, Half-Graphs, Bicliques. CoRR (2020)
Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
Parameterized Orientable Deletion. Algorithmica 82 (7) (2020)
Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
Correction to: Weighted Upper Edge Cover: Complexity and Approximability. WALCOM (2019)
Riccardo Dondi, Giancarlo Mauri, Florian Sikora, Italo Zoppis
Covering a Graph with Clubs. J. Graph Algorithms Appl. 23 (2) (2019)
Cristina Bazgan, Florent Foucaud, Florian Sikora
Parameterized and approximation complexity of Partial VC Dimension. Theor. Comput. Sci. 766 (2019)
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
Token Sliding on Split Graphs. STACS (2019)
Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
Weighted Upper Edge Cover: Complexity and Approximability. WALCOM (2019)
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
Extension of Some Edge Graph Problems: Standard and Parameterized Complexity. FCT (2019)
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
Extension of Vertex Cover and Independent Set in Some Classes of Graphs. CIAC (2019)
Édouard Bonnet, Florian Sikora
The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration. IPEC (2018)
Édouard Bonnet, Pawel Rzazewski, Florian Sikora
Designing RNA Secondary Structures Is Hard. RECOMB (2018)
Édouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora
Complexity of Grundy coloring and its variants. Discret. Appl. Math. 243 (2018)
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
Token Sliding on Split Graphs. CoRR (2018)
Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
Weighted Upper Edge Cover: Complexity and Approximability. CoRR (2018)
Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. SoCG (2018)
Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
Parameterized Orientable Deletion. CoRR (2018)
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
On the Complexity of Solution Extension of Optimization Problems. CoRR (2018)
Riccardo Dondi, Florian Sikora
Parameterized complexity and approximation issues for the colorful components problems. Theor. Comput. Sci. 739 (2018)
Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
Parameterized Orientable Deletion. SWAT (2018)
Riccardo Dondi, Florian Sikora
Finding disjoint paths on edge-colored graphs: more tractability results. J. Comb. Optim. 36 (4) (2018)
Riccardo Dondi, Giancarlo Mauri, Florian Sikora, Italo Zoppis
Covering with Clubs: Complexity and Approximability. CoRR (2018)
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
Extension of vertex cover and independent set in some classes of graphs and generalizations. CoRR (2018)
Riccardo Dondi, Giancarlo Mauri, Florian Sikora, Italo Zoppis
Covering with Clubs: Complexity and Approximability. IWOCA (2018)
Édouard Bonnet, Florian Sikora
The Graph Motif problem parameterized by the structure of the input graph. Discret. Appl. Math. 231 (2017)
Édouard Bonnet, Pawel Rzazewski, Florian Sikora
Designing RNA Secondary Structures is Hard. CoRR (2017)
Faisal N. Abu-Khzam, Édouard Bonnet, Florian Sikora
On the complexity of various parameterizations of common induced subgraph isomorphism. Theor. Comput. Sci. 697 (2017)
Florian Sikora
The shortest way to visit all metro lines in Paris. CoRR (2017)
Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. CoRR (2017)
Edouard Bonnet, Florian Sikora
A note on Edge Isoperimetric Numbers and Regular Graphs. CoRR (2016)
Riccardo Dondi, Florian Sikora
Parameterized Complexity and Approximation Issues for the Colorful Components Problems. CiE (2016)
Riccardo Dondi, Florian Sikora
Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis. COCOA (2016)
Riccardo Dondi, Florian Sikora
Parameterized Complexity and Approximation Issues for the Colorful Components Problems. CoRR (2016)
Cristina Bazgan, Florent Foucaud, Florian Sikora
On the Approximability of Partial VC Dimension. CoRR (2016)
Édouard Bonnet, Florian Sikora
A Note on Edge Isoperimetric Numbers and Regular Graphs. Int. J. Found. Comput. Sci. 27 (6) (2016)
Riccardo Dondi, Florian Sikora
Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis. CoRR (2016)
Cristina Bazgan, Florent Foucaud, Florian Sikora
On the Approximability of Partial VC Dimension. COCOA (2016)
Édouard Bonnet, Vangelis Th. Paschos, Florian Sikora
-set cover and related satisfiability problems. RAIRO Theor. Informatics Appl. 50 (3) (2016)
Romeo Rizzi, Florian Sikora
Some Results on More Flexible Versions of Graph Motif. Theory Comput. Syst. 56 (4) (2015)
Faisal N. Abu-Khzam, Cristina Bazgan, Joyce El Haddad, Florian Sikora
On the Complexity of QoS-Aware Service Selection Problem. ICSOC (2015)
Edouard Bonnet, Florian Sikora
The parameterized complexity of Graph Motif relatively to the structure of the input graph. CoRR (2015)
Edouard Bonnet, Florian Sikora
The Graph Motif Problem Parameterized by the Structure of the Input Graph. IPEC (2015)
Edouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora
Complexity of Grundy Coloring and Its Variants. COCOON (2015)
Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
Parameterized approximability of maximizing the spread of influence in networks. J. Discrete Algorithms 27 (2014)
Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
Parameterized Inapproximability of Target Set Selection and Generalizations. CiE (2014)
Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
Parameterized Inapproximability of Target Set Selection and Generalizations. CoRR (2014)
Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi, Florian Sikora
Complexity insights of the Minimum Duplication problem. Theor. Comput. Sci. 530 (2014)
Faisal N. Abu-Khzam, Edouard Bonnet, Florian Sikora
On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism. CoRR (2014)
Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
Parameterized Inapproximability of Target Set Selection and Generalizations. Comput. 3 (2) (2014)
Edouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora
Complexity of Grundy coloring and its variants. CoRR (2014)
Faisal N. Abu-Khzam, Edouard Bonnet, Florian Sikora
On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism. IWOCA (2014)
Sylvain Guillemot, Florian Sikora
Finding and Counting Vertex-Colored Subtrees. Algorithmica 65 (4) (2013)
Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
Parameterized Approximability of Maximizing the Spread of Influence in Networks CoRR (2013)
Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
Parameterized Approximability of Maximizing the Spread of Influence in Networks. COCOON (2013)
Edouard Bonnet, Vangelis Th. Paschos, Florian Sikora
Multiparameterizations for max $k$-set cover and related satisfiability problems. CoRR (2013)
Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette
Minimum Mosaic Inference of a Set of Recombinants. Int. J. Found. Comput. Sci. 24 (1) (2013)
Xiao Yang, Florian Sikora, Guillaume Blin, Sylvie Hamel, Romeo Rizzi, Srinivas Aluru
An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval. TAMC (2012)
Romeo Rizzi, Florian Sikora
Some Results on more Flexible Versions of Graph Motif. CSR (2012)
Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi, Florian Sikora
Complexity Insights of the Minimum Duplication Problem. SOFSEM (2012)
Romeo Rizzi, Florian Sikora
Some results on more flexible versions of Graph Motif CoRR (2012)
Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Florian Sikora
On the parameterized complexity of the repetition free longest common subsequence problem. Inf. Process. Lett. 112 (7) (2012)
Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette
Minimum Mosaic Inference of a Set of Recombinants. CATS (2011)
Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu, Florian Sikora, Stéphane Vialette
Algorithmic Aspects of Heterogeneous Biological Networks Comparison. COCOA (2011)
Guillaume Blin, Florian Sikora, Stéphane Vialette
Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set. IEEE ACM Trans. Comput. Biol. Bioinform. 7 (4) (2010)
Sylvain Guillemot, Florian Sikora
Finding and counting vertex-colored subtrees CoRR (2010)
Sylvain Guillemot, Florian Sikora
Finding and Counting Vertex-Colored Subtrees. MFCS (2010)
Guillaume Blin, Florian Sikora, Stéphane Vialette
GraMoFoNe: a Cytoscape Plugin for Querying Motifs without Topology in Protein-Protein Interactions Networks. BICoB (2010)
Guillaume Blin, Florian Sikora, Stéphane Vialette
Querying Protein-Protein Interaction Networks. ISBRA (2009)
Guillaume Blin, Guillaume Fertin, Florian Sikora, Stéphane Vialette
The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated. WALCOM (2009)

Florian Sikora.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Florian Sikora