Irena Rusu

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

Irena Rusu: MinMax-Profiles: A Unifying View of Common Intervals, Nested Common Intervals and Conserved Intervals of K Permutations. CoRR abs/1304.5140 (2013)

Irena Rusu: New applications of interval generators to genome comparison. J. Discrete Algorithms 10: 123-139 (2012)

Laurent Bulteau, Guillaume Fertin, Irena Rusu: Sorting by Transpositions Is Difficult. SIAM J. Discrete Math. 26(3): 1148-1180 (2012)

Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu: Tractability and approximability of maximal strip recovery. Theor. Comput. Sci. 440-441: 14-28 (2012)

Laurent Bulteau, Guillaume Fertin, Irena Rusu: Pancake Flipping Is Hard. MFCS 2012: 247-258

Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu: Algorithms for Subnetwork Mining in Heterogeneous Networks. SEA 2012: 184-194

Jérémie Bourdon, Irena Rusu: Statistical properties of factor oracles. J. Discrete Algorithms 9(1): 57-66 (2011)

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

Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu: Tractability and Approximability of Maximal Strip Recovery. CPM 2011: 336-349

Laurent Bulteau, Guillaume Fertin, Irena Rusu: Sorting by Transpositions Is Difficult. ICALP (1) 2011: 654-665

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

Laurent Bulteau, Guillaume Fertin, Irena Rusu: Pancake Flipping is Hard. CoRR abs/1111.0434 (2011)

Freddy Cliquet, Guillaume Fertin, Irena Rusu, Dominique Tessier: Proper Alignment of MS/MS Spectra from Unsequenced Species. BIOCOMP 2010: 766-772

Laurent Bulteau, Guillaume Fertin, Irena Rusu: Revisiting the Minimum Breakpoint Linearization Problem. TAMC 2010: 163-174

Laurent Bulteau, Guillaume Fertin, Irena Rusu: Sorting by Transpositions is Difficult. CoRR abs/1011.1157 (2010)

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

Florian Roussel, Irena Rusu, Henri Thuillier: The Strong Perfect Graph Conjecture: 40 years of attempts, and its resolution. Discrete Mathematics 309(20): 6092-6113 (2009)

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

Sébastien Angibaud, Damien Eveillard, Guillaume Fertin, Irena Rusu: Comparing Bacterial Genomes by Searching Their Common Intervals. BICoB 2009: 102-113

Jérémie Bourdon, Irena Rusu: Statistical Properties of Factor Oracles. CPM 2009: 326-338

Laurent Bulteau, Guillaume Fertin, Irena Rusu: Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms. ISAAC 2009: 710-719

Freddy Cliquet, Guillaume Fertin, Irena Rusu, Dominique Tessier: Comparison of Spectra in Unsequenced Species. BSB 2009: 24-35

Irena Rusu: Maximum weight edge-constrained matchings. Discrete Applied Mathematics 156(5): 662-672 (2008)

Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette: Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between Two Genomes with Duplicate Genes. Journal of Computational Biology 15(8): 1093-1115 (2008)

Irena Rusu: Converting suffix trees into factor/suffix oracles. J. Discrete Algorithms 6(2): 324-340 (2008)

Sébastien Angibaud, Guillaume Fertin, Irena Rusu: On the Approximability of Comparing Genomes with Duplicates. WALCOM 2008: 34-45

Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette: On the Approximability of Comparing Genomes with Duplicates. CoRR abs/0806.1103 (2008)

Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette: A Pseudo-Boolean Framework for Computing Rearrangement Distances between Genomes with Duplicates. Journal of Computational Biology 14(4): 379-393 (2007)

Guillaume Blin, Guillaume Fertin, Irena Rusu, Christine Sinoquet: Extending the Hardness of RNA Secondary Structure Comparison. ESCAPE 2007: 140-151

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

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

Christophe Moan, Irena Rusu: Hard problems in similarity searching. Discrete Applied Mathematics 144(1-2): 213-227 (2004)

Jean-Luc Fouquet, Irena Rusu: Preface. Discrete Mathematics 276(1-3): 1-2 (2004)

Alban Mancheron, Irena Rusu: Pattern Discovery Allowing Wild-Cards, Substitution Matrices, and Multiple Score Functions. WABI 2003: 124-138

Irena Rusu, Jeremy Spinrad: Forbidden subgraph decomposition. Discrete Mathematics 247(1-3): 159-168 (2002)

Vasek Chvátal, Irena Rusu, R. Sritharan: Dirac-type characterizations of graphs without long chordless cycles. Discrete Mathematics 256(1-2): 445-448 (2002)

Igor Parfenoff, Florian Roussel, Irena Rusu: Loose vertices in C₄-free Berge graphs. Discrete Mathematics 258(1-3): 137-160 (2002)

Irena Rusu, Jeremy Spinrad: Domination graphs: examples and counterexamples. Discrete Applied Mathematics 110(2-3): 289-300 (2001)

Florian Roussel, Irena Rusu: An O(n²) algorithm to color Meyniel graphs. Discrete Mathematics 235(1-3): 107-123 (2001)

Irena Rusu: Even pairs in Artemis graphs. Discrete Mathematics 218(1-3): 185-197 (2000)

Irena Rusu: Preface: Volume 5. Electronic Notes in Discrete Mathematics 5: 1-2 (2000)

Florian Roussel, Irena Rusu: Recognizing i-triangulated graphs in O(mn) time. Inf. Process. Lett. 76(3): 141-147 (2000)

Irena Rusu: P₄-domination in Minimal Imperfect Graphs. Discrete Applied Mathematics 94(1-3): 329-336 (1999)

Florian Roussel, Irena Rusu, Henri Thuillier: On Graphs with Limited Number of P₄-Partners. Int. J. Found. Comput. Sci. 10(1): 103-122 (1999)

Florian Roussel, Irena Rusu: Holes and Dominoes in Meyniel Graphs. Int. J. Found. Comput. Sci. 10(2): 127-146 (1999)

Florian Roussel, Irena Rusu: A Linear Algorithm to Color i-Triangulated Graphs. Inf. Process. Lett. 70(2): 57-62 (1999)

Irena Rusu: Berge graphs with chordless cycles of bounded length. Journal of Graph Theory 32(1): 73-79 (1999)

Irena Rusu: Perfectly contractile diamond-free graphs. Journal of Graph Theory 32(4): 359-389 (1999)

Igor Parfenoff, Florian Roussel, Irena Rusu: Triangulated Neighbourhoods in C₄-Free Berge Graphs. WG 1999: 402-412

Vassilis Giakoumakis, Irena Rusu: Weighted Parameters in _{(P5, P5)-free} Graphs. Discrete Applied Mathematics 80(2-3): 255-261 (1997)

Jean-Luc Fouquet, Frédéric Maire, Irena Rusu, Henri Thuillier: On transversals in minimal imperfect graphs. Discrete Mathematics 165-166: 301-312 (1997)

Irena Rusu: Building counterexamples. Discrete Mathematics 171(1-3): 213-227 (1997)

Irena Rusu: Properly orderable graphs. Discrete Mathematics 158(1-3): 223-229 (1996)

Irena Rusu: A new class of perfect Hoàng graphs. Discrete Mathematics 145(1-3): 279-285 (1995)

Irena Rusu: Quasi-Parity and Perfect Graphs. Inf. Process. Lett. 54(1): 35-39 (1995)

Irena Rusu: Perfect and locally perfect colorings. Journal of Graph Theory 20(4): 501-512 (1995)