default search action
Dominique Rossin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j11]Frédérique Bassino
, Mathilde Bouvel, Adeline Pierrot, Carine Pivoteau, Dominique Rossin:
An algorithm computing combinatorial specifications of permutation classes. Discret. Appl. Math. 224: 16-44 (2017) - [j10]Adeline Pierrot, Dominique Rossin:
2-Stack Sorting is Polynomial. Theory Comput. Syst. 60(3): 552-579 (2017) - 2015
- [j9]Frédérique Bassino
An algorithm for deciding the finiteness of the number of simple permutations in permutation classes. Adv. Appl. Math. 64: 124-200 (2015) - [i11]Frédérique Bassino
An algorithm computing combinatorial specifications of permutation classes. CoRR abs/1506.00868 (2015) - 2014
- [j8]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: 40-50 (2014) - [c4]Adeline Pierrot, Dominique Rossin:
2-Stack Sorting is polynomial. STACS 2014: 614-626 - 2013
- [j7]Anne Micheli, Dominique Rossin:
Counting k-Convex Polyominoes. Electron. J. Comb. 20(2): 56 (2013) - [i10]Adeline Pierrot, Dominique Rossin:
2-stack pushall sortable permutations. CoRR abs/1303.4376 (2013) - [i9]Adeline Pierrot, Dominique Rossin:
2-Stack Sorting is polynomial. CoRR abs/1304.2860 (2013) - [i8]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 abs/1307.2006 (2013) - 2012
- [i7]Mathilde Bouvel, Cédric Chauve, Marni Mishna, Dominique Rossin:
Average-case analysis of perfect sorting by reversals (Journal Version). CoRR abs/1201.0940 (2012) - [i6]Adeline Pierrot, Dominique Rossin:
Simple permutations poset. CoRR abs/1201.3119 (2012) - 2011
- [j6]Frédérique Bassino, Mathilde Bouvel, Dominique Rossin:
Enumeration of Pin-Permutations. Electron. J. Comb. 18(1) (2011) - [j5]Mathilde Bouvel, Cédric Chauve, Marni Mishna
Average-Case Analysis of Perfect Sorting by Reversals. Discret. Math. Algorithms Appl. 3(3): 369-392 (2011) - 2010
- [i5]Frédérique Bassino
Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial. CoRR abs/1002.3866 (2010)
2000 – 2009
- 2009
- [j4]Mathilde Bouvel, Dominique Rossin:
A variant of the tandem duplication - random loss model of genome rearrangement. Theor. Comput. Sci. 410(8-10): 847-858 (2009) - [c3]Mathilde Bouvel, Cédric Chauve, Marni Mishna
Average-Case Analysis of Perfect Sorting by Reversals. CPM 2009: 314-325 - [i4]Mathilde Bouvel, Cédric Chauve, Marni Mishna, Dominique Rossin:
Average-case analysis of perfect sorting by reversals. CoRR abs/0901.2847 (2009) - 2007
- [c2]Mathilde Bouvel, Dominique Rossin, Stéphane Vialette:
Longest Common Separable Pattern Among Permutations. CPM 2007: 316-327 - [i3]Mathilde Bouvel, Dominique Rossin, Stéphane Vialette:
Longest Common Separable Pattern between Permutations. CoRR abs/math/0702109 (2007) - 2006
- [j3]Anne Micheli, Dominique Rossin:
Edit distance between unlabeled ordered trees. RAIRO Theor. Informatics Appl. 40(4): 593-609 (2006) - [i2]Dominique Rossin, Mathilde Bouvel:
Longest Common Pattern between two Permutations. CoRR abs/math/0611679 (2006) - 2005
- [i1]Anne Micheli, Dominique Rossin:
Edit Distance between Unlabeled Ordered Trees. CoRR abs/math/0506538 (2005) - 2002
- [j2]Robert Cori, Dominique Rossin, Bruno Salvy
Polynomial ideals for sandpiles and their Gröbner bases. Theor. Comput. Sci. 276(1-2): 1-15 (2002) - 2001
- [c1]Jean-Christophe Novelli, Dominique Rossin:
On the Toppling of a Sand Pile. DM-CCG 2001: 275-286 - 2000
- [j1]Robert Cori, Dominique Rossin:
On the Sandpile Group of Dual Graphs. Eur. J. Comb. 21(4): 447-459 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: