Dominique Rossin

Publication Activity (10 Years)

Years Active: 2000-2017
Publications (10 Years): 4

Top Topics

Computational Effort

Matching Algorithm

Top Venues

Electron. J. Comb.

Theory Comput. Syst.

Discret. Appl. Math.

Publications

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