Rusu, Irena On the complexity of recognizing Stick, BipHook and max point-tolerance graphs. (English) Zbl 1522.68422 Theor. Comput. Sci. 952, Article ID 113773, 21 p. (2023). MSC: 68R10 05C62 68Q17 PDFBibTeX XMLCite \textit{I. Rusu}, Theor. Comput. Sci. 952, Article ID 113773, 21 p. (2023; Zbl 1522.68422) Full Text: DOI arXiv
Rusu, Irena Forced pairs in \(A\)-Stick graphs. (English) Zbl 1491.05159 Discrete Math. 345, No. 9, Article ID 112962, 22 p. (2022). MSC: 05C76 05C62 68R10 PDFBibTeX XMLCite \textit{I. Rusu}, Discrete Math. 345, No. 9, Article ID 112962, 22 p. (2022; Zbl 1491.05159) Full Text: DOI arXiv
Rusu, Irena Hamiltonian problems in directed graphs with simple row patterns. (English) Zbl 07533872 Theor. Comput. Sci. 916, 70-85 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{I. Rusu}, Theor. Comput. Sci. 916, 70--85 (2022; Zbl 07533872) Full Text: DOI
Bulteau, Laurent; Fertin, Guillaume; Labarre, Anthony; Rizzi, Romeo; Rusu, Irena Decomposing subcubic graphs into claws, paths or triangles. (English) Zbl 1522.05365 J. Graph Theory 98, No. 4, 557-588 (2021). MSC: 05C70 68Q17 PDFBibTeX XMLCite \textit{L. Bulteau} et al., J. Graph Theory 98, No. 4, 557--588 (2021; Zbl 1522.05365) Full Text: DOI
Rusu, Irena; Tenner, Bridget Eileen Admissible pinnacle orderings. (English) Zbl 1469.05006 Graphs Comb. 37, No. 4, 1205-1214 (2021). MSC: 05A05 05A18 68R15 PDFBibTeX XMLCite \textit{I. Rusu} and \textit{B. E. Tenner}, Graphs Comb. 37, No. 4, 1205--1214 (2021; Zbl 1469.05006) Full Text: DOI arXiv
Rusu, Irena Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT. (English) Zbl 1421.68088 Theor. Comput. Sci. 771, 23-38 (2019). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{I. Rusu}, Theor. Comput. Sci. 771, 23--38 (2019; Zbl 1421.68088) Full Text: DOI arXiv
Pelletier, Léo; Rusu, Irena Common intervals and permutation reconstruction from MinMax-betweenness constraints. (English) Zbl 1400.68150 J. Discrete Algorithms 49, 8-26 (2018). MSC: 68R05 05A05 68Q25 68W05 PDFBibTeX XMLCite \textit{L. Pelletier} and \textit{I. Rusu}, J. Discrete Algorithms 49, 8--26 (2018; Zbl 1400.68150) Full Text: DOI
Rusu, Irena Sorting signed permutations by reversals using link-cut trees. (English) Zbl 1426.68072 Inf. Process. Lett. 132, 44-48 (2018). MSC: 68P10 05A05 68W40 PDFBibTeX XMLCite \textit{I. Rusu}, Inf. Process. Lett. 132, 44--48 (2018; Zbl 1426.68072) Full Text: DOI
Jean, Géraldine; Radulescu, Andreea; Rusu, Irena The contig assembly problem and its algorithmic solutions. (English) Zbl 1457.68336 Elloumi, Mourad (ed.), Algorithms for next-generation sequencing data. Techniques, approaches, and applications. Cham: Springer. 267-298 (2017). MSC: 68W32 92D20 PDFBibTeX XMLCite \textit{G. Jean} et al., in: Algorithms for next-generation sequencing data. Techniques, approaches, and applications. Cham: Springer. 267--298 (2017; Zbl 1457.68336) Full Text: DOI
Rusu, Irena Graph matching problems and the NP-hardness of sortedness constraints. (English) Zbl 1375.68071 Theor. Comput. Sci. 695, 16-27 (2017). MSC: 68Q25 05C70 68Q17 90B35 90C27 PDFBibTeX XMLCite \textit{I. Rusu}, Theor. Comput. Sci. 695, 16--27 (2017; Zbl 1375.68071) Full Text: DOI
Rusu, Irena \(\log\)-lists and their applications to sorting by transpositions, reversals and block-interchanges. (English) Zbl 1357.68044 Theor. Comput. Sci. 660, 1-15 (2017). MSC: 68P05 68P10 PDFBibTeX XMLCite \textit{I. Rusu}, Theor. Comput. Sci. 660, 1--15 (2017; Zbl 1357.68044) Full Text: DOI arXiv
Bulteau, Laurent; Fertin, Guillaume; Labarre, Anthony; Rizzi, Romeo; Rusu, Irena Decomposing cubic graphs into connected subgraphs of size three. (English) Zbl 1476.68194 Dinh, Thang N. (ed.) et al., Computing and combinatorics. 22nd international conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2–4, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9797, 393-404 (2016). MSC: 68R10 05C70 05C75 68Q17 68Q25 PDFBibTeX XMLCite \textit{L. Bulteau} et al., Lect. Notes Comput. Sci. 9797, 393--404 (2016; Zbl 1476.68194) Full Text: DOI arXiv
Fertin, Guillaume; Rusu, Irena; Vialette, Stéphane Algorithmic aspects of the \(S\)-labeling problem. (English) Zbl 1476.68206 Lipták, Zsuzsanna (ed.) et al., Combinatorial algorithms. 26th international workshop, IWOCA 2015, Verona, Italy, October 5–7, 2015. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9538, 173-184 (2016). MSC: 68R10 05C78 05C85 68Q25 68W05 PDFBibTeX XMLCite \textit{G. Fertin} et al., Lect. Notes Comput. Sci. 9538, 173--184 (2016; Zbl 1476.68206) Full Text: DOI
Fertin, Guillaume; Komusiewicz, Christian; Mohamed-Babou, Hafedh; Rusu, Irena Finding supported paths in heterogeneous networks. (English) Zbl 1461.68151 Algorithms (Basel) 8, No. 4, 810-831 (2015). MSC: 68R10 05C38 05C85 68Q17 68Q25 92C42 PDFBibTeX XMLCite \textit{G. Fertin} et al., Algorithms (Basel) 8, No. 4, 810--831 (2015; Zbl 1461.68151) Full Text: DOI
Fertin, Guillaume; Rusu, Irena; Vialette, Stéphane Obtaining a triangular matrix by independent row-column permutations. (English) Zbl 1476.68106 Elbassioni, Khaled (ed.) et al., Algorithms and computation. 26th international symposium, ISAAC 2015, Nagoya, Japan, December 9–11, 2015. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9472, 165-175 (2015). MSC: 68Q17 05A05 05B20 68W40 PDFBibTeX XMLCite \textit{G. Fertin} et al., Lect. Notes Comput. Sci. 9472, 165--175 (2015; Zbl 1476.68106) Full Text: DOI HAL
Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena Pancake flipping is hard. (English) Zbl 1328.68084 J. Comput. Syst. Sci. 81, No. 8, 1556-1574 (2015). MSC: 68Q25 05A05 68P10 68Q17 PDFBibTeX XMLCite \textit{L. Bulteau} et al., J. Comput. Syst. Sci. 81, No. 8, 1556--1574 (2015; Zbl 1328.68084) Full Text: DOI arXiv
Fertin, Guillaume; Mohamed-Babou, Hafedh; Rusu, Irena Path-driven orientation of mixed graphs. (English) Zbl 1304.05081 Discrete Appl. Math. 181, 98-108 (2015). MSC: 05C38 05C20 05C40 05C85 68Q17 68Q25 92C42 PDFBibTeX XMLCite \textit{G. Fertin} et al., Discrete Appl. Math. 181, 98--108 (2015; Zbl 1304.05081) Full Text: DOI
Rusu, Irena Extending common intervals searching from permutations to sequences. (English) Zbl 1308.68201 J. Discrete Algorithms 29, 27-46 (2014). MSC: 68W32 05A05 92D10 PDFBibTeX XMLCite \textit{I. Rusu}, J. Discrete Algorithms 29, 27--46 (2014; Zbl 1308.68201) Full Text: DOI arXiv
Rusu, Irena MinMax-profiles: a unifying view of common intervals, nested common intervals and conserved intervals of \(K\) permutations. (English) Zbl 1417.68143 Theor. Comput. Sci. 543, 90-111 (2014). MSC: 68R05 05A05 68P05 68W40 92D10 PDFBibTeX XMLCite \textit{I. Rusu}, Theor. Comput. Sci. 543, 90--111 (2014; Zbl 1417.68143) Full Text: DOI arXiv
Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena Maximal strip recovery problem with gaps: hardness and approximation algorithms. (English) Zbl 1280.68094 J. Discrete Algorithms 19, 1-22 (2013). MSC: 68Q17 68W25 68W40 92D10 92D15 68W32 PDFBibTeX XMLCite \textit{L. Bulteau} et al., J. Discrete Algorithms 19, 1--22 (2013; Zbl 1280.68094) Full Text: DOI HAL
Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena Revisiting the minimum breakpoint linearization problem. (English) Zbl 1295.92020 Theor. Comput. Sci. 494, 122-133 (2013). MSC: 92D10 68W25 05C90 PDFBibTeX XMLCite \textit{L. Bulteau} et al., Theor. Comput. Sci. 494, 122--133 (2013; Zbl 1295.92020) Full Text: DOI
Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena Sorting by transpositions is difficult. (English) Zbl 1256.05004 SIAM J. Discrete Math. 26, No. 3, 1148-1180 (2012). MSC: 05A05 92C40 68R05 68P10 92D15 PDFBibTeX XMLCite \textit{L. Bulteau} et al., SIAM J. Discrete Math. 26, No. 3, 1148--1180 (2012; Zbl 1256.05004) Full Text: DOI arXiv
Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena Pancake flipping is hard. (English) Zbl 1329.68132 Rovan, Branislav (ed.) et al., Mathematical foundations of computer science 2012. 37th international symposium, MFCS 2012, Bratislava, Slovakia, August 27–31, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32588-5/pbk). Lecture Notes in Computer Science 7464, 247-258 (2012). MSC: 68Q25 05A05 68P10 68Q17 PDFBibTeX XMLCite \textit{L. Bulteau} et al., Lect. Notes Comput. Sci. 7464, 247--258 (2012; Zbl 1329.68132) Full Text: DOI arXiv
Bulteau, Laurent; Fertin, Guillaume; Jiang, Minghui; Rusu, Irena Tractability and approximability of maximal strip recovery. (English) Zbl 1252.68349 Theor. Comput. Sci. 440-441, 14-28 (2012). MSC: 68W25 92D10 68Q17 PDFBibTeX XMLCite \textit{L. Bulteau} et al., Theor. Comput. Sci. 440--441, 14--28 (2012; Zbl 1252.68349) Full Text: DOI
Rusu, Irena New applications of interval generators to genome comparison. (English) Zbl 1236.92023 J. Discrete Algorithms 10, 123-139 (2012). MSC: 92C40 92D10 05A05 68W32 92-08 92-04 PDFBibTeX XMLCite \textit{I. Rusu}, J. Discrete Algorithms 10, 123--139 (2012; Zbl 1236.92023) Full Text: DOI
Blin, Guillaume; Fertin, Guillaume; Mohamed-Babou, Hafedh; Rusu, Irena; Sikora, Florian; Vialette, Stéphane Algorithmic aspects of heterogeneous biological networks comparison. (English) Zbl 1342.68153 Wang, Weifan (ed.) et al., Combinatorial optimization and applications. 5th international conference, COCOA 2011, Zhangjiajie, China, August 4–6, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22615-1/pbk). Lecture Notes in Computer Science 6831, 272-286 (2011). MSC: 68Q25 05C90 92C42 PDFBibTeX XMLCite \textit{G. Blin} et al., Lect. Notes Comput. Sci. 6831, 272--286 (2011; Zbl 1342.68153) Full Text: DOI HAL
Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena Sorting by transpositions is difficult. (English) Zbl 1334.68085 Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4–8, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-22005-0/pbk). Lecture Notes in Computer Science 6755, 654-665 (2011). MSC: 68Q17 68P10 92D10 PDFBibTeX XMLCite \textit{L. Bulteau} et al., Lect. Notes Comput. Sci. 6755, 654--665 (2011; Zbl 1334.68085) Full Text: DOI arXiv
Bulteau, Laurent; Fertin, Guillaume; Jiang, Minghui; Rusu, Irena Tractability and approximability of maximal strip recovery. (English) Zbl 1339.92050 Giancarlo, Raffaele (ed.) et al., Combinatorial pattern matching. 22nd annual symposium, CPM 2011, Palermo, Italy, June 27–29, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21457-8/pbk). Lecture Notes in Computer Science 6661, 336-349 (2011). MSC: 92D10 68W25 PDFBibTeX XMLCite \textit{L. Bulteau} et al., Lect. Notes Comput. Sci. 6661, 336--349 (2011; Zbl 1339.92050) Full Text: DOI HAL
Bourdon, Jérémie; Rusu, Irena Statistical properties of factor oracles. (English) Zbl 1215.62129 J. Discrete Algorithms 9, No. 1, 57-66 (2011). MSC: 62P99 68U15 68T10 PDFBibTeX XMLCite \textit{J. Bourdon} and \textit{I. Rusu}, J. Discrete Algorithms 9, No. 1, 57--66 (2011; Zbl 1215.62129) Full Text: DOI
Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena Maximal strip recovery problem with gaps: hardness and approximation algorithms. (English) Zbl 1273.68406 Dong, Yingfei (ed.) et al., Algorithms and computation. 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16–18, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-10630-9/pbk). Lecture Notes in Computer Science 5878, 710-719 (2009). MSC: 68W25 68Q17 92D10 PDFBibTeX XMLCite \textit{L. Bulteau} et al., Lect. Notes Comput. Sci. 5878, 710--719 (2009; Zbl 1273.68406) Full Text: DOI HAL
Bourdon, Jérémie; Rusu, Irena Statistical properties of factor oracles. (English) Zbl 1247.68069 Kucherov, Gregory (ed.) et al., Combinatorial pattern matching. 20th annual symposium, CPM 2009, Lille, France, June 22–24, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02440-5/pbk). Lecture Notes in Computer Science 5577, 326-338 (2009). MSC: 68P10 68Q87 PDFBibTeX XMLCite \textit{J. Bourdon} and \textit{I. Rusu}, Lect. Notes Comput. Sci. 5577, 326--338 (2009; Zbl 1247.68069) Full Text: DOI HAL
Angibaud, Sébastien; Fertin, Guillaume; Rusu, Irena; Thévenin, Annelyse; Vialette, Stéphane On the approximability of comparing genomes with duplicates. (English) Zbl 1170.68049 J. Graph Algorithms Appl. 13, No. 1, 19-53 (2009). MSC: 68W25 68Q25 92-08 92D10 92D15 PDFBibTeX XMLCite \textit{S. Angibaud} et al., J. Graph Algorithms Appl. 13, No. 1, 19--53 (2009; Zbl 1170.68049) Full Text: DOI EuDML
Angibaud, Sébastien; Fertin, Guillaume; Rusu, Irena On the approximability of comparing genomes with duplicates. (English) Zbl 1132.68817 Nakano, Shin-ichi (ed.) et al., WALCOM: Algorithms and computation. Second international workshop, WALCOM 2008, Dhaka, Bangladesh, February 7–8, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-77890-5/pbk). Lecture Notes in Computer Science 4921, 34-45 (2008). MSC: 68W25 68Q25 92-08 92D10 92D15 PDFBibTeX XMLCite \textit{S. Angibaud} et al., Lect. Notes Comput. Sci. 4921, 34--45 (2008; Zbl 1132.68817) Full Text: DOI
Rusu, Irena Maximum weight edge-constrained matchings. (English) Zbl 1135.68026 Discrete Appl. Math. 156, No. 5, 662-672 (2008). MSC: 68Q25 05C70 05C85 68Q17 90C35 90C59 PDFBibTeX XMLCite \textit{I. Rusu}, Discrete Appl. Math. 156, No. 5, 662--672 (2008; Zbl 1135.68026) Full Text: DOI
Blin, Guillaume; Fertin, Guillaume; Rusu, Irena; Sinoquet, Christine Extending the hardness of RNA secondary structure comparison. (English) Zbl 1176.92018 Chen, Bo (ed.) et al., Combinatorics, algorithms, probabilistic and experimental methodologies. First international symposium, ESCAPE 2007, Hangzhou, China, April 7–9, 2007. Revised selected papers. Berlin: Springer (ISBN 978-3-540-74449-8/pbk). Lecture Notes in Computer Science 4614, 140-151 (2007). MSC: 92C40 92C42 68Q17 PDFBibTeX XMLCite \textit{G. Blin} et al., Lect. Notes Comput. Sci. 4614, 140--151 (2007; Zbl 1176.92018) Full Text: DOI HAL
Moan, Christophe; Rusu, Irena Hard problems in similarity searching. (English) Zbl 1077.68034 Discrete Appl. Math. 144, No. 1-2, 213-227 (2004). MSC: 68Q17 92C40 92D20 92-08 PDFBibTeX XMLCite \textit{C. Moan} and \textit{I. Rusu}, Discrete Appl. Math. 144, No. 1--2, 213--227 (2004; Zbl 1077.68034) Full Text: DOI
Roussel, F.; Rusu, I. An \(O(n^2)\) algorithm to color Meyniel graphs. (English) Zbl 0978.05033 Discrete Math. 235, No. 1-3, 107-123 (2001). MSC: 05C15 05C17 05C38 68R10 PDFBibTeX XMLCite \textit{F. Roussel} and \textit{I. Rusu}, Discrete Math. 235, No. 1--3, 107--123 (2001; Zbl 0978.05033) Full Text: DOI
Roussel, F.; Rusu, I. Recognizing \(i\)-triangulated graphs in \(O(mn)\) time. (English) Zbl 1339.05402 Inf. Process. Lett. 76, No. 3, 141-147 (2000). MSC: 05C85 68T20 PDFBibTeX XMLCite \textit{F. Roussel} and \textit{I. Rusu}, Inf. Process. Lett. 76, No. 3, 141--147 (2000; Zbl 1339.05402) Full Text: DOI Link
Roussel, F.; Rusu, I. A linear algorithm to color \(i\)-triangulated graphs. (English) Zbl 0990.05113 Inf. Process. Lett. 70, No. 2, 57-62 (1999). MSC: 05C85 05C15 68R10 PDFBibTeX XMLCite \textit{F. Roussel} and \textit{I. Rusu}, Inf. Process. Lett. 70, No. 2, 57--62 (1999; Zbl 0990.05113) Full Text: DOI
Rusu, Irena Quasi-parity and perfect graphs. (English) Zbl 0875.68686 Inf. Process. Lett. 54, No. 1, 35-39 (1995). MSC: 68R10 PDFBibTeX XMLCite \textit{I. Rusu}, Inf. Process. Lett. 54, No. 1, 35--39 (1995; Zbl 0875.68686) Full Text: DOI
Rusu, Irena Perfect and locally perfect colorings. (English) Zbl 0838.05093 J. Graph Theory 20, No. 4, 501-512 (1995). Reviewer: T.R.Walsh (Montreal) MSC: 05C85 05C15 68R10 PDFBibTeX XMLCite \textit{I. Rusu}, J. Graph Theory 20, No. 4, 501--512 (1995; Zbl 0838.05093) Full Text: DOI