default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdeline Pierrot
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j6]Pierre Andrieu, Sarah Cohen-Boulakia
, Miguel Couceiro, Alain Denise, Adeline Pierrot:
A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings. Int. J. Approx. Reason. 162: 109035 (2023)- 2022
- [j5]Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin, Mickaël Maazoun, Adeline Pierrot:
Random cographs: Brownian graphon limit and asymptotic degree distribution. Random Struct. Algorithms 60(2): 166-200 (2022) - 2021
- [j4]Pierre Andrieu, Bryan Brancotte, Laurent Bulteau, Sarah Cohen-Boulakia, Alain Denise, Adeline Pierrot, Stéphane Vialette:
Efficient, robust and effective rank aggregation for massive biological datasets. Future Gener. Comput. Syst. 124: 406-421 (2021)
2010 – 2019
- 2019
- [c4]Pierre Andrieu, Bryan Brancotte, Laurent Bulteau, Sarah Cohen-Boulakia, Alain Denise, Adeline Pierrot, Stéphane Vialette:
Reliability-Aware and Graph-Based Approach for Rank Aggregation of Biological Data. eScience 2019: 136-145 - 2018
- [c3]Robin Milosz, Sylvie Hamel, Adeline Pierrot:
Median of 3 Permutations, 3-Cycles and 3-Hitting Set Problem. IWOCA 2018: 224-236 - 2017
- [j3]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) - [j2]Adeline Pierrot, Dominique Rossin:
2-Stack Sorting is Polynomial. Theory Comput. Syst. 60(3): 552-579 (2017) - 2015
- [j1]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: 124-200 (2015) - [i7]Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Carine Pivoteau, Dominique Rossin:
An algorithm computing combinatorial specifications of permutation classes. CoRR abs/1506.00868 (2015) - 2014
- [c2]Adeline Pierrot, Dominique Rossin:
2-Stack Sorting is polynomial. STACS 2014: 614-626 - 2013
- [c1]Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot, Stéphane Vialette:
Single and Multiple Consecutive Permutation Motif Search. ISAAC 2013: 66-77 - [i6]Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot, Stéphane Vialette:
Single and multiple consecutive permutation motif search. CoRR abs/1301.4952 (2013) - [i5]Adeline Pierrot, Dominique Rossin:
2-stack pushall sortable permutations. CoRR abs/1303.4376 (2013) - [i4]Adeline Pierrot, Dominique Rossin:
2-Stack Sorting is polynomial. CoRR abs/1304.2860 (2013) - [i3]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
- [i2]Adeline Pierrot, Dominique Rossin:
Simple permutations poset. CoRR abs/1201.3119 (2012) - 2010
- [i1]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 abs/1002.3866 (2010)
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-24 23:13 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:
