Searching for authors named "Irena Rusu" – sorted by Relevance.
-
Building counterexamples
- BUILDING COUNTEREXAMPLES Irena Rusu L.R.I., U.R.A. 410 du C.N.R.S., bât. 490, 91405 Orsay
- Cited by 1 (0 self) – Add To MetaCart
-
Even pairs in Artemis graphs
- Even pairs in Artemis graphs Irena Rusu L.I.F.O., Université d’Orléans, bât. 3IA, B.P. 6759, 45067
- Cited by 1 (0 self) – Add To MetaCart
-
Quasi-parity and perfect graphs
- Quasi-parity and perfect graphs Irena Rusu L.R.I., U.R.A. 410 du C.N.R.S., bât. 490, 91405 Orsay
- Cited by 1 (0 self) – Add To MetaCart
-
A new class of perfect Hoang graphs
- A new class of perfect Ho`ang graphs Irena Rusu Universit'e Paris XI, L.R.I., bat. 490 91405
- Add To MetaCart
-
Weighted parameters in (P 5 ,CP 5 )-free graphs
- 'e d'Amiens, 5 rue du Moulin Neuf, 80000 Amiens, France Irena Rusu L.I.F.O., Universit'e d
- Add To MetaCart
-
Weighted parameters in (P5, P5)-free graphs
- ’Amiens, 5 rue du Moulin Neuf, 80000 Amiens, France Irena Rusu L.I.F.O., Université d’Orléans, B.P. 6759 F
- Cited by 3 (0 self) – Add To MetaCart
-
Forbidden Subgraph Decomposition
- -13 Forbidden Subgraph Decomposition Irena Rusu 1 L.I.F.O., Universite d'Orleans, b^at. IIIA, B.P. 6759
- Cited by 1 (0 self) – Add To MetaCart
-
RNA Sequences and the EDIT(Nested, Nested) Problem
- , Guillaume Fertin, Irena Rusu, Christine Sinoquet Institut de Recherche en Informatique de Nantes (IRIN) 2
- Add To MetaCart
-
How pseudo-boolean programming can help genome rearrangement distance computation
- Angibaud 1 , Guillaume Fertin 1 , Irena Rusu 1 , and Stéphane Vialette 2 1 Laboratoire d’Informatique de
- Cited by 2 (2 self) – Add To MetaCart
-
A general framework for computing rearrangement distances between genomes with duplicates
- Sébastien Angibaud ∗ Guillaume Fertin † Irena Rusu ‡ Stéphane Vialette § 22nd February 2007 Abstract
- Cited by 2 (2 self) – Add To MetaCart

