Dominique Rossin

According to our database1, Dominique Rossin authored at least 19 papers between 2000 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
2-Stack Sorting is Polynomial.
Theory Comput. Syst., 2017

An algorithm computing combinatorial specifications of permutation classes.
Discret. Appl. Math., 2017

2015
An algorithm for deciding the finiteness of the number of simple permutations in permutation classes.
Adv. Appl. Math., 2015

2014
Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths.
Discret. Math., 2014

2013
2-stack pushall sortable permutations
CoRR, 2013

Counting k-Convex Polyominoes.
Electron. J. Comb., 2013

2012
Simple permutations poset
CoRR, 2012

Average-case analysis of perfect sorting by reversals (Journal Version)
CoRR, 2012

2011
Average-Case Analysis of Perfect Sorting by Reversals.
Discret. Math. Algorithms Appl., 2011

Enumeration of Pin-Permutations.
Electron. J. Comb., 2011

2010
Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial
CoRR, 2010

2009
A variant of the tandem duplication - random loss model of genome rearrangement.
Theor. Comput. Sci., 2009

2007
Longest Common Separable Pattern between Permutations
CoRR, 2007

Longest Common Separable Pattern Among Permutations.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006
Edit distance between unlabeled ordered trees.
RAIRO Theor. Informatics Appl., 2006

Longest Common Pattern between two Permutations
CoRR, 2006

2002
Polynomial ideals for sandpiles and their Gröbner bases.
Theor. Comput. Sci., 2002

2001
On the Toppling of a Sand Pile.
Proceedings of the Discrete Models: Combinatorics, Computation, and Geometry, 2001

2000
On the Sandpile Group of Dual Graphs.
Eur. J. Comb., 2000


  Loading...