Irena Rusu

发表

Min (A)cyclic Feedback Vertex Sets and Min Ones Monotone 3-SAT

Irena Rusu, 2019, Theor. Comput. Sci..

A Pseudo-Boolean Framework for Computing Rearrangement Distances between Genomes with Duplicates

Guillaume Fertin, Irena Rusu, Stéphane Vialette, 2007, J. Comput. Biol..

Extending common intervals searching from permutations to sequences pdf

Irena Rusu, 2014, J. Discrete Algorithms.

Algorithms for Subnetwork Mining in Heterogeneous Networks

Guillaume Fertin, Irena Rusu, Hafedh Mohamed-Babou, 2012, SEA.

Statistical properties of factor oracles

Jérémie Bourdon, Irena Rusu, Jérémie Bourdon, 2009, J. Discrete Algorithms.

Maximal strip recovery problem with gaps: Hardness and approximation algorithms

Guillaume Fertin, Laurent Bulteau, Irena Rusu, 2009, J. Discrete Algorithms.

How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation

Guillaume Fertin, Irena Rusu, Stéphane Vialette, 2006, Comparative Genomics.

Converting Sux Trees into Factor/Sux Oracles

Irena Rusu, 2006 .

Building counterexamples

Irena Rusu, 1997, Discret. Math..

Dirac-type characterizations of graphs without long chordless cycles

Irena Rusu, R. Sritharan, Vasek Chvátal, 2002, Discret. Math..

A General Framework for Computing Rearrangement Distances between Genomes with Duplicates

Guillaume Fertin, Irena Rusu, Stéphane Vialette, 2007 .

Loose vertices in C4-free Berge graphs

Florian Roussel, Irena Rusu, Igor Parfenoff, 2002, Discret. Math..

P4-domination in Minimal Imperfect Graphs

Irena Rusu, 1999, Discret. Appl. Math..

Sorting by Transpositions Is Difficult

Guillaume Fertin, Laurent Bulteau, Irena Rusu, 2011, ICALP.

Permutation reconstruction from MinMax-Betweenness constraints

Irena Rusu, 2016, Discret. Appl. Math..

Finding Supported Paths in Heterogeneous Networks

Christian Komusiewicz, Guillaume Fertin, Irena Rusu, 2015, Algorithms.

Maximal strip recovery problem with gaps: Hardness and approximation algorithms

Guillaume Fertin, Laurent Bulteau, Irena Rusu, 2013, J. Discrete Algorithms.

Holes and Dominoes in Meyniel Graphs

Florian Roussel, Irena Rusu, 1999, Int. J. Found. Comput. Sci..

On Graphs with Limited Number of P4-Partners

Florian Roussel, Henri Thuillier, Irena Rusu, 1999, Int. J. Found. Comput. Sci..

Preface: Volume 5

Irena Rusu, 2000, Electron. Notes Discret. Math..

Weighted Parameters in (P5, P5)-free Graphs

Vassilis Giakoumakis, Irena Rusu, V. Giakoumakis, 1997, Discret. Appl. Math..

A new class of perfect Hoàng graphs

Irena Rusu, 1995, Discret. Math..

Perfectly contractile diamond-free graphs

Irena Rusu, 1999, J. Graph Theory.

Algorithmic Aspects of Heterogeneous Biological Networks Comparison

Guillaume Fertin, Irena Rusu, Stéphane Vialette, 2011, COCOA.

Comparing Bacterial Genomes by Searching Their Common Intervals

Guillaume Fertin, Irena Rusu, Sébastien Angibaud, 2009, BICoB.

Forbidden subgraph decomposition

Jeremy P. Spinrad, Irena Rusu, 2002, Discret. Math..

Stick graphs: examples and counter-examples pdf

Irena Rusu, I. Rusu, 2020, ArXiv.

Easy Identification of Generalized Common and Conserved Nested Intervals

Mathieu Raffinot, Fabien de Montgolfier, Irena Rusu, 2014, J. Comput. Biol..

The S-labeling problem: An algorithmic tour

Guillaume Fertin, Irena Rusu, Stéphane Vialette, 2017, Discret. Appl. Math..

