The SCEAS System
| |||||||

## Search the dblp DataBase
Irena Rusu:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette
**How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation.**[Citation Graph (0, 0)][DBLP] Comparative Genomics, 2006, pp:75-86 [Conf] - Alban Mancheron, Irena Rusu
**Pattern Discovery Allowing Wild-Cards, Substitution Matrices, and Multiple Score Functions.**[Citation Graph (0, 0)][DBLP] WABI, 2003, pp:124-138 [Conf] - Igor Parfenoff, Florian Roussel, Irena Rusu
**Triangulated Neighbourhoods in**[Citation Graph (0, 0)][DBLP]*C*_{4}-Free Berge Graphs. WG, 1999, pp:402-412 [Conf] - Vassilis Giakoumakis, Irena Rusu
**Weighted Parameters in**[Citation Graph (0, 0)][DBLP]_{(P5, P5)-free}Graphs. Discrete Applied Mathematics, 1997, v:80, n:2-3, pp:255-261 [Journal] - Christophe Moan, Irena Rusu
**Hard problems in similarity searching.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2004, v:144, n:1-2, pp:213-227 [Journal] - Irena Rusu
**P**[Citation Graph (0, 0)][DBLP]_{4}-domination in Minimal Imperfect Graphs. Discrete Applied Mathematics, 1999, v:94, n:1-3, pp:329-336 [Journal] - Irena Rusu, Jeremy Spinrad
**Domination graphs: examples and counterexamples.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2001, v:110, n:2-3, pp:289-300 [Journal] - Vasek Chvátal, Irena Rusu, R. Sritharan
**Dirac-type characterizations of graphs without long chordless cycles.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:256, n:1-2, pp:445-448 [Journal] - Jean-Luc Fouquet, Irena Rusu
**Preface.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:276, n:1-3, pp:1-2 [Journal] - Igor Parfenoff, Florian Roussel, Irena Rusu
**Loose vertices in**[Citation Graph (0, 0)][DBLP]*C*_{4}-free Berge graphs. Discrete Mathematics, 2002, v:258, n:1-3, pp:137-160 [Journal] - Florian Roussel, Irena Rusu
**An O(**[Citation Graph (0, 0)][DBLP]*n*^{2}) algorithm to color Meyniel graphs. Discrete Mathematics, 2001, v:235, n:1-3, pp:107-123 [Journal] - Irena Rusu
**Even pairs in Artemis graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2000, v:218, n:1-3, pp:185-197 [Journal] - Irena Rusu, Jeremy Spinrad
**Forbidden subgraph decomposition.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:247, n:1-3, pp:159-168 [Journal] - Florian Roussel, Irena Rusu
**Holes and Dominoes in Meyniel Graphs.**[Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 1999, v:10, n:2, pp:127-146 [Journal] - Florian Roussel, Irena Rusu, Henri Thuillier
**On Graphs with Limited Number of P**[Citation Graph (0, 0)][DBLP]_{4}-Partners. Int. J. Found. Comput. Sci., 1999, v:10, n:1, pp:103-0 [Journal] - Florian Roussel, Irena Rusu
**Recognizing i-triangulated graphs in O(mn) time.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:76, n:3, pp:141-147 [Journal] - Florian Roussel, Irena Rusu
**A Linear Algorithm to Color**[Citation Graph (0, 0)][DBLP]*i*-Triangulated Graphs. Inf. Process. Lett., 1999, v:70, n:2, pp:57-62 [Journal] - Irena Rusu
**Quasi-Parity and Perfect Graphs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1995, v:54, n:1, pp:35-39 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] RECOMB-CG, 2007, pp:16-29 [Conf] - Guillaume Blin, Guillaume Fertin, Irena Rusu, Christine Sinoquet
**Extending the Hardness of RNA Secondary Structure Comparison.**[Citation Graph (0, 0)][DBLP] ESCAPE, 2007, pp:140-151 [Conf] - Irena Rusu
**Building counterexamples.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:171, n:1-3, pp:213-227 [Journal] - Jean-Luc Fouquet, Frédéric Maire, Irena Rusu, Henri Thuillier
**On transversals in minimal imperfect graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:165, n:, pp:301-312 [Journal] - Irena Rusu
**A new class of perfect Hoàng graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1995, v:145, n:1-3, pp:279-285 [Journal] - Irena Rusu
**Properly orderable graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:158, n:1-3, pp:223-229 [Journal] **Statistical Properties of Factor Oracles.**[Citation Graph (, )][DBLP]**Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms.**[Citation Graph (, )][DBLP]**Revisiting the Minimum Breakpoint Linearization Problem.**[Citation Graph (, )][DBLP]**Comparison of Spectra in Unsequenced Species.**[Citation Graph (, )][DBLP]**On the Approximability of Comparing Genomes with Duplicates.**[Citation Graph (, )][DBLP]**Comparing Bacterial Genomes by Searching Their Common Intervals.**[Citation Graph (, )][DBLP]**Homogeneous decomposition of protein interaction networks: refining the description of intra-modular interactions.**[Citation Graph (, )][DBLP]**On the Approximability of Comparing Genomes with Duplicates**[Citation Graph (, )][DBLP]**Maximum weight edge-constrained matchings.**[Citation Graph (, )][DBLP]**The Strong Perfect Graph Conjecture: 40 years of attempts, and its resolution.**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |