A new class of perfect Hoàng graphs. - Irena Rusu (Discret. Math., 1995)

Quasi-Parity and Perfect Graphs. - Irena Rusu (Inf. Process. Lett., 1995)

Perfect and locally perfect colorings. - Irena Rusu (J. Graph Theory, 1995)

Properly orderable graphs. - Irena Rusu (Discret. Math., 1996)

Weighted Parameters in (P5, P5)-free Graphs. - Vassilis Giakoumakis; Irena Rusu (Discret. Appl. Math., 1997)

On transversals in minimal imperfect graphs. - Jean-Luc Fouquet; Frédéric Maire; Irena Rusu; Henri Thuillier (Discret. Math., 1997)

Building counterexamples. - Irena Rusu (Discret. Math., 1997)

Triangulated Neighbourhoods in C4-Free Berge Graphs. - Igor Parfenoff; Florian Roussel; Irena Rusu (WG, 1999)

P4-domination in Minimal Imperfect Graphs. - Irena Rusu (Discret. Appl. Math., 1999)

Holes and Dominoes in Meyniel Graphs. - Florian Roussel; Irena Rusu (Int. J. Found. Comput. Sci., 1999)

On Graphs with Limited Number of P4-Partners. - Florian Roussel; Irena Rusu; Henri Thuillier (Int. J. Found. Comput. Sci., 1999)

A Linear Algorithm to Color i-Triangulated Graphs. - Florian Roussel; Irena Rusu (Inf. Process. Lett., 1999)

Berge graphs with chordless cycles of bounded length. - Irena Rusu (J. Graph Theory, 1999)

Perfectly contractile diamond-free graphs. - Irena Rusu (J. Graph Theory, 1999)

Even pairs in Artemis graphs. - Irena Rusu (Discret. Math., 2000)

Preface: Volume 5. - Irena Rusu (Electron. Notes Discret. Math., 2000)

Recognizing i-triangulated graphs in O(mn) time. - Florian Roussel; Irena Rusu (Inf. Process. Lett., 2000)

Domination graphs: examples and counterexamples. - Irena Rusu; Jeremy P. Spinrad (Discret. Appl. Math., 2001)

An O(n2) algorithm to color Meyniel graphs. - Florian Roussel; Irena Rusu (Discret. Math., 2001)

Dirac-type characterizations of graphs without long chordless cycles. - Vasek Chvátal; Irena Rusu; R. Sritharan (Discret. Math., 2002)

Loose vertices in C4-free Berge graphs. - Igor Parfenoff; Florian Roussel; Irena Rusu (Discret. Math., 2002)

Forbidden subgraph decomposition. - Irena Rusu; Jeremy P. Spinrad (Discret. Math., 2002)

Pattern Discovery Allowing Wild-Cards, Substitution Matrices, and Multiple Score Functions. - Alban Mancheron; Irena Rusu (WABI, 2003)

Hard problems in similarity searching. - Christophe Moan; Irena Rusu (Discret. Appl. Math., 2004)

Preface. - Jean-Luc Fouquet; Irena Rusu (Discret. Math., 2004)

How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation. - Sébastien Angibaud; Guillaume Fertin; Irena Rusu; Stéphane Vialette (Comparative Genomics, 2006)

Extending the Hardness of RNA Secondary Structure Comparison. - Guillaume Blin; Guillaume Fertin; Irena Rusu; Christine Sinoquet (ESCAPE, 2007)

A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes. - Sébastien Angibaud; Guillaume Fertin; Irena Rusu; Annelyse Thévenin; Stéphane Vialette (RECOMB-CG, 2007)

A Pseudo-Boolean Framework for Computing Rearrangement Distances between Genomes with Duplicates. - Sébastien Angibaud; Guillaume Fertin; Irena Rusu; Stéphane Vialette (J. Comput. Biol., 2007)

On the Approximability of Comparing Genomes with Duplicates. - Sébastien Angibaud; Guillaume Fertin; Irena Rusu (WALCOM, 2008)