NP-hardness of sortedness constraints pdf

Irena Rusu, 2015, ArXiv.

Obtaining a Triangular Matrix by Independent Row-Column Permutations

Guillaume Fertin, Irena Rusu, Stéphane Vialette, 2015, ISAAC.

Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between Two Genomes with Duplicate Genes

Guillaume Fertin, Irena Rusu, Stéphane Vialette, 2008, J. Comput. Biol..

Revisiting the Minimum Breakpoint Linearization Problem

Guillaume Fertin, Laurent Bulteau, Irena Rusu, 2013, Theor. Comput. Sci..

Domination graphs: examples and counterexamples

Jeremy P. Spinrad, Irena Rusu, 2001, Discret. Appl. Math..

Jean-Luc Fouquet, Irena Rusu, 2004, Discret. Math..

Hard problems in similarity searching

Irena Rusu, Christophe Moan, 2004, Discret. Appl. Math..

A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes

Guillaume Fertin, Irena Rusu, Stéphane Vialette, 2007, RECOMB-CG.

Revisiting the Minimum Breakpoint Linearization Problem

Guillaume Fertin, Laurent Bulteau, Irena Rusu, 2010, TAMC.

Perfect and locally perfect colorings

Irena Rusu, 1995, J. Graph Theory.

Pancake Flipping Is Hard pdf

Guillaume Fertin, Laurent Bulteau, Irena Rusu, 2011, MFCS.

Tractability and approximability of maximal strip recovery

Guillaume Fertin, Laurent Bulteau, Minghui Jiang, 2012, Theor. Comput. Sci..

Algorithmic Aspects of the S-Labeling Problem

Guillaume Fertin, Irena Rusu, Stéphane Vialette, 2015, IWOCA.

Decomposing Cubic Graphs into Connected Subgraphs of Size Three

Guillaume Fertin, Romeo Rizzi, Laurent Bulteau, 2016, COCOON.

DExTaR: Detection of exact tandem repeats based on the de Bruijn graph

Guillaume Fertin, Irena Rusu, Géraldine Jean, 2014, 2014 IEEE International Conference on Bioinformatics and Biomedicine (BIBM).

The Strong Perfect Graph Conjecture: 40 years of attempts, and its resolution

Florian Roussel, Henri Thuillier, Irena Rusu, 2009, Discret. Math..

Pancake Flipping is hard

Guillaume Fertin, Laurent Bulteau, Irena Rusu, 2015, J. Comput. Syst. Sci..

Tractability and approximability of maximal strip recovery

Guillaume Fertin, Laurent Bulteau, Minghui Jiang, 2011, Theor. Comput. Sci..

Converting suffix trees into factor/suffix oracles

Irena Rusu, 2008, J. Discrete Algorithms.

MinMax-profiles: A unifying view of common intervals, nested common intervals and conserved intervals of K permutations pdf

Irena Rusu, 2014, Theor. Comput. Sci..

New applications of interval generators to genome comparison

Irena Rusu, 2012, J. Discrete Algorithms.

New Results - Understanding graph representations

Jean-Sébastien Sereni, Laurent Viennot, Roberto Grossi, 2013 .

Path-driven orientation of mixed graphs

Guillaume Fertin, Irena Rusu, Hafedh Mohamed-Babou, 2015, Discret. Appl. Math..

Extending the Hardness of RNA Secondary Structure Comparison

Guillaume Fertin, Guillaume Blin, Irena Rusu, 2007, ESCAPE.

Statistical Properties of Factor Oracles

Jérémie Bourdon, Irena Rusu, 2009, CPM.

Berge graphs with chordless cycles of bounded length

Irena Rusu, 1999, J. Graph Theory.

Common intervals and permutation reconstruction from MinMax-betweenness constraints

Irena Rusu, Léo Pelletier, 2018, J. Discrete Algorithms.

Sorting by Transpositions Is Difficult pdf

Guillaume Fertin, Laurent Bulteau, Irena Rusu, 2010, SIAM J. Discret. Math..

Properly orderable graphs

Irena Rusu, I. Rusu, 1996, Discret. Math..

A Linear Algorithm to Color i-Triangulated Graphs

