Admissible Pinnacle Orderings von Rusu, Irena, Tenner, Bridget Eileen

Volltext

On the complexity of recognizing Stick, BipHook and Max Point-Tolerance graphs von Rusu, Irena

Volltext

Hamiltonian problems in directed graphs with simple row patterns von Rusu, Irena

Volltext

Raney numbers, threshold sequences and Motzkin-like paths von Rusu, Irena

Volltext

Forced pairs in A-Stick graphs von Rusu, Irena

Volltext

Sorting Permutations with Fixed Pinnacle Set von Rusu, Irena

Volltext

Min (a)cyclic feedback vertex sets and min ones monotone 3-SAT von Rusu, Irena

Volltext

log-Lists and their applications to sorting by transpositions, reversals and block-interchanges von Rusu, Irena

Volltext

Graph matching problems and the NP-hardness of sortedness constraints von Rusu, Irena

Volltext

Sorting signed permutations by reversals using link-cut trees von Rusu, Irena

Volltext

Recognizing geometric intersection graphs stabbed by a line von Chakraborty, Dibyayan, Gajjar, Kshitij, Rusu, Irena

Volltext

Permutation reconstruction from MinMax-Betweenness constraints von Rusu, Irena

Volltext

Permutation reconstruction from MinMaxMinMax-Betweenness constraints von Rusu, Irena

Volltext

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

Volltext

Finding Supported Paths in Heterogeneous Networks von Fertin, Guillaume, Komusiewicz, Christian, Mohamed-Babou, Hafedh, Rusu, Irena

Volltext

Sorting by Transpositions Is Difficult von Bulteau, Laurent, Fertin, Guillaume, Rusu, Irena

Volltext

Pancake Flipping is hard von Bulteau, Laurent, Fertin, Guillaume, Rusu, Irena

Volltext

Extending common intervals searching from permutations to sequences von Rusu, Irena

Volltext

Decomposing subcubic graphs into claws, paths or triangles von Bulteau, Laurent, Fertin, Guillaume, Labarre, Anthony, Rizzi, Romeo, Rusu, Irena

Volltext

The S-labeling problem: An algorithmic tour von Fertin, Guillaume, Rusu, Irena, Vialette, Stéphane

Volltext