Dominique Rossin

26 papers A 1B 2Journal 22Unranked 1
YearRankTypeTitle / Venue / Authors
2017 J jnl
2-Stack Sorting is Polynomial.
Theory Comput. Syst.
Adeline Pierrot, Dominique Rossin
2017 J jnl
An algorithm computing combinatorial specifications of permutation classes.
Discret. Appl. Math.
Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Carine Pivoteau, Dominique Rossin
2015 J jnl
An algorithm computing combinatorial specifications of permutation classes.
CoRR
Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Carine Pivoteau, Dominique Rossin
2015 J jnl
An algorithm for deciding the finiteness of the number of simple permutations in permutation classes.
Adv. Appl. Math.
Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Dominique Rossin
2014 A conf
2-Stack Sorting is polynomial.
STACS
Adeline Pierrot, Dominique Rossin
2014 J jnl
Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths.
Discret. Math.
Phan-Thuan Do, Dominique Rossin, Thi Thu Huong Tran
2013 J jnl
2-Stack Sorting is polynomial
CoRR
Adeline Pierrot, Dominique Rossin
2013 J jnl
2-stack pushall sortable permutations
CoRR
Adeline Pierrot, Dominique Rossin
2013 J jnl
An algorithm for deciding the finiteness of the number of simple permutations in permutation classes.
CoRR
Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Dominique Rossin
2013 J jnl
Counting k-Convex Polyominoes.
Electron. J. Comb.
Anne Micheli, Dominique Rossin
2012 J jnl
Average-case analysis of perfect sorting by reversals (Journal Version)
CoRR
Mathilde Bouvel, Cédric Chauve, Marni Mishna, Dominique Rossin
2012 J jnl
Simple permutations poset
CoRR
Adeline Pierrot, Dominique Rossin
2011 J jnl
Average-Case Analysis of Perfect Sorting by Reversals.
Discret. Math. Algorithms Appl.
Mathilde Bouvel, Cédric Chauve, Marni Mishna, Dominique Rossin
2011 J jnl
Enumeration of Pin-Permutations.
Electron. J. Comb.
Frédérique Bassino, Mathilde Bouvel, Dominique Rossin
2010 J jnl
Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial
CoRR
Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Dominique Rossin
2009 J jnl
A variant of the tandem duplication - random loss model of genome rearrangement.
Theor. Comput. Sci.
Mathilde Bouvel, Dominique Rossin
2009 B conf
Average-Case Analysis of Perfect Sorting by Reversals.
CPM
Mathilde Bouvel, Cédric Chauve, Marni Mishna, Dominique Rossin
2009 J jnl
Average-case analysis of perfect sorting by reversals
CoRR
Mathilde Bouvel, Cédric Chauve, Marni Mishna, Dominique Rossin
2007 B conf
Longest Common Separable Pattern Among Permutations.
CPM
Mathilde Bouvel, Dominique Rossin, Stéphane Vialette
2007 J jnl
Longest Common Separable Pattern between Permutations
CoRR
Mathilde Bouvel, Dominique Rossin, Stéphane Vialette
2006 J jnl
Edit distance between unlabeled ordered trees.
RAIRO Theor. Informatics Appl.
Anne Micheli, Dominique Rossin
2006 J jnl
Longest Common Pattern between two Permutations
CoRR
Dominique Rossin, Mathilde Bouvel
2005 J jnl
Edit Distance between Unlabeled Ordered Trees
CoRR
Anne Micheli, Dominique Rossin
2002 J jnl
Polynomial ideals for sandpiles and their Gröbner bases.
Theor. Comput. Sci.
Robert Cori, Dominique Rossin, Bruno Salvy
2001 — conf
On the Toppling of a Sand Pile.
DM-CCG
Jean-Christophe Novelli, Dominique Rossin
2000 J jnl
On the Sandpile Group of Dual Graphs.
Eur. J. Comb.
Robert Cori, Dominique Rossin