Irena Rusu - RankMe

101 papers B 8C 5Misc 1Journal 76Unranked 9

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Cluster vertex deletion problems on cubic graphs. Theor. Comput. Sci. Irena Rusu
2025	J	`jnl`	Cluster Vertex Deletion Problems on Cubic Graphs. CoRR Irena Rusu
2024	J	`jnl`	Recognizing geometric intersection graphs stabbed by a line. Theor. Comput. Sci. Dibyayan Chakraborty, Kshitij Gajjar, Irena Rusu
2023	J	`jnl`	On the complexity of recognizing Stick, BipHook and Max Point-Tolerance graphs. Theor. Comput. Sci. Irena Rusu
2022	J	`jnl`	Forced pairs in Discret. Math. Irena Rusu
2022	J	`jnl`	Hamiltonian problems in directed graphs with simple row patterns. Theor. Comput. Sci. Irena Rusu
2022	J	`jnl`	On the complexity of recognizing Stick graphs. CoRR Irena Rusu
2022	J	`jnl`	Raney numbers, threshold sequences and Motzkin-like paths. Discret. Math. Irena Rusu
2022	J	`jnl`	Recognizing Geometric Intersection Graphs Stabbed by a Line. CoRR Dibyayan Chakraborty, Kshitij Gajjar, Irena Rusu
2021	J	`jnl`	Admissible Pinnacle Orderings. Graphs Comb. Irena Rusu, Bridget Eileen Tenner
2021	J	`jnl`	Decomposing subcubic graphs into claws, paths or triangles. J. Graph Theory Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu
2021	J	`jnl`	Forced pairs in A-Stick graphs. CoRR Irena Rusu
2020	J	`jnl`	Sorting Permutations with Fixed Pinnacle Set. Electron. J. Comb. Irena Rusu
2020	J	`jnl`	Sorting Permutations with Fixed Pinnacle Set. CoRR Irena Rusu
2020	J	`jnl`	Stick graphs: examples and counter-examples. CoRR Irena Rusu
2019	J	`jnl`	Min (a)cyclic feedback vertex sets and min ones monotone 3-SAT. Theor. Comput. Sci. Irena Rusu
2018	J	`jnl`	Common intervals and permutation reconstruction from MinMax-betweenness constraints. J. Discrete Algorithms Léo Pelletier, Irena Rusu
2018	J	`jnl`	Min (A)cyclic Feedback Vertex Sets and Min Ones Monotone 3-SAT. CoRR Irena Rusu
2018	J	`jnl`	Sorting signed permutations by reversals using link-cut trees. Inf. Process. Lett. Irena Rusu
2018	J	`jnl`	The S-labeling problem: An algorithmic tour. Discret. Appl. Math. Guillaume Fertin, Irena Rusu, Stéphane Vialette
2017	J	`jnl`	Graph matching problems and the NP-hardness of sortedness constraints. Theor. Comput. Sci. Irena Rusu
2017	—	`ch.`	The Contig Assembly Problem and Its Algorithmic Solutions. Algorithms for Next-Generation Sequencing Data Géraldine Jean, Andreea Radulescu, Irena Rusu
2017	J	`jnl`	log-Lists and their applications to sorting by transpositions, reversals and block-interchanges. Theor. Comput. Sci. Irena Rusu
2016	Misc	`conf`	Decomposing Cubic Graphs into Connected Subgraphs of Size Three. COCOON Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu
2016	J	`jnl`	Decomposing Cubic Graphs into Connected Subgraphs of Size Three. CoRR Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu
2016	J	`jnl`	Permutation reconstruction from Discret. Appl. Math. Irena Rusu
2015	C	`conf`	Algorithmic Aspects of the S-Labeling Problem. IWOCA Guillaume Fertin, Irena Rusu, Stéphane Vialette
2015	J	`jnl`	Finding Supported Paths in Heterogeneous Networks. Algorithms Guillaume Fertin, Christian Komusiewicz, Hafedh Mohamed-Babou, Irena Rusu
2015	J	`jnl`	Log-Lists and Their Applications to Sorting by Transpositions, Reversals and Block-Interchanges. CoRR Irena Rusu
2015	J	`jnl`	NP-hardness of sortedness constraints. CoRR Irena Rusu
2015	B	`conf`	Obtaining a Triangular Matrix by Independent Row-Column Permutations. ISAAC Guillaume Fertin, Irena Rusu, Stéphane Vialette
2015	J	`jnl`	Pancake Flipping is hard. J. Comput. Syst. Sci. Laurent Bulteau, Guillaume Fertin, Irena Rusu
2015	J	`jnl`	Path-driven orientation of mixed graphs. Discret. Appl. Math. Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu
2014	—	`conf`	DExTaR: Detection of exact tandem repeats based on the de Bruijn graph. BIBM Guillaume Fertin, Géraldine Jean, Andreea Radulescu, Irena Rusu
2014	J	`jnl`	Easy Identification of Generalized Common and Conserved Nested Intervals. J. Comput. Biol. Fabien de Montgolfier, Mathieu Raffinot, Irena Rusu
2014	J	`jnl`	Extending common intervals searching from permutations to sequences. J. Discrete Algorithms Irena Rusu
2014	J	`jnl`	MinMax-profiles: A unifying view of common intervals, nested common intervals and conserved intervals of K permutations. Theor. Comput. Sci. Irena Rusu
2014	J	`jnl`	Permutation Reconstruction from MinMax-Betweenness Constraints. CoRR Irena Rusu
2013	C	`conf`	A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. WABI Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz, Irena Rusu
2013	J	`jnl`	A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. CoRR Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz, Irena Rusu
2013	J	`jnl`	Easy identification of generalized common nested intervals CoRR Fabien de Montgolfier, Mathieu Raffinot, Irena Rusu
2013	J	`jnl`	Extending Common Intervals Searching from Permutations to Sequences. CoRR Irena Rusu
2013	J	`jnl`	Maximal strip recovery problem with gaps: Hardness and approximation algorithms. J. Discrete Algorithms Laurent Bulteau, Guillaume Fertin, Irena Rusu
2013	J	`jnl`	MinMax-Profiles: A Unifying View of Common Intervals, Nested Common Intervals and Conserved Intervals of K Permutations CoRR Irena Rusu
2013	J	`jnl`	Revisiting the Minimum Breakpoint Linearization Problem. Theor. Comput. Sci. Laurent Bulteau, Guillaume Fertin, Irena Rusu
2012	B	`conf`	Algorithms for Subnetwork Mining in Heterogeneous Networks. SEA Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu
2012	J	`jnl`	New applications of interval generators to genome comparison. J. Discrete Algorithms Irena Rusu
2012	B	`conf`	Pancake Flipping Is Hard. MFCS Laurent Bulteau, Guillaume Fertin, Irena Rusu
2012	J	`jnl`	Sorting by Transpositions Is Difficult. SIAM J. Discret. Math. Laurent Bulteau, Guillaume Fertin, Irena Rusu
2012	J	`jnl`	Tractability and approximability of maximal strip recovery. Theor. Comput. Sci. Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu
2011	C	`conf`	Algorithmic Aspects of Heterogeneous Biological Networks Comparison. COCOA Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu, Florian Sikora, Stéphane Vialette
2011	J	`jnl`	Pancake Flipping is Hard CoRR Laurent Bulteau, Guillaume Fertin, Irena Rusu
2011	—	`conf`	SIPPER: A flexible method to integrate heterogeneous data into a metabolic network. ICCABS Philippe Bordron, Damien Eveillard, Irena Rusu
2011	—	`conf`	Sorting by Transpositions Is Difficult. ICALP (1) Laurent Bulteau, Guillaume Fertin, Irena Rusu
2011	J	`jnl`	Statistical properties of factor oracles. J. Discrete Algorithms Jérémie Bourdon, Irena Rusu
2011	B	`conf`	Tractability and Approximability of Maximal Strip Recovery. CPM Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu
2010	—	`conf`	Proper Alignment of MS/MS Spectra from Unsequenced Species. BIOCOMP Freddy Cliquet, Guillaume Fertin, Irena Rusu, Dominique Tessier
2010	C	`conf`	Revisiting the Minimum Breakpoint Linearization Problem. TAMC Laurent Bulteau, Guillaume Fertin, Irena Rusu
2010	J	`jnl`	Sorting by Transpositions is Difficult CoRR Laurent Bulteau, Guillaume Fertin, Irena Rusu
2009	—	`book`	Combinatorics of Genome Rearrangements. Guillaume Fertin, Anthony Labarre, Irena Rusu, Eric Tannier, Stéphane Vialette
2009	—	`conf`	Comparing Bacterial Genomes by Searching Their Common Intervals. BICoB Sébastien Angibaud, Damien Eveillard, Guillaume Fertin, Irena Rusu
2009	—	`conf`	Comparison of Spectra in Unsequenced Species. BSB Freddy Cliquet, Guillaume Fertin, Irena Rusu, Dominique Tessier
2009	J	`jnl`	Homogeneous decomposition of protein interaction networks: refining the description of intra-modular interactions. Bioinform. Géraldine Del Mondo, Damien Eveillard, Irena Rusu
2009	B	`conf`	Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms. ISAAC Laurent Bulteau, Guillaume Fertin, Irena Rusu
2009	J	`jnl`	On the Approximability of Comparing Genomes with Duplicates. J. Graph Algorithms Appl. Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette
2009	B	`conf`	Statistical Properties of Factor Oracles. CPM Jérémie Bourdon, Irena Rusu
2009	J	`jnl`	The Strong Perfect Graph Conjecture: 40 years of attempts, and its resolution. Discret. Math. Florian Roussel, Irena Rusu, Henri Thuillier
2008	J	`jnl`	Converting suffix trees into factor/suffix oracles. J. Discrete Algorithms Irena Rusu
2008	J	`jnl`	Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between Two Genomes with Duplicate Genes. J. Comput. Biol. Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette
2008	J	`jnl`	Maximum weight edge-constrained matchings. Discret. Appl. Math. Irena Rusu
2008	J	`jnl`	On the Approximability of Comparing Genomes with Duplicates CoRR Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette
2008	B	`conf`	On the Approximability of Comparing Genomes with Duplicates. WALCOM Sébastien Angibaud, Guillaume Fertin, Irena Rusu
2007	J	`jnl`	A Pseudo-Boolean Framework for Computing Rearrangement Distances between Genomes with Duplicates. J. Comput. Biol. Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette
2007	—	`conf`	A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes. RECOMB-CG Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette
2007	—	`conf`	Extending the Hardness of RNA Secondary Structure Comparison. ESCAPE Guillaume Blin, Guillaume Fertin, Irena Rusu, Christine Sinoquet
2006	—	`conf`	How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation. Comparative Genomics Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette
2004	J	`jnl`	Hard problems in similarity searching. Discret. Appl. Math. Christophe Moan, Irena Rusu
2004	J	`jnl`	Preface. Discret. Math. Jean-Luc Fouquet, Irena Rusu
2003	C	`conf`	Pattern Discovery Allowing Wild-Cards, Substitution Matrices, and Multiple Score Functions. WABI Alban Mancheron, Irena Rusu
2002	J	`jnl`	Dirac-type characterizations of graphs without long chordless cycles. Discret. Math. Vasek Chvátal, Irena Rusu, R. Sritharan
2002	J	`jnl`	Forbidden subgraph decomposition. Discret. Math. Irena Rusu, Jeremy P. Spinrad
2002	J	`jnl`	Loose vertices in Discret. Math. Igor Parfenoff, Florian Roussel, Irena Rusu
2001	J	`jnl`	An O( Discret. Math. Florian Roussel, Irena Rusu
2001	J	`jnl`	Domination graphs: examples and counterexamples. Discret. Appl. Math. Irena Rusu, Jeremy P. Spinrad
2000	J	`jnl`	Even pairs in Artemis graphs. Discret. Math. Irena Rusu
2000	J	`jnl`	Preface: Volume 5. Electron. Notes Discret. Math. Irena Rusu
2000	J	`jnl`	Recognizing i-triangulated graphs in O(mn) time. Inf. Process. Lett. Florian Roussel, Irena Rusu
1999	J	`jnl`	A Linear Algorithm to Color Inf. Process. Lett. Florian Roussel, Irena Rusu
1999	J	`jnl`	Berge graphs with chordless cycles of bounded length. J. Graph Theory Irena Rusu
1999	J	`jnl`	Holes and Dominoes in Meyniel Graphs. Int. J. Found. Comput. Sci. Florian Roussel, Irena Rusu
1999	J	`jnl`	On Graphs with Limited Number of P Int. J. Found. Comput. Sci. Florian Roussel, Irena Rusu, Henri Thuillier
1999	J	`jnl`	P Discret. Appl. Math. Irena Rusu
1999	J	`jnl`	Perfectly contractile diamond-free graphs. J. Graph Theory Irena Rusu
1999	B	`conf`	Triangulated Neighbourhoods in WG Igor Parfenoff, Florian Roussel, Irena Rusu
1997	J	`jnl`	Building counterexamples. Discret. Math. Irena Rusu
1997	J	`jnl`	On transversals in minimal imperfect graphs. Discret. Math. Jean-Luc Fouquet, Frédéric Maire, Irena Rusu, Henri Thuillier
1997	J	`jnl`	Weighted Parameters in Discret. Appl. Math. Vassilis Giakoumakis, Irena Rusu
1996	J	`jnl`	Properly orderable graphs. Discret. Math. Irena Rusu
1995	J	`jnl`	A new class of perfect Hoàng graphs. Discret. Math. Irena Rusu
1995	J	`jnl`	Perfect and locally perfect colorings. J. Graph Theory Irena Rusu
1995	J	`jnl`	Quasi-Parity and Perfect Graphs. Inf. Process. Lett. Irena Rusu