| On the sandpile group of dual graphs R Cori, D Rossin European Journal of Combinatorics 21 (4), 447-459, 2000 | 221 | 2000 |
| On the identity of the sandpile group Y Le Borgne, D Rossin Discrete mathematics 256 (3), 775-790, 2002 | 67 | 2002 |
| Polynomial ideals for sandpiles and their Gröbner bases R Cori, D Rossin, B Salvy Theoretical Computer Science 276 (1-2), 1-15, 2002 | 49 | 2002 |
| Fractal dimensions from a three-dimensional intermittency analysis in e+ e− annihilation HJ Behrend, L Criege, JH Field, G Franke, H Jung, J Meyer, O Podobrin, ... Physics Letters B 256 (1), 97-104, 1991 | 38 | 1991 |
| The longest common pattern problem for two permutations D Rossin, M Bouvel Pure Mathematics and Applications 17 (1-2), 55-69, 2006 | 32 | 2006 |
| A variant of the tandem duplication—random loss model of genome rearrangement M Bouvel, D Rossin Theoretical Computer Science 410 (8-10), 847-858, 2009 | 29 | 2009 |
| Longest common separable pattern among permutations M Bouvel, D Rossin, S Vialette Combinatorial Pattern Matching: 18th Annual Symposium, CPM 2007, London …, 2007 | 19 | 2007 |
| An algorithm computing combinatorial specifications of permutation classes F Bassino, M Bouvel, A Pierrot, C Pivoteau, D Rossin Discrete Applied Mathematics 224, 16-44, 2017 | 17 | 2017 |
| Enumeration of pin-permutations F Bassino, M Bouvel, D Rossin the electronic journal of combinatorics 18 (1), P57, 2011 | 17 | 2011 |
| Bidimensional sand pile and ice pile models E Duchi, R Mantaci, HD Phan, D Rossin | 16 | 2007 |
| 2-stack sorting is polynomial A Pierrot, D Rossin Theory of Computing Systems 60, 552-579, 2017 | 14 | 2017 |
| An algorithm for deciding the finiteness of the number of simple permutations in permutation classes F Bassino, M Bouvel, A Pierrot, D Rossin Advances in Applied Mathematics 64, 124-200, 2015 | 14 | 2015 |
| Avalanche polynomials of some families of graphs R Cori, A Dartois, D Rossin Mathematics and Computer Science III: Algorithms, Trees, Combinatorics and …, 2004 | 13 | 2004 |
| Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial F Bassino, M Bouvel, A Pierrot, D Rossin arXiv preprint arXiv:1002.3866, 2010 | 12 | 2010 |
| Average-case analysis of perfect sorting by reversals M Bouvel, C Chauve, M Mishna, D Rossin Discrete Mathematics, Algorithms and Applications 3 (03), 369-392, 2011 | 11 | 2011 |
| Height arrow model A Dartois, D Rossin FPSAC PROCEEDINGS 2004 ACTES SFCA 2004 Vancouver CANADA, 87, 2004 | 11 | 2004 |
| Simple permutations poset A Pierrot, D Rossin | 10 | 2011 |
| Proprietes combinatoires de certaines familles d'automates cellulaires D Rossin Ecole Polytechnique X, 2000 | 9 | 2000 |
| Adjacent transformations in permutations A Pierrot, D Rossin, J West Discrete Mathematics & Theoretical Computer Science, 2011 | 8* | 2011 |
| Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths PT Do, D Rossin, TTH Tran Discrete Mathematics 320, 40-50, 2014 | 7 | 2014 |
