Florian Sikora

526 total citations
15 papers, 101 citations indexed

About

Florian Sikora is a scholar working on Computational Theory and Mathematics, Molecular Biology and Computer Networks and Communications. According to data from OpenAlex, Florian Sikora has authored 15 papers receiving a total of 101 indexed citations (citations by other indexed papers that have themselves been cited), including 11 papers in Computational Theory and Mathematics, 5 papers in Molecular Biology and 3 papers in Computer Networks and Communications. Recurrent topics in Florian Sikora's work include Advanced Graph Theory Research (11 papers), Complexity and Algorithms in Graphs (7 papers) and DNA and Biological Computing (2 papers). Florian Sikora is often cited by papers focused on Advanced Graph Theory Research (11 papers), Complexity and Algorithms in Graphs (7 papers) and DNA and Biological Computing (2 papers). Florian Sikora collaborates with scholars based in France, Germany and Italy. Florian Sikora's co-authors include Sylvain Guillemot, Cristina Bazgan, André Nichterlein, Guillaume Blin, Stéphane Vialette, Paola Bonizzoni, Vangélis Th. Paschos, Riccardo Dondi, Italo Zoppis and Édouard Bonnet and has published in prestigious journals such as Molecular Microbiology, Theoretical Computer Science and Discrete Applied Mathematics.

In The Last Decade

Florian Sikora

12 papers receiving 98 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Florian Sikora France 7 53 30 23 22 21 15 101
John D. Eblen United States 5 27 0.5× 47 1.6× 26 1.1× 17 0.8× 13 0.6× 7 113
Anthony Perez France 7 73 1.4× 18 0.6× 15 0.7× 24 1.1× 19 0.9× 18 122
Matthew England United Kingdom 6 54 1.0× 28 0.9× 24 1.0× 16 0.7× 11 0.5× 35 134
Nicolas Schabanel France 7 43 0.8× 29 1.0× 16 0.7× 88 4.0× 38 1.8× 15 159
Michele Borassi Italy 7 43 0.8× 13 0.4× 35 1.5× 34 1.5× 63 3.0× 9 127
Pål Grønås Drange Norway 5 135 2.5× 11 0.4× 16 0.7× 57 2.6× 5 0.2× 9 157
Toshiki Saitoh Japan 8 80 1.5× 16 0.5× 48 2.1× 40 1.8× 3 0.1× 26 129
Fabien de Montgolfier France 6 71 1.3× 15 0.5× 24 1.0× 48 2.2× 3 0.1× 17 129
Nikos Parotsidis Italy 6 48 0.9× 10 0.3× 34 1.5× 64 2.9× 50 2.4× 26 133
Rajesh Chitnis United States 7 123 2.3× 8 0.3× 28 1.2× 58 2.6× 12 0.6× 20 145

Countries citing papers authored by Florian Sikora

Since Specialization
Citations

This map shows the geographic impact of Florian Sikora's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Florian Sikora with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Florian Sikora more than expected).

Fields of papers citing papers by Florian Sikora

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Florian Sikora. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Florian Sikora. The network helps show where Florian Sikora may publish in the future.

Co-authorship network of co-authors of Florian Sikora

This figure shows the co-authorship network connecting the top 25 collaborators of Florian Sikora. A scholar is included among the top collaborators of Florian Sikora based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Florian Sikora. Florian Sikora is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

15 of 15 papers shown
1.
2.
Sikora, Florian, et al.. (2022). On the complexity of solution extension of optimization problems. HAL (Le Centre pour la Communication Scientifique Directe). 4 indexed citations
3.
Bonnet, Édouard, et al.. (2022). Grundy Coloring and Friends, Half-Graphs, Bicliques. Algorithmica. 85(1). 1–28.
4.
Kim, Eun Jung, et al.. (2020). Token Sliding on Split Graphs. Theory of Computing Systems. 65(4). 662–686. 2 indexed citations
5.
Dondi, Riccardo, Giancarlo Mauri, Florian Sikora, & Italo Zoppis. (2019). Covering a Graph with Clubs. Journal of Graph Algorithms and Applications. 23(2). 271–292. 6 indexed citations
6.
Bonnet, Édouard, Panos Giannopoulos, Eun Jung Kim, Paweł Rzążewski, & Florian Sikora. (2018). QPTAS and subexponential algorithm for maximum clique on disk graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 15.
7.
Bazgan, Cristina, Florent Foucaud, & Florian Sikora. (2018). Parameterized and approximation complexity of Partial VC Dimension. Theoretical Computer Science. 766. 1–15. 3 indexed citations
8.
Sikora, Florian, et al.. (2016). The Graph Motif problem parameterized by the structure of the input graph. Discrete Applied Mathematics. 231. 78–94. 5 indexed citations
9.
Bonnet, Édouard, Vangélis Th. Paschos, & Florian Sikora. (2016). Parameterized exact and approximation algorithms for maximumk-set cover and related satisfiability problems. RAIRO - Theoretical Informatics and Applications. 50(3). 227–240. 7 indexed citations
10.
Blin, Guillaume, Paola Bonizzoni, Riccardo Dondi, Roméo Rizzi, & Florian Sikora. (2014). Complexity insights of the Minimum Duplication problem. Theoretical Computer Science. 530. 66–79. 3 indexed citations
11.
Bazgan, Cristina, et al.. (2014). Parameterized approximability of maximizing the spread of influence in networks. Journal of Discrete Algorithms. 27. 54–65. 17 indexed citations
12.
Bazgan, Cristina, et al.. (2014). Parameterized Inapproximability of Target Set Selection and Generalizations. HAL (Le Centre pour la Communication Scientifique Directe). 3(2). 135–145. 10 indexed citations
13.
Guillemot, Sylvain & Florian Sikora. (2011). Finding and Counting Vertex-Colored Subtrees. Algorithmica. 65(4). 828–844. 22 indexed citations
14.
Blin, Guillaume, Paola Bonizzoni, Riccardo Dondi, & Florian Sikora. (2011). On the parameterized complexity of the repetition free longest common subsequence problem. Information Processing Letters. 112(7). 272–276. 7 indexed citations
15.
Blin, Guillaume, Florian Sikora, & Stéphane Vialette. (2010). Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 7(4). 628–635. 15 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by John D. Eblen Breakdown of academic impact, for papers by Anthony Perez Breakdown of academic impact, for papers by Matthew England Breakdown of academic impact, for papers by Nicolas Schabanel Breakdown of academic impact, for papers by Michele Borassi Breakdown of academic impact, for papers by Pål Grønås Drange Breakdown of academic impact, for papers by Toshiki Saitoh Breakdown of academic impact, for papers by Fabien de Montgolfier Breakdown of academic impact, for papers by Nikos Parotsidis Breakdown of academic impact, for papers by Rajesh Chitnis
Rankless by CCL
2026