Stéphane Vialette

1.6k total citations
37 papers, 459 citations indexed

About

Stéphane Vialette is a scholar working on Molecular Biology, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, Stéphane Vialette has authored 37 papers receiving a total of 459 indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Molecular Biology, 18 papers in Computational Theory and Mathematics and 15 papers in Artificial Intelligence. Recurrent topics in Stéphane Vialette's work include Algorithms and Data Compression (14 papers), Advanced Graph Theory Research (10 papers) and Genome Rearrangement Algorithms (8 papers). Stéphane Vialette is often cited by papers focused on Algorithms and Data Compression (14 papers), Advanced Graph Theory Research (10 papers) and Genome Rearrangement Algorithms (8 papers). Stéphane Vialette collaborates with scholars based in France, Italy and Israel. Stéphane Vialette's co-authors include Danny Hermelin, Michael R. Fellows, Frances Rosamond, Guillaume Fertin, Claude Jacq, Marisol Corral‐Debrinski, Guillaume Blin, Roméo Rizzi, Irena Rusu and Riccardo Dondi and has published in prestigious journals such as Bioinformatics, Genome biology and BMC Bioinformatics.

In The Last Decade

Stéphane Vialette

33 papers receiving 440 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Stéphane Vialette France 11 211 203 122 81 80 37 459
Jens Gramm Germany 13 298 1.4× 146 0.7× 157 1.3× 66 0.8× 156 1.9× 24 475
Alexandru I. Tomescu Finland 11 121 0.6× 236 1.2× 147 1.2× 44 0.5× 34 0.4× 68 437
Falk Hüffner Germany 17 407 1.9× 145 0.7× 113 0.9× 24 0.3× 174 2.2× 33 618
Meirav Zehavi Israel 9 221 1.0× 60 0.3× 40 0.3× 27 0.3× 81 1.0× 90 332
Cristina G. Fernandes Brazil 11 178 0.8× 84 0.4× 72 0.6× 17 0.2× 97 1.2× 47 388
Oren Weimann Israel 11 177 0.8× 95 0.5× 234 1.9× 25 0.3× 131 1.6× 40 423
Johan Wästlund Sweden 10 74 0.4× 36 0.2× 57 0.5× 37 0.5× 54 0.7× 31 274
Anne Berry France 12 294 1.4× 45 0.2× 90 0.7× 20 0.2× 95 1.2× 32 420
Juha Kärkkäinen Finland 14 136 0.6× 277 1.4× 549 4.5× 18 0.2× 122 1.5× 49 674
J. Kevin Lanctot Canada 8 147 0.7× 205 1.0× 256 2.1× 38 0.5× 146 1.8× 10 456

Countries citing papers authored by Stéphane Vialette

Since Specialization
Citations

This map shows the geographic impact of Stéphane Vialette'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 Stéphane Vialette with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Stéphane Vialette more than expected).

Fields of papers citing papers by Stéphane Vialette

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Stéphane Vialette. 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 Stéphane Vialette. The network helps show where Stéphane Vialette may publish in the future.

Co-authorship network of co-authors of Stéphane Vialette

