The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Irena Rusu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. Igor Parfenoff, Florian Roussel, Irena Rusu
    Triangulated Neighbourhoods in C4-Free Berge Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:402-412 [Conf]
  4. Vassilis Giakoumakis, Irena Rusu
    Weighted Parameters in (P5, P5)-free Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:80, n:2-3, pp:255-261 [Journal]
  5. 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]
  6. Irena Rusu
    P4-domination in Minimal Imperfect Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:94, n:1-3, pp:329-336 [Journal]
  7. 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]
  8. 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]
  9. Jean-Luc Fouquet, Irena Rusu
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:276, n:1-3, pp:1-2 [Journal]
  10. Igor Parfenoff, Florian Roussel, Irena Rusu
    Loose vertices in C4-free Berge graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:258, n:1-3, pp:137-160 [Journal]
  11. Florian Roussel, Irena Rusu
    An O(n2) algorithm to color Meyniel graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:107-123 [Journal]
  12. Irena Rusu
    Even pairs in Artemis graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:218, n:1-3, pp:185-197 [Journal]
  13. Irena Rusu, Jeremy Spinrad
    Forbidden subgraph decomposition. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:247, n:1-3, pp:159-168 [Journal]
  14. 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]
  15. Florian Roussel, Irena Rusu, Henri Thuillier
    On Graphs with Limited Number of P4-Partners. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:1, pp:103-0 [Journal]
  16. 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]
  17. Florian Roussel, Irena Rusu
    A Linear Algorithm to Color i-Triangulated Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:70, n:2, pp:57-62 [Journal]
  18. Irena Rusu
    Quasi-Parity and Perfect Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:54, n:1, pp:35-39 [Journal]
  19. 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]
  20. 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]
  21. Irena Rusu
    Building counterexamples. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:171, n:1-3, pp:213-227 [Journal]
  22. 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]
  23. 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]
  24. Irena Rusu
    Properly orderable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:158, n:1-3, pp:223-229 [Journal]

  25. Statistical Properties of Factor Oracles. [Citation Graph (, )][DBLP]


  26. Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms. [Citation Graph (, )][DBLP]


  27. Revisiting the Minimum Breakpoint Linearization Problem. [Citation Graph (, )][DBLP]


  28. Comparison of Spectra in Unsequenced Species. [Citation Graph (, )][DBLP]


  29. On the Approximability of Comparing Genomes with Duplicates. [Citation Graph (, )][DBLP]


  30. Comparing Bacterial Genomes by Searching Their Common Intervals. [Citation Graph (, )][DBLP]


  31. Homogeneous decomposition of protein interaction networks: refining the description of intra-modular interactions. [Citation Graph (, )][DBLP]


  32. On the Approximability of Comparing Genomes with Duplicates [Citation Graph (, )][DBLP]


  33. Maximum weight edge-constrained matchings. [Citation Graph (, )][DBLP]


  34. The Strong Perfect Graph Conjecture: 40 years of attempts, and its resolution. [Citation Graph (, )][DBLP]


Search in 3.484secs, Finished in 3.485secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002