Florian Roussel, Irena Rusu, 1999, Inf. Process. Lett..

Proper Alignment of MS/MS Spectra from Unsequenced Species

Guillaume Fertin, Irena Rusu, Dominique Tessier, 2010, BIOCOMP.

Combinatorics of Genome Rearrangements

Guillaume Fertin, Anthony Labarre, Irena Rusu, 2009, Computational molecular biology.

Sorting Permutations with Fixed Pinnacle Set pdf

Irena Rusu, 2020, Electron. J. Comb..

SIPPER: A flexible method to integrate heterogeneous data into a metabolic network

Irena Rusu, Damien Eveillard, Philippe Bordron, 2011, 2011 IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences (ICCABS).

Easy identification of generalized common nested intervals pdf

Mathieu Raffinot, Fabien de Montgolfier, Irena Rusu, 2013, ArXiv.

On the Approximability of Comparing Genomes with Duplicates pdf

Guillaume Fertin, Irena Rusu, Sébastien Angibaud, 2008, J. Graph Algorithms Appl..

Homogeneous decomposition of protein interaction networks: refining the description of intra-modular interactions

Irena Rusu, Damien Eveillard, Géraldine Del Mondo, 2009, Bioinform..

A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications

Christian Komusiewicz, Guillaume Fertin, Laurent Bulteau, 2013, WABI.

log-Lists and their applications to sorting by transpositions, reversals and block-interchanges pdf

Irena Rusu, I. Rusu, 2015, Theor. Comput. Sci..

Recognizing i-triangulated graphs in O(mn) time

Florian Roussel, Irena Rusu, I. Rusu, 2000, Inf. Process. Lett..

On transversals in minimal imperfect graphs

Frédéric Maire, Henri Thuillier, Jean-Luc Fouquet, 1997, Discret. Math..

Triangulated Neighbourhoods in C4-Free Berge Graphs

Florian Roussel, Irena Rusu, Igor Parfenoff, 1999, WG.

Graph matching problems and the NP-hardness of sortedness constraints

Irena Rusu, 2017, Theor. Comput. Sci..

Maximum weight edge-constrained matchings

Irena Rusu, 2008, Discret. Appl. Math..

Even pairs in Artemis graphs

Irena Rusu, 2000, Discret. Math..

Comparison of Spectra in Unsequenced Species

Guillaume Fertin, Irena Rusu, Dominique Tessier, 2009, BSB.

Sorting signed permutations by reversals using link-cut trees

Irena Rusu, 2018, Inf. Process. Lett..

Pattern Discovery Allowing Wild-Cards, Substitution Matrices, and Multiple Score Functions

Irena Rusu, Alban Mancheron, I. Rusu, 2003, WABI.

The Contig Assembly Problem and Its Algorithmic Solutions

Irena Rusu, Géraldine Jean, Andreea Radulescu, 2017, Algorithms for Next-Generation Sequencing Data.

Quasi-Parity and Perfect Graphs

Irena Rusu, 1995, Inf. Process. Lett..

Admissible Pinnacle Orderings

Bridget Eileen Tenner, Irena Rusu, 2021, Graphs Comb..

Forced pairs in A-Stick graphs pdf

Irena Rusu, 2021, ArXiv.

Raney numbers, threshold sequences and Motzkin-like paths

Irena Rusu, I. Rusu, 2021, Discret. Math..

Decomposing subcubic graphs into claws, paths or triangles

Guillaume Fertin, Romeo Rizzi, Laurent Bulteau, 2021, J. Graph Theory.

Hybrid de novo tandem repeat detection using short and long reads

Guillaume Fertin, Irena Rusu, Géraldine Jean, 2015, BMC Medical Genomics.

RNA sequences and the EDIT ( NESTED , NESTED ) problem

Guillaume Fertin, Guillaume Blin, Irena Rusu, 2003 .

Distances between Balanced Strings

Guillaume Fertin, Anthony Labarre, Irena Rusu, 2009 .

Berge graphs with chordless cycles of bounded length

Irena Rusu, 1999 .

Paths and Cycles

Guillaume Fertin, Anthony Labarre, Irena Rusu, 2009 .