Publications in Graph Theory

Book chapters and journal special issues

  • Cutsets in perfect and minimal imperfect graphs pdf
    I. Rusu
    In Perfect Graphs (eds. J. Ramirez Alfonsin and B. Reed), Wiley & Sons, 2001.
  • Discrete Mathematics, volume 276 (1-3), pages 1-408 (2004), Elsevier.
    J.-L. Fouquet, I. Rusu, eds.
  • Electronic Notes in Discrete Mathematics, volume 5 (2000), Elsevier.
    I. Rusu, ed.

Journals

  • The Strong Perfect Graph Conjecture: 40 years of attempts, and its resolution pdf
    I. Rusu
    Discrete Mathematics, 309(20), 6092-6113 (2009).
  • Dirac-type characterizations of graphs without long chordless cycles pdf
    V. Chvàtal, I. Rusu, R. Sritharan
    Discrete Mathematics 256, 445-448 (2002).
  • Forbidden subgraph decomposition pdf
    I. Rusu, J. Spinrad
    Discrete Mathematics 247, 159-168 (2002).
  • Loose vertices in C4-free Berge graphs pdf
    I. Parfenoff, F. Roussel, I. Rusu
    Discrete Mathematics 258, 137-160 (2002).
  • An O(n^2) algorithm to color Meyniel graphs pdf
    F. Roussel, I. Rusu
    Discrete Mathematics 235, 107-123 (2001).
  • Domination graphs: examples and counterexamples pdf
    I. Rusu, J. Spinrad
    Discrete Applied Mathematics 110, 289-300 (2001).
  • Even pairs in Artemis graphs pdf
    I. Rusu
    Discrete Mathematics 218, 185-197 (2000).
  • Recognizing i-triangulated graphs in O(mn) time pdf
    F. Roussel, I. Rusu
    Information Processing Letters 76, 141-147 (2000).
  • Berge graphs with chordless cycles of bounded length pdf
    I. Rusu
    Journal of Graph Theory 32, 73-79 (1999).
  • Perfectly contractile diamond-free graphs pdf
    I. Rusu
    Journal of Graph Theory. 32, 359-389 (1999).
  • P4-domination in minimal imperfect graphs pdf
    I. Rusu
    Discrete Applied Mathematics 94, 329-336 (1999).
  • Holes and dominoes in Meyniel graphs pdf
    F. Roussel, I. Rusu
    International Journal of Foundations of Computer Science 10, No. 2, 127-146 (1999).
  • A linear algorithm to color i-triangulated graphs pdf
    F. Roussel, I. Rusu
    Information Processing Letters 70, No.2, 57-62 (1999).
  • On graphs with limited number of P4-partners pdf
    F. Roussel, I. Rusu, H. Thuillier
    International Journal of Foundations of Computer Science Vol. 10, no. 1, 103-121 (1999).
  • Weighted parameters in (P5, cP5)-free graphs pdf
    V. Giakoumakis, I. Rusu
    Discrete Appl. Mathematics 80, 255-261 (1997).
  • Building Counterexamples pdf
    I. Rusu
    Discrete Mathematics 171, 213-227 (1997).
  • On 2-transversals in minimal imperfect graphs pdf
    J. L. Fouquet, F. Maire, I. Rusu, H.Thuillier
    Discrete Mathematics 165-166, 301-312 (1997).
  • Properly orderable graphs pdf
    I. Rusu
    Discrete Mathematics 158, 223-229 (1996).
  • A new class of perfect Hoàng graphs pdf
    I. Rusu
    Discrete Mathematics 145, 279-285 (1995).
  • Quasi-parity and perfect graphs pdf
    I. Rusu
    Inform. Processing Letters 54, 35-39 (1995).
  • Perfect and Locally Perfect Colourings pdf
    I. Rusu
    J. Graph Theory vol. 20, no. 4, 501-512 (1995).

Conferences

  • Triangulated neighbourhoods in C4-free graphs pdf
    I. Parfenoff, F. Roussel, I. Rusu
    Proceedings of WG'99, LNCS 1665, 402-412 (1999).

Miscellaneous

  • Aspects théoriques et algorithmiques des graphes parfaits pdf
    I. Rusu
    HDR (French qualification) University of Orléans, France (December 9, 1999).
  • Graphes parfaits : étude structurelle et algorithmes de coloration pdf
    I. Rusu
    Ph. D. Thesis, Paris XI University, Orsay, France (December 2, 1994).
  • Obtention de solutions stationnaires instables pour les équations d'évolution non-linéaires pdf
    I. Rusu
    Master's Thesis, Paris XI University, Orsay, France (September, 1992).
FarCry - Mollio