Maximum weight edge-constrained matchings. - Irena Rusu (Discret. Appl. Math., 2008)

Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between Two Genomes with Duplicate Genes. - Sébastien Angibaud; Guillaume Fertin; Irena Rusu; Annelyse Thévenin; Stéphane Vialette (J. Comput. Biol., 2008)

Converting suffix trees into factor/suffix oracles. - Irena Rusu (J. Discrete Algorithms, 2008)

Combinatorics of Genome Rearrangements. - Guillaume Fertin; Anthony Labarre; Irena Rusu; Eric Tannier; Stéphane Vialette (MIT Press, 2009)

Comparing Bacterial Genomes by Searching Their Common Intervals. - Sébastien Angibaud; Damien Eveillard; Guillaume Fertin; Irena Rusu (BICoB, 2009)

Comparison of Spectra in Unsequenced Species. - Freddy Cliquet; Guillaume Fertin; Irena Rusu; Dominique Tessier (BSB, 2009)

Homogeneous decomposition of protein interaction networks: refining the description of intra-modular interactions. - Géraldine Del Mondo; Damien Eveillard; Irena Rusu (Bioinform., 2009)

The Strong Perfect Graph Conjecture: 40 years of attempts, and its resolution. - Florian Roussel; Irena Rusu; Henri Thuillier (Discret. Math., 2009)

On the Approximability of Comparing Genomes with Duplicates. - Sébastien Angibaud; Guillaume Fertin; Irena Rusu; Annelyse Thévenin; Stéphane Vialette (J. Graph Algorithms Appl., 2009)

Proper Alignment of MS/MS Spectra from Unsequenced Species. - Freddy Cliquet; Guillaume Fertin; Irena Rusu; Dominique Tessier (BIOCOMP, 2010)

Algorithmic Aspects of Heterogeneous Biological Networks Comparison. - Guillaume Blin; Guillaume Fertin; Hafedh Mohamed-Babou; Irena Rusu; Florian Sikora; Stéphane Vialette (COCOA, 2011)

SIPPER: A flexible method to integrate heterogeneous data into a metabolic network. - Philippe Bordron; Damien Eveillard; Irena Rusu (ICCABS, 2011)

Statistical properties of factor oracles. - Jérémie Bourdon; Irena Rusu (J. Discrete Algorithms, 2011)

Algorithms for Subnetwork Mining in Heterogeneous Networks. - Guillaume Fertin; Hafedh Mohamed-Babou; Irena Rusu (SEA, 2012)

New applications of interval generators to genome comparison. - Irena Rusu (J. Discrete Algorithms, 2012)

Sorting by Transpositions Is Difficult. - Laurent Bulteau; Guillaume Fertin; Irena Rusu (SIAM J. Discret. Math., 2012)

Tractability and approximability of maximal strip recovery. - Laurent Bulteau; Guillaume Fertin; Minghui Jiang 001; Irena Rusu (Theor. Comput. Sci., 2012)

A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. - Laurent Bulteau; Guillaume Fertin; Christian Komusiewicz; Irena Rusu (WABI, 2013)

Easy identification of generalized common nested intervals - Fabien de Montgolfier; Mathieu Raffinot; Irena Rusu (CoRR, 2013)

Maximal strip recovery problem with gaps: Hardness and approximation algorithms. - Laurent Bulteau; Guillaume Fertin; Irena Rusu (J. Discrete Algorithms, 2013)

Revisiting the Minimum Breakpoint Linearization Problem. - Laurent Bulteau; Guillaume Fertin; Irena Rusu (Theor. Comput. Sci., 2013)

DExTaR: Detection of exact tandem repeats based on the de Bruijn graph. - Guillaume Fertin; Géraldine Jean; Andreea Radulescu; Irena Rusu (BIBM, 2014)

Permutation Reconstruction from MinMax-Betweenness Constraints. - Irena Rusu (CoRR, 2014)

Easy Identification of Generalized Common and Conserved Nested Intervals. - Fabien de Montgolfier; Mathieu Raffinot; Irena Rusu (J. Comput. Biol., 2014)

