activity
20072026
most citedOn restrictions of balanced 2-interval graphs

9 citations · 12 across the 6 of their papers we have counts for

collaborators
Showing cs.DSShow all

6 papers · 1 filter

cs.DS2025

Branch Prediction Analysis of Morris-Pratt and Knuth-Morris-Pratt Algorithms

Cyril Nicaud, Carine Pivoteau, Stéphane Vialette

We analyze the classical Morris-Pratt and Knuth-Morris-Pratt pattern matching algorithms through the lens of computer architecture, investigating the impact of incorporating a simp…

cs.DS2018

Finding a Small Number of Colourful Components

Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin +3

A partition of the vertex set of a graph with a (not necessarily proper) colouring is colourful if no two vertices in any have the same colour and…

cs.DS2018

Algorithmic and algebraic aspects of unshuffling permutations

Samuele Giraudo, Stéphane Vialette

A permutation is said to be a square if it can be obtained by shuffling two order-isomorphic patterns. The definition is intended to be the natural counterpart to the ordinary shuf…

cs.DS2016

Unshuffling Permutations

Samuele Giraudo, Stéphane Vialette

A permutation is said to be a square if it can be obtained by shuffling two order-isomorphic patterns. The definition is intended to be the natural counterpart to the ordinary shuf…

cs.DS2013

Single and multiple consecutive permutation motif search

Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot +1

Let be a permutation (that shall play the role of the {\em text}) on and a pattern be a sequence of distinct integer(s) of , . The pattern occur…

cs.DS20081 cited

Comparing RNA structures using a full set of biologically relevant edit operations is intractable

Guillaume Blin, Sylvie Hamel, Stéphane Vialette

Arc-annotated sequences are useful for representing structural information of RNAs and have been extensively used for comparing RNA structures in both terms of sequence and structu…