| 2008 |
|---|
| 25 | EE | Sébastien Angibaud,
Guillaume Fertin,
Irena Rusu:
On the Approximability of Comparing Genomes with Duplicates.
WALCOM 2008: 34-45 |
| 2007 |
|---|
| 24 | EE | Guillaume Blin,
Guillaume Fertin,
Irena Rusu,
Christine Sinoquet:
Extending the Hardness of RNA Secondary Structure Comparison.
ESCAPE 2007: 140-151 |
| 23 | EE | 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 |
| 2006 |
|---|
| 22 | EE | 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 |
|---|
| 21 | EE | Christophe Moan,
Irena Rusu:
Hard problems in similarity searching.
Discrete Applied Mathematics 144(1-2): 213-227 (2004) |
| 20 | EE | Jean-Luc Fouquet,
Irena Rusu:
Preface.
Discrete Mathematics 276(1-3): 1-2 (2004) |
| 2003 |
|---|
| 19 | EE | Alban Mancheron,
Irena Rusu:
Pattern Discovery Allowing Wild-Cards, Substitution Matrices, and Multiple Score Functions.
WABI 2003: 124-138 |
| 2002 |
|---|
| 18 | EE | Irena Rusu,
Jeremy Spinrad:
Forbidden subgraph decomposition.
Discrete Mathematics 247(1-3): 159-168 (2002) |
| 17 | EE | Vasek Chvátal,
Irena Rusu,
R. Sritharan:
Dirac-type characterizations of graphs without long chordless cycles.
Discrete Mathematics 256(1-2): 445-448 (2002) |
| 16 | EE | Igor Parfenoff,
Florian Roussel,
Irena Rusu:
Loose vertices in C4-free Berge graphs.
Discrete Mathematics 258(1-3): 137-160 (2002) |
| 2001 |
|---|
| 15 | | Irena Rusu,
Jeremy Spinrad:
Domination graphs: examples and counterexamples.
Discrete Applied Mathematics 110(2-3): 289-300 (2001) |
| 14 | EE | Florian Roussel,
Irena Rusu:
An O(n2) algorithm to color Meyniel graphs.
Discrete Mathematics 235(1-3): 107-123 (2001) |
| 2000 |
|---|
| 13 | EE | Irena Rusu:
Even pairs in Artemis graphs.
Discrete Mathematics 218(1-3): 185-197 (2000) |
| 12 | EE | Florian Roussel,
Irena Rusu:
Recognizing i-triangulated graphs in O(mn) time.
Inf. Process. Lett. 76(3): 141-147 (2000) |
| 1999 |
|---|
| 11 | EE | Igor Parfenoff,
Florian Roussel,
Irena Rusu:
Triangulated Neighbourhoods in C4-Free Berge Graphs.
WG 1999: 402-412 |
| 10 | EE | Irena Rusu:
P4-domination in Minimal Imperfect Graphs.
Discrete Applied Mathematics 94(1-3): 329-336 (1999) |
| 9 | EE | 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 | EE | Vassilis Giakoumakis,
Irena Rusu:
Weighted Parameters in (P5, P5)-free Graphs.
Discrete Applied Mathematics 80(2-3): 255-261 (1997) |
| 5 | EE | 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 | EE | Irena Rusu:
Building counterexamples.
Discrete Mathematics 171(1-3): 213-227 (1997) |
| 1996 |
|---|
| 3 | EE | Irena Rusu:
Properly orderable graphs.
Discrete Mathematics 158(1-3): 223-229 (1996) |
| 1995 |
|---|
| 2 | EE | Irena Rusu:
A new class of perfect Hoàng graphs.
Discrete Mathematics 145(1-3): 279-285 (1995) |
| 1 | EE | Irena Rusu:
Quasi-Parity and Perfect Graphs.
Inf. Process. Lett. 54(1): 35-39 (1995) |