Extending common intervals searching from permutations to sequences. - Irena Rusu (J. Discrete Algorithms, 2014)

MinMax-profiles: A unifying view of common intervals, nested common intervals and conserved intervals of K permutations. - Irena Rusu (Theor. Comput. Sci., 2014)

Obtaining a Triangular Matrix by Independent Row-Column Permutations. - Guillaume Fertin; Irena Rusu; Stéphane Vialette (ISAAC, 2015)

Algorithmic Aspects of the S-Labeling Problem. - Guillaume Fertin; Irena Rusu; Stéphane Vialette (IWOCA, 2015)

Finding Supported Paths in Heterogeneous Networks. - Guillaume Fertin; Christian Komusiewicz; Hafedh Mohamed-Babou; Irena Rusu (Algorithms, 2015)

NP-hardness of sortedness constraints. - Irena Rusu (CoRR, 2015)

Path-driven orientation of mixed graphs. - Guillaume Fertin; Hafedh Mohamed-Babou; Irena Rusu (Discret. Appl. Math., 2015)

Pancake Flipping is hard. - Laurent Bulteau; Guillaume Fertin; Irena Rusu (J. Comput. Syst. Sci., 2015)

Decomposing Cubic Graphs into Connected Subgraphs of Size Three. - Laurent Bulteau; Guillaume Fertin; Anthony Labarre; Romeo Rizzi; Irena Rusu (COCOON, 2016)

Permutation reconstruction from MinMax-Betweenness constraints. - Irena Rusu (Discret. Appl. Math., 2016)

The Contig Assembly Problem and Its Algorithmic Solutions. - Géraldine Jean; Andreea Radulescu; Irena Rusu (Algorithms for Next-Generation Sequencing Data, 2017)

log-Lists and their applications to sorting by transpositions, reversals and block-interchanges. - Irena Rusu (Theor. Comput. Sci., 2017)

Graph matching problems and the NP-hardness of sortedness constraints. - Irena Rusu (Theor. Comput. Sci., 2017)

The S-labeling problem: An algorithmic tour. - Guillaume Fertin; Irena Rusu; Stéphane Vialette (Discret. Appl. Math., 2018)

Sorting signed permutations by reversals using link-cut trees. - Irena Rusu (Inf. Process. Lett., 2018)

Common intervals and permutation reconstruction from MinMax-betweenness constraints. - Léo Pelletier; Irena Rusu (J. Discrete Algorithms, 2018)

Min (a)cyclic feedback vertex sets and min ones monotone 3-SAT. - Irena Rusu (Theor. Comput. Sci., 2019)

Sorting Permutations with Fixed Pinnacle Set. - Irena Rusu (Electron. J. Comb., 2020)

Stick graphs: examples and counter-examples. - Irena Rusu (CoRR, 2020)

Forced pairs in A-Stick graphs. - Irena Rusu (CoRR, 2021)

Admissible Pinnacle Orderings. - Irena Rusu; Bridget Eileen Tenner (Graphs Comb., 2021)

Decomposing subcubic graphs into claws, paths or triangles. - Laurent Bulteau; Guillaume Fertin; Anthony Labarre; Romeo Rizzi; Irena Rusu (J. Graph Theory, 2021)

On the complexity of recognizing Stick graphs. - Irena Rusu (CoRR, 2022)

Forced pairs in A-Stick graphs. - Irena Rusu (Discret. Math., 2022)

Raney numbers, threshold sequences and Motzkin-like paths. - Irena Rusu (Discret. Math., 2022)

Hamiltonian problems in directed graphs with simple row patterns. - Irena Rusu (Theor. Comput. Sci., 2022)

On the complexity of recognizing Stick, BipHook and Max Point-Tolerance graphs. - Irena Rusu (Theor. Comput. Sci., 2023)

Recognizing geometric intersection graphs stabbed by a line. - Dibyayan Chakraborty; Kshitij Gajjar; Irena Rusu (Theor. Comput. Sci., 2024)

Cluster Vertex Deletion Problems on Cubic Graphs. - Irena Rusu (CoRR, 2025)