This figure shows the co-authorship network connecting the top 25 collaborators of Stéphane Vialette. A scholar is included among the top collaborators of Stéphane Vialette 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 Stéphane Vialette. Stéphane Vialette is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Meunier, Frédéric, et al.. (2024). Quasi-kernels in split graphs. Discrete Applied Mathematics. 361. 236–243.
2.
Bulteau, Laurent & Stéphane Vialette. (2019). Recognizing binary shuffle squares is NP-hard. Theoretical Computer Science. 806. 116–132. 2 indexed citations
3.
Fertin, Guillaume, Irena Rusu, & Stéphane Vialette. (2017). The S-labeling problem: An algorithmic tour. Discrete Applied Mathematics. 246. 49–61. 2 indexed citations
4.
Gambette, Philippe, et al.. (2017). Solving the tree containment problem in linear time for nearly stable phylogenetic networks. Discrete Applied Mathematics. 246. 62–79. 7 indexed citations
5.
Dondi, Riccardo, Guillaume Fertin, & Stéphane Vialette. (2012). Finding approximate and constrained motifs in graphs. Theoretical Computer Science. 483. 10–21. 5 indexed citations
6.
Kubica, Marcin, Roméo Rizzi, Stéphane Vialette, & Tomasz Waleń. (2011). Approximation of RNA multiple structural alignment. Journal of Discrete Algorithms. 9(4). 365–376.
7.
Fellows, Michael R., Guillaume Fertin, Danny Hermelin, & Stéphane Vialette. (2010). Upper and lower bounds for finding connected motifs in vertex-colored graphs. Journal of Computer and System Sciences. 77(4). 799–811. 28 indexed citations
8.
Dondi, Riccardo, Guillaume Fertin, & Stéphane Vialette. (2010). Complexity issues in vertex-colored graph pattern matching. Journal of Discrete Algorithms. 9(1). 82–99. 13 indexed citations
9.
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
10.
Fertin, Guillaume & Stéphane Vialette. (2009). On the S-Labeling problem. Electronic Notes in Discrete Mathematics. 34. 273–277. 3 indexed citations
11.
Blin, Guillaume, Guillaume Fertin, Danny Hermelin, & Stéphane Vialette. (2008). Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. Journal of Discrete Algorithms. 6(4). 618–626. 5 indexed citations
12.
Fellows, Michael R., Danny Hermelin, Frances Rosamond, & Stéphane Vialette. (2008). On the parameterized complexity of multiple-interval graph problems. Theoretical Computer Science. 410(1). 53–61. 140 indexed citations
13.
Fertin, Guillaume, Roméo Rizzi, & Stéphane Vialette. (2008). Finding occurrences of protein complexes in protein–protein interaction graphs. Journal of Discrete Algorithms. 7(1). 90–101.
14.
Crochemore, Maxime, Danny Hermelin, Gad M. Landau, Dror Rawitz, & Stéphane Vialette. (2008). Approximating the 2-interval pattern problem. Theoretical Computer Science. 395(2-3). 283–297. 5 indexed citations
15.
Hermelin, Danny, Dror Rawitz, Roméo Rizzi, & Stéphane Vialette. (2008). The Minimum Substring Cover problem. Information and Computation. 206(11). 1303–1312. 14 indexed citations
16.
Bonizzoni, Paola, Gianluca Della Vedova, Riccardo Dondi, et al.. (2007). Exemplar Longest Common Subsequence. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 4(4). 535–543. 18 indexed citations
17.
Lelandais, Gaëlle, et al.. (2007). Bounded list injective homomorphism for comparative analysis of protein–protein interaction graphs. Journal of Discrete Algorithms. 6(2). 178–191. 3 indexed citations
18.
Blin, Guillaume, Guillaume Fertin, & Stéphane Vialette. (2007). Extracting constrained 2-interval subsets in 2-interval sets. Theoretical Computer Science. 385(1-3). 241–263. 4 indexed citations
19.
Vialette, Stéphane. (2003). On the computational complexity of 2-interval pattern matching problems. Theoretical Computer Science. 312(2-3). 223–249. 32 indexed citations
20.
Vialette, Stéphane, et al.. (2003). Long mRNAs coding for yeast mitochondrial proteins of prokaryotic origin preferentially localize to the vicinity of mitochondria. Genome biology. 4(7). R44–R44. 62 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 Jens Gramm Breakdown of academic impact, for papers by Alexandru I. Tomescu Breakdown of academic impact, for papers by Falk Hüffner Breakdown of academic impact, for papers by Meirav Zehavi Breakdown of academic impact, for papers by Cristina G. Fernandes Breakdown of academic impact, for papers by Oren Weimann Breakdown of academic impact, for papers by Johan Wästlund Breakdown of academic impact, for papers by Anne Berry Breakdown of academic impact, for papers by Juha Kärkkäinen Breakdown of academic impact, for papers by J. Kevin Lanctot
Rankless by CCL
2026