Irena Rusu

	2009
35		Sébastien Angibaud, Damien Eveillard, Guillaume Fertin, Irena Rusu: Comparing Bacterial Genomes by Searching Their Common Intervals. BICoB 2009: 102-113
34		Freddy Cliquet, Guillaume Fertin, Irena Rusu, Dominique Tessier: Comparison of Spectra in Unsequenced Species. BSB 2009: 24-35
33		Jérémie Bourdon, Irena Rusu: Statistical Properties of Factor Oracles. CPM 2009: 326-338
32		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)
	2008
31		Sébastien Angibaud, Guillaume Fertin, Irena Rusu: On the Approximability of Comparing Genomes with Duplicates. WALCOM 2008: 34-45
30		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)
29		Irena Rusu: Maximum weight edge-constrained matchings. Discrete Applied Mathematics 156(5): 662-672 (2008)
28		Irena Rusu: Converting suffix trees into factor/suffix oracles. J. Discrete Algorithms 6(2): 324-340 (2008)
27		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)
	2007
26		Guillaume Blin, Guillaume Fertin, Irena Rusu, Christine Sinoquet: Extending the Hardness of RNA Secondary Structure Comparison. ESCAPE 2007: 140-151
25		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
24		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)
	2006
23		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
	2004
22		Christophe Moan, Irena Rusu: Hard problems in similarity searching. Discrete Applied Mathematics 144(1-2): 213-227 (2004)
21		Jean-Luc Fouquet, Irena Rusu: Preface. Discrete Mathematics 276(1-3): 1-2 (2004)
	2003
20		Alban Mancheron, Irena Rusu: Pattern Discovery Allowing Wild-Cards, Substitution Matrices, and Multiple Score Functions. WABI 2003: 124-138
	2002
19		Irena Rusu, Jeremy Spinrad: Forbidden subgraph decomposition. Discrete Mathematics 247(1-3): 159-168 (2002)
18		Vasek Chvátal, Irena Rusu, R. Sritharan: Dirac-type characterizations of graphs without long chordless cycles. Discrete Mathematics 256(1-2): 445-448 (2002)
17		Igor Parfenoff, Florian Roussel, Irena Rusu: Loose vertices in C4-free Berge graphs. Discrete Mathematics 258(1-3): 137-160 (2002)
	2001
16		Irena Rusu, Jeremy Spinrad: Domination graphs: examples and counterexamples. Discrete Applied Mathematics 110(2-3): 289-300 (2001)
15		Florian Roussel, Irena Rusu: An O(n2) algorithm to color Meyniel graphs. Discrete Mathematics 235(1-3): 107-123 (2001)
	2000
14		Irena Rusu: Even pairs in Artemis graphs. Discrete Mathematics 218(1-3): 185-197 (2000)
13		Irena Rusu: Preface: Volume 5. Electronic Notes in Discrete Mathematics 5: 1-2 (2000)
12		Florian Roussel, Irena Rusu: Recognizing i-triangulated graphs in O(mn) time. Inf. Process. Lett. 76(3): 141-147 (2000)
	1999
11		Igor Parfenoff, Florian Roussel, Irena Rusu: Triangulated Neighbourhoods in C4-Free Berge Graphs. WG 1999: 402-412
10		Irena Rusu: P4-domination in Minimal Imperfect Graphs. Discrete Applied Mathematics 94(1-3): 329-336 (1999)
9		Florian Roussel, Irena Rusu: A Linear Algorithm to Color i-Triangulated Graphs. Inf. Process. Lett. 70(2): 57-62 (1999)
8		Florian Roussel, Irena Rusu, Henri Thuillier: On Graphs with Limited Number of P4-Partners. Int. J. Found. Comput. Sci. 10(1): 103- (1999)
7		Florian Roussel, Irena Rusu: Holes and Dominoes in Meyniel Graphs. Int. J. Found. Comput. Sci. 10(2): 127-146 (1999)
	1997
6		Vassilis Giakoumakis, Irena Rusu: Weighted Parameters in (P5, P5)-free Graphs. Discrete Applied Mathematics 80(2-3): 255-261 (1997)
5		Jean-Luc Fouquet, Frédéric Maire, Irena Rusu, Henri Thuillier: On transversals in minimal imperfect graphs. Discrete Mathematics 165-166: 301-312 (1997)
4		Irena Rusu: Building counterexamples. Discrete Mathematics 171(1-3): 213-227 (1997)
	1996
3		Irena Rusu: Properly orderable graphs. Discrete Mathematics 158(1-3): 223-229 (1996)
	1995
2		Irena Rusu: A new class of perfect Hoàng graphs. Discrete Mathematics 145(1-3): 279-285 (1995)
1		Irena Rusu: Quasi-Parity and Perfect Graphs. Inf. Process. Lett. 54(1): 35-39 (1995)

Coauthor Index

1	Sébastien Angibaud	[23] [24] [25] [27] [30] [31] [35]
2	Guillaume Blin	[26]
3	Jérémie Bourdon	[33]
4	Vasek Chvátal	[18]
5	Freddy Cliquet	[34]
6	Damien Eveillard	[32] [35]
7	Guillaume Fertin	[23] [24] [25] [26] [27] [30] [31] [34] [35]
8	Jean-Luc Fouquet	[5] [21]
9	Vassilis Giakoumakis	[6]
10	Frédéric Maire	[5]
11	Alban Mancheron	[20]
12	Christophe Moan	[22]
13	Géraldine Del Mondo	[32]
14	Igor Parfenoff	[11] [17]
15	Florian Roussel	[7] [8] [9] [11] [12] [15] [17]
16	Christine Sinoquet	[26]
17	Jeremy Spinrad	[16] [19]
18	R. Sritharan	[18]
19	Dominique Tessier	[34]
20	Annelyse Thévenin	[25] [27] [30]
21	Henri Thuillier	[5] [8]
22	Stéphane Vialette	[23] [24] [25] [27] [30]

Colors in the list of coauthors