On the Sandpile Group of Dual Graphs. - Robert Cori; Dominique Rossin (Eur. J. Comb., 2000)

On the Toppling of a Sand Pile. - Jean-Christophe Novelli; Dominique Rossin (DM-CCG, 2001)

Polynomial ideals for sandpiles and their Gröbner bases. - Robert Cori; Dominique Rossin; Bruno Salvy (Theor. Comput. Sci., 2002)

Longest Common Pattern between two Permutations - Dominique Rossin; Mathilde Bouvel (CoRR, 2006)

Edit distance between unlabeled ordered trees. - Anne Micheli; Dominique Rossin (RAIRO Theor. Informatics Appl., 2006)

Longest Common Separable Pattern Among Permutations. - Mathilde Bouvel; Dominique Rossin; Stéphane Vialette (CPM, 2007)

Longest Common Separable Pattern between Permutations - Mathilde Bouvel; Dominique Rossin; Stéphane Vialette (CoRR, 2007)

A variant of the tandem duplication - random loss model of genome rearrangement. - Mathilde Bouvel; Dominique Rossin (Theor. Comput. Sci., 2009)

Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial - Frédérique Bassino; Mathilde Bouvel; Adeline Pierrot; Dominique Rossin (CoRR, 2010)

Enumeration of Pin-Permutations. - Frédérique Bassino; Mathilde Bouvel; Dominique Rossin (Electron. J. Comb., 2011)

Average-Case Analysis of Perfect Sorting by Reversals. - Mathilde Bouvel; Cédric Chauve; Marni Mishna; Dominique Rossin (Discret. Math. Algorithms Appl., 2011)

Average-case analysis of perfect sorting by reversals (Journal Version) - Mathilde Bouvel; Cédric Chauve; Marni Mishna; Dominique Rossin (CoRR, 2012)

Simple permutations poset - Adeline Pierrot; Dominique Rossin (CoRR, 2012)

Counting k-Convex Polyominoes. - Anne Micheli; Dominique Rossin (Electron. J. Comb., 2013)

2-stack pushall sortable permutations - Adeline Pierrot; Dominique Rossin (CoRR, 2013)

Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths. - Phan-Thuan Do; Dominique Rossin; Thi Thu Huong Tran (Discret. Math., 2014)

An algorithm for deciding the finiteness of the number of simple permutations in permutation classes. - Frédérique Bassino; Mathilde Bouvel; Adeline Pierrot; Dominique Rossin (Adv. Appl. Math., 2015)

An algorithm computing combinatorial specifications of permutation classes. - Frédérique Bassino; Mathilde Bouvel; Adeline Pierrot; Carine Pivoteau; Dominique Rossin (Discret. Appl. Math., 2017)

2-Stack Sorting is Polynomial. - Adeline Pierrot; Dominique Rossin (Theory Comput. Syst., 2017)