Irena Rusu

939 total citations
45 papers, 365 citations indexed

About

Irena Rusu is a scholar working on Computational Theory and Mathematics, Molecular Biology and Genetics. According to data from OpenAlex, Irena Rusu has authored 45 papers receiving a total of 365 indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Computational Theory and Mathematics, 15 papers in Molecular Biology and 14 papers in Genetics. Recurrent topics in Irena Rusu's work include Advanced Graph Theory Research (23 papers), Genome Rearrangement Algorithms (14 papers) and Graph Labeling and Dimension Problems (13 papers). Irena Rusu is often cited by papers focused on Advanced Graph Theory Research (23 papers), Genome Rearrangement Algorithms (14 papers) and Graph Labeling and Dimension Problems (13 papers). Irena Rusu collaborates with scholars based in France, United States and Italy. Irena Rusu's co-authors include Guillaume Fertin, Laurent Bulteau, Éric Tannier, Anthony Labarre, Vassilis Giakoumakis, Stéphane Vialette, Andreea Radulescu, R. Sritharan, Vašek Chvátal and Géraldine Jean and has published in prestigious journals such as Bioinformatics, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Irena Rusu

36 papers receiving 345 citations

Peers

Irena Rusu
Anthony Labarre France
Tzvika Hartman Israel
K. Yu. Gorbunov Russia
Laurent Bulteau France
Manuel Lafond Canada
Marc Hellmuth Germany
Lee A. Newberg United States
Alexandru I. Tomescu Finland
Riccardo Dondi Italy
Sylvain Guillemot France
Anthony Labarre France
Irena Rusu
Citations per year, relative to Irena Rusu Irena Rusu (= 1×) peers Anthony Labarre

Countries citing papers authored by Irena Rusu

Since Specialization
Citations

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

Fields of papers citing papers by Irena Rusu

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Irena Rusu

This figure shows the co-authorship network connecting the top 25 collaborators of Irena Rusu. A scholar is included among the top collaborators of Irena Rusu 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 Irena Rusu. Irena Rusu 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.
2.
Rusu, Irena. (2023). On the complexity of recognizing Stick, BipHook and Max Point-Tolerance graphs. Theoretical Computer Science. 952. 113773–113773.
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.
Rusu, Irena. (2016). Permutation reconstruction from MinMax-Betweenness constraints. Discrete Applied Mathematics. 207. 106–119.
5.
Rusu, Irena. (2015). Log-Lists and Their Applications to Sorting by Transpositions, Reversals\n and Block-Interchanges. arXiv (Cornell University). 3 indexed citations
6.
Fertin, Guillaume, et al.. (2014). Path-driven orientation of mixed graphs. Discrete Applied Mathematics. 181. 98–108. 1 indexed citations
7.
8.
Bulteau, Laurent, Guillaume Fertin, & Irena Rusu. (2013). Revisiting the Minimum Breakpoint Linearization Problem. Theoretical Computer Science. 494. 122–133. 1 indexed citations
9.
Bulteau, Laurent, Guillaume Fertin, Minghui Jiang, & Irena Rusu. (2012). Tractability and approximability of maximal strip recovery. Theoretical Computer Science. 440-441. 14–28. 3 indexed citations
10.
Rusu, Irena. (2011). New applications of interval generators to genome comparison. Journal of Discrete Algorithms. 10. 123–139. 1 indexed citations
11.
Bourdon, Jérémie & Irena Rusu. (2010). Statistical properties of factor oracles. Journal of Discrete Algorithms. 9(1). 57–66.
12.
Rusu, Irena. (2007). Converting suffix trees into factor/suffix oracles. Journal of Discrete Algorithms. 6(2). 324–340. 1 indexed citations
13.
Rusu, Irena, et al.. (2004). Hard problems in similarity searching. Discrete Applied Mathematics. 144(1-2). 213–227. 1 indexed citations
14.
Rusu, Irena & Jeremy Spinrad. (2002). Forbidden subgraph decomposition. Discrete Mathematics. 247(1-3). 159–168. 2 indexed citations
15.
Chvátal, Vašek, Irena Rusu, & R. Sritharan. (2002). Dirac-type characterizations of graphs without long chordless cycles. Discrete Mathematics. 256(1-2). 445–448. 8 indexed citations
16.
Rusu, Irena & Jeremy Spinrad. (2001). Domination graphs: examples and counterexamples. Discrete Applied Mathematics. 110(2-3). 289–300. 2 indexed citations
17.
Rusu, Irena, et al.. (2001). An O(n2) algorithm to color Meyniel graphs. Discrete Mathematics. 235(1-3). 107–123. 7 indexed citations
18.
Rusu, Irena. (2000). Even pairs in Artemis graphs. Discrete Mathematics. 218(1-3). 185–197.
19.
Giakoumakis, Vassilis & Irena Rusu. (1997). Weighted parameters in (P5, P5)-free graphs. Discrete Applied Mathematics. 80(2-3). 255–261. 23 indexed citations
20.
Rusu, Irena. (1997). Building counterexamples. Discrete Mathematics. 171(1-3). 213–227. 2 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 Anthony Labarre Breakdown of academic impact, for papers by Tzvika Hartman Breakdown of academic impact, for papers by K. Yu. Gorbunov Breakdown of academic impact, for papers by Laurent Bulteau Breakdown of academic impact, for papers by Manuel Lafond Breakdown of academic impact, for papers by Marc Hellmuth Breakdown of academic impact, for papers by Lee A. Newberg Breakdown of academic impact, for papers by Alexandru I. Tomescu Breakdown of academic impact, for papers by Riccardo Dondi Breakdown of academic impact, for papers by Sylvain Guillemot
Rankless by CCL
2026