Florian Sikora

100 papers A* 1A 3B 15C 12Misc 3Journal 58Unranked 7
YearRankTypeTitle / Venue / Authors
2025 J jnl
Monte Carlo Graph Coloring.
CoRR
Tristan Cazenave, Benjamin Négrevergne, Florian Sikora
2025 J jnl
Recognizing unit multiple interval graphs is hard.
Discret. Appl. Math.
Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette
2024 J jnl
Fair Railway Network Design.
CoRR
Zixu He, Sirin Botan, Jérôme Lang, Abdallah Saffidine, Florian Sikora, Silas Workman
2024 B conf
Generalizing Roberts' Characterization of Unit Interval Graphs.
MFCS
Virginia Ardévol Martínez, Romeo Rizzi, Abdallah Saffidine, Florian Sikora, Stéphane Vialette
2024 J jnl
Generalizing Roberts' characterization of unit interval graphs.
CoRR
Virginia Ardévol Martínez, Romeo Rizzi, Abdallah Saffidine, Florian Sikora, Stéphane Vialette
2024 J jnl
Parity Permutation Pattern Matching.
Algorithmica
Virginia Ardévol Martínez, Florian Sikora, Stéphane Vialette
2023 J jnl
Extension of some edge graph problems: Standard, parameterized and approximation complexity.
Discret. Appl. Math.
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2023 J jnl
Grundy Coloring and Friends, Half-Graphs, Bicliques.
Algorithmica
Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora
2023 C conf
Hardness of Balanced Mobiles.
IWOCA
Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora
2023 B conf
Parity Permutation Pattern Matching.
WALCOM
Virginia Ardévol Martínez, Florian Sikora, Stéphane Vialette
2023 B conf
Recognizing Unit Multiple Intervals Is Hard.
ISAAC
Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette
2023 J jnl
Recognizing unit multiple intervals is hard.
CoRR
Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette
2022 J jnl
On the complexity of solution extension of optimization problems.
Theor. Comput. Sci.
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2021 C conf
Abundant Extensions.
CIAC
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2021 J jnl
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs.
CoRR
Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
2021 J jnl
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs.
J. ACM
Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
2021 — conf
Graph Homomorphism Features: Why Not Sample?
PKDD/ECML Workshops (1)
Paul Beaujean, Florian Sikora, Florian Yger
2021 — conf
Neural Maximum Independent Set.
PKDD/ECML Workshops (1)
Thomas Pontoizeau, Florian Sikora, Florian Yger, Tristan Cazenave
2021 J jnl
On the Complexity of Broadcast Domination and Multipacking in Digraphs.
Algorithmica
Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora
2021 B ed.
SOFSEM 2021: Theory and Practice of Computer Science - 47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25-29, 2021, Proceedings
SOFSEM
Tomás Bures, Riccardo Dondi, Johann Gamper, Giovanna Guerrini, Tomasz Jurdzinski, Claus Pahl, Florian Sikora, Prudence W. H. Wong
2021 J jnl
Scaling up graph homomorphism for classification via sampling.
CoRR
Paul Beaujean, Florian Sikora, Florian Yger
2021 B conf
The Longest Run Subsequence Problem: Further Complexity Results.
CPM
Riccardo Dondi, Florian Sikora
2021 J jnl
Token Sliding on Split Graphs.
Theory Comput. Syst.
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
2020 J jnl
Designing RNA Secondary Structures Is Hard.
J. Comput. Biol.
Édouard Bonnet, Pawel Rzazewski, Florian Sikora
2020 A conf
Grundy Coloring & Friends, Half-Graphs, Bicliques.
STACS
Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora
2020 J jnl
Grundy Coloring & friends, Half-Graphs, Bicliques.
CoRR
Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora
2020 — conf
Monte Carlo Graph Coloring.
MCS@IJCAI
Tristan Cazenave, Benjamin Négrevergne, Florian Sikora
2020 C conf
On the Complexity of Broadcast Domination and Multipacking in Digraphs.
IWOCA
Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora
2020 J jnl
On the complexity of Broadcast Domination and Multipacking in digraphs.
CoRR
Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora
2020 J jnl
Parameterized Orientable Deletion.
Algorithmica
Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
2020 B ed.
SOFSEM 2020: Theory and Practice of Computer Science - 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, Limassol, Cyprus, January 20-24, 2020, Proceedings
SOFSEM
Alexander Chatzigeorgiou, Riccardo Dondi, Herodotos Herodotou, Christos A. Kapoutsis, Yannis Manolopoulos, George A. Papadopoulos, Florian Sikora
2020 J jnl
The Longest Run Subsequence Problem: Further Complexity Results.
CoRR
Riccardo Dondi, Florian Sikora
2020 J jnl
Weighted Upper Edge Cover: Complexity and Approximability.
J. Graph Algorithms Appl.
Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2019 B conf
Correction to: Weighted Upper Edge Cover: Complexity and Approximability.
WALCOM
Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2019 J jnl
Covering a Graph with Clubs.
J. Graph Algorithms Appl.
Riccardo Dondi, Giancarlo Mauri, Florian Sikora, Italo Zoppis
2019 B conf
Extension of Some Edge Graph Problems: Standard and Parameterized Complexity.
FCT
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2019 C conf
Extension of Vertex Cover and Independent Set in Some Classes of Graphs.
CIAC
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2019 J jnl
Parameterized and approximation complexity of Partial VC Dimension.
Theor. Comput. Sci.
Cristina Bazgan, Florent Foucaud, Florian Sikora
2019 A conf
Token Sliding on Split Graphs.
STACS
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
2019 B conf
Weighted Upper Edge Cover: Complexity and Approximability.
WALCOM
Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2018 J jnl
Complexity of Grundy coloring and its variants.
Discret. Appl. Math.
Édouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora
2018 C conf
Covering with Clubs: Complexity and Approximability.
IWOCA
Riccardo Dondi, Giancarlo Mauri, Florian Sikora, Italo Zoppis
2018 J jnl
Covering with Clubs: Complexity and Approximability.
CoRR
Riccardo Dondi, Giancarlo Mauri, Florian Sikora, Italo Zoppis
2018 B conf
Designing RNA Secondary Structures Is Hard.
RECOMB
Édouard Bonnet, Pawel Rzazewski, Florian Sikora
2018 J jnl
Extension of vertex cover and independent set in some classes of graphs and generalizations.
CoRR
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2018 J jnl
Finding disjoint paths on edge-colored graphs: more tractability results.
J. Comb. Optim.
Riccardo Dondi, Florian Sikora
2018 J jnl
On the Complexity of Solution Extension of Optimization Problems.
CoRR
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2018 — conf
Parameterized Orientable Deletion.
SWAT
Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
2018 J jnl
Parameterized Orientable Deletion.
CoRR
Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
2018 J jnl
Parameterized complexity and approximation issues for the colorful components problems.
Theor. Comput. Sci.
Riccardo Dondi, Florian Sikora
2018 A* conf
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs.
SoCG
Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora
2018 B conf
The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration.
IPEC
Édouard Bonnet, Florian Sikora
2018 J jnl
Token Sliding on Split Graphs.
CoRR
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
2018 J jnl
Weighted Upper Edge Cover: Complexity and Approximability.
CoRR
Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2017 J jnl
Designing RNA Secondary Structures is Hard.
CoRR
Édouard Bonnet, Pawel Rzazewski, Florian Sikora
2017 J jnl
On the complexity of various parameterizations of common induced subgraph isomorphism.
Theor. Comput. Sci.
Faisal N. Abu-Khzam, Édouard Bonnet, Florian Sikora
2017 J jnl
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs.
CoRR
Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora
2017 J jnl
The Graph Motif problem parameterized by the structure of the input graph.
Discret. Appl. Math.
Édouard Bonnet, Florian Sikora
2017 J jnl
The shortest way to visit all metro lines in Paris.
CoRR
Florian Sikora
2016 J jnl
A Note on Edge Isoperimetric Numbers and Regular Graphs.
Int. J. Found. Comput. Sci.
Édouard Bonnet, Florian Sikora
2016 J jnl
A note on Edge Isoperimetric Numbers and Regular Graphs.
CoRR
Edouard Bonnet, Florian Sikora
2016 C conf
Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis.
COCOA
Riccardo Dondi, Florian Sikora
2016 J jnl
Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis.
CoRR
Riccardo Dondi, Florian Sikora
2016 C conf
On the Approximability of Partial VC Dimension.
COCOA
Cristina Bazgan, Florent Foucaud, Florian Sikora
2016 J jnl
On the Approximability of Partial VC Dimension.
CoRR
Cristina Bazgan, Florent Foucaud, Florian Sikora
2016 C conf
Parameterized Complexity and Approximation Issues for the Colorful Components Problems.
CiE
Riccardo Dondi, Florian Sikora
2016 J jnl
Parameterized Complexity and Approximation Issues for the Colorful Components Problems.
CoRR
Riccardo Dondi, Florian Sikora
2016 J jnl
Parameterized exact and approximation algorithms for maximum
RAIRO Theor. Informatics Appl.
Édouard Bonnet, Vangelis Th. Paschos, Florian Sikora
2015 Misc conf
Complexity of Grundy Coloring and Its Variants.
COCOON
Edouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora
2015 A conf
On the Complexity of QoS-Aware Service Selection Problem.
ICSOC
Faisal N. Abu-Khzam, Cristina Bazgan, Joyce El Haddad, Florian Sikora
2015 J jnl
Some Results on More Flexible Versions of Graph Motif.
Theory Comput. Syst.
Romeo Rizzi, Florian Sikora
2015 B conf
The Graph Motif Problem Parameterized by the Structure of the Input Graph.
IPEC
Edouard Bonnet, Florian Sikora
2015 J jnl
The parameterized complexity of Graph Motif relatively to the structure of the input graph.
CoRR
Edouard Bonnet, Florian Sikora
2014 J jnl
Complexity insights of the Minimum Duplication problem.
Theor. Comput. Sci.
Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi, Florian Sikora
2014 J jnl
Complexity of Grundy coloring and its variants.
CoRR
Edouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora
2014 C conf
On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism.
IWOCA
Faisal N. Abu-Khzam, Edouard Bonnet, Florian Sikora
2014 J jnl
On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism.
CoRR
Faisal N. Abu-Khzam, Edouard Bonnet, Florian Sikora
2014 C conf
Parameterized Inapproximability of Target Set Selection and Generalizations.
CiE
Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
2014 J jnl
Parameterized Inapproximability of Target Set Selection and Generalizations.
Comput.
Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
2014 J jnl
Parameterized Inapproximability of Target Set Selection and Generalizations.
CoRR
Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
2014 J jnl
Parameterized approximability of maximizing the spread of influence in networks.
J. Discrete Algorithms
Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
2013 J jnl
Finding and Counting Vertex-Colored Subtrees.
Algorithmica
Sylvain Guillemot, Florian Sikora
2013 J jnl
Minimum Mosaic Inference of a Set of Recombinants.
Int. J. Found. Comput. Sci.
Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette
2013 J jnl
Multiparameterizations for max $k$-set cover and related satisfiability problems.
CoRR
Edouard Bonnet, Vangelis Th. Paschos, Florian Sikora
2013 J jnl
Parameterized Approximability of Maximizing the Spread of Influence in Networks
CoRR
Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
2013 Misc conf
Parameterized Approximability of Maximizing the Spread of Influence in Networks.
COCOON
Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
2012 C conf
An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval.
TAMC
Xiao Yang, Florian Sikora, Guillaume Blin, Sylvie Hamel, Romeo Rizzi, Srinivas Aluru
2012 B conf
Complexity Insights of the Minimum Duplication Problem.
SOFSEM
Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi, Florian Sikora
2012 J jnl
On the parameterized complexity of the repetition free longest common subsequence problem.
Inf. Process. Lett.
Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Florian Sikora
2012 Misc conf
Some Results on more Flexible Versions of Graph Motif.
CSR
Romeo Rizzi, Florian Sikora
2012 J jnl
Some results on more flexible versions of Graph Motif
CoRR
Romeo Rizzi, Florian Sikora
2011 C conf
Algorithmic Aspects of Heterogeneous Biological Networks Comparison.
COCOA
Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu, Florian Sikora, Stéphane Vialette
2011 — —
Aspects algorithmiques de la comparaison d'éléments biologiques. (Algorithmics aspects of biological entities comparison).
Florian Sikora
2011 — conf
Minimum Mosaic Inference of a Set of Recombinants.
CATS
Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette
2010 B conf
Finding and Counting Vertex-Colored Subtrees.
MFCS
Sylvain Guillemot, Florian Sikora
2010 J jnl
Finding and counting vertex-colored subtrees
CoRR
Sylvain Guillemot, Florian Sikora
2010 — conf
GraMoFoNe: a Cytoscape Plugin for Querying Motifs without Topology in Protein-Protein Interactions Networks.
BICoB
Guillaume Blin, Florian Sikora, Stéphane Vialette
2010 J jnl
Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set.
IEEE ACM Trans. Comput. Biol. Bioinform.
Guillaume Blin, Florian Sikora, Stéphane Vialette
2009 — conf
Querying Protein-Protein Interaction Networks.
ISBRA
Guillaume Blin, Florian Sikora, Stéphane Vialette
2009 B conf
The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated.
WALCOM
Guillaume Blin, Guillaume Fertin, Florian Sikora, Stéphane Vialette