default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnthony Labarre
Person information
- affiliation: University of Paris-Est Marne-la-Vallée, France
- affiliation (former): Université Gustave Eiffel, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j16]Guillaume Fertin, Géraldine Jean, Anthony Labarre:
Sorting genomes by prefix double-cut-and-joins. Theor. Comput. Sci. 1024: 114909 (2025)- 2023
- [j15]Anthony Labarre
:
Sorting by prefix block-interchanges. Theor. Comput. Sci. 958: 113857 (2023) - 2022
- [c10]Guillaume Fertin, Géraldine Jean, Anthony Labarre:
Sorting Genomes by Prefix Double-Cut-and-Joins. SPIRE 2022: 178-190 - [i10]Guillaume Fertin, Géraldine Jean, Anthony Labarre:
Sorting Genomes by Prefix Double-Cut-and-Joins. CoRR abs/2208.14315 (2022) - 2021
- [j14]Simona Grusea, Anthony Labarre:
Central limit theorem for the prefix exchange distance under Ewens sampling formula. Discret. Math. 344(2): 112206 (2021) - [j13]Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu:
Decomposing subcubic graphs into claws, paths or triangles. J. Graph Theory 98(4): 557-588 (2021) - 2020
- [j12]Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette:
Sorting with forbidden intermediates. Discret. Appl. Math. 279: 49-68 (2020) - [j11]Laurent Bulteau, Danny Hermelin, Dusan Knop, Anthony Labarre, Stéphane Vialette:
The Clever Shopper Problem. Theory Comput. Syst. 64(1): 17-34 (2020) - [c9]Anthony Labarre:
Sorting by Prefix Block-Interchanges. ISAAC 2020: 55:1-55:15 - [i9]Anthony Labarre:
Sorting by Prefix Block-Interchanges. CoRR abs/2008.13640 (2020)
2010 – 2019
- 2018
- [j10]Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang:
Solving the tree containment problem in linear time for nearly stable phylogenetic networks. Discret. Appl. Math. 246: 62-79 (2018) - [c8]Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette:
The Clever Shopper Problem. CSR 2018: 53-64 - [i8]Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette:
The Clever Shopper Problem. CoRR abs/1802.07944 (2018) - 2016
- [j9]Simona Grusea, Anthony Labarre:
Asymptotic normality and combinatorial aspects of the prefix exchange distance distribution. Adv. Appl. Math. 78: 94-113 (2016) - [c7]Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette:
Sorting with Forbidden Intermediates. AlCoB 2016: 133-144 - [c6]Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu:
Decomposing Cubic Graphs into Connected Subgraphs of Size Three. COCOON 2016: 393-404 - [i7]Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette:
Sorting With Forbidden Intermediates. CoRR abs/1602.06283 (2016) - [i6]Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu:
Decomposing Cubic Graphs into Connected Subgraphs of Size Three. CoRR abs/1604.08603 (2016) - 2015
- [j8]Maurice Bruynooghe, Hendrik Blockeel, Bart Bogaerts, Broes De Cat, Stef De Pooter, Joachim Jansen, Anthony Labarre, Jan Ramon, Marc Denecker, Sicco Verwer:
Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3. Theory Pract. Log. Program. 15(6): 783-817 (2015) - [c5]Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang:
Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time. IWOCA 2015: 197-208 - [c4]Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang:
Locating a Tree in a Phylogenetic Network in Quadratic Time. RECOMB 2015: 96-107 - [i5]Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang:
Locating a Tree in a Phylogenetic Network in Quadratic Time. CoRR abs/1502.03379 (2015) - 2014
- [j7]Anthony Labarre, Sicco Verwer:
Merging Partially Labelled Trees: Hardness and a DeclarativeProgramming Solution. IEEE ACM Trans. Comput. Biol. Bioinform. 11(2): 389-397 (2014) - 2013
- [j6]Simona Grusea, Anthony Labarre:
The distribution of cycles in breakpoint graphs of signed permutations. Discret. Appl. Math. 161(10-11): 1448-1466 (2013) - [j5]Anthony Labarre:
Lower Bounding Edit Distances between Permutations. SIAM J. Discret. Math. 27(3): 1410-1428 (2013) - [j4]Anthony Labarre:
Review of graph algorithms (2nd edition) by Shimon Even, edited by Guy Even. SIGACT News 44(3): 15-16 (2013) - [i4]Maurice Bruynooghe, Hendrik Blockeel, Bart Bogaerts, Broes De Cat, Stef De Pooter, Joachim Jansen, Anthony Labarre, Jan Ramon, Marc Denecker, Sicco Verwer:
Predicate Logic as a Modeling Language: Modeling and Solving some Machine Learning and Data Mining Problems with IDP3. CoRR abs/1309.6883 (2013) - 2012
- [j3]Anthony Labarre:
Review of combinatorial pattern matching algorithms in computational biology using Perl and R, by Gabriel Valiente. SIGACT News 43(3): 48-50 (2012) - [c3]Hendrik Blockeel, Bart Bogaerts, Maurice Bruynooghe, Broes De Cat, Stef De Pooter, Marc Denecker, Anthony Labarre, Jan Ramon, Sicco Verwer:
Modeling Machine Learning and Data Mining Problems with FO(·). ICLP (Technical Communications) 2012: 14-25 - [i3]Anthony Labarre:
Lower bounding edit distances between permutations. CoRR abs/1201.0365 (2012) - 2011
- [j2]Anthony Labarre, Josef Cibulka:
Polynomial-time sortable stacks of burnt pancakes. Theor. Comput. Sci. 412(8-10): 695-702 (2011) - [i2]Simona Grusea, Anthony Labarre:
The distribution of cycles in breakpoint graphs of signed permutations. CoRR abs/1104.3353 (2011) - 2010
- [i1]Anthony Labarre, Josef Cibulka:
Polynomial-time sortable stacks of burnt pancakes. CoRR abs/1010.0219 (2010)
2000 – 2009
- 2009
- [b2]Guillaume Fertin, Anthony Labarre, Irena Rusu, Eric Tannier, Stéphane Vialette:
Combinatorics of Genome Rearrangements. Computational molecular biology, MIT Press 2009, ISBN 978-0-262-06282-4, pp. I-XI, 1-288 - 2008
- [b1]Anthony Labarre:
Combinatorial aspects of genome rearrangements and haplotype networks. Université libre de Bruxelles, Brussels, Belgium, 2008 - [c2]Anthony Labarre:
Edit Distances and Factorisations of Even Permutations. ESA 2008: 635-646 - 2006
- [j1]Anthony Labarre:
New Bounds and Tractable Instances for the Transposition Distance. IEEE ACM Trans. Comput. Biol. Bioinform. 3(4): 380-394 (2006) - 2005
- [c1]Anthony Labarre:
A New Tight Upper Bound on the Transposition Distance. WABI 2005: 216-227
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-11-04 21:40 CET 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:
