Anthony Labarre

Orcid: 0000-0002-9945-6774

Affiliations:
  • University of Paris-Est Marne-la-Vallée, France
  • Université Gustave Eiffel, France (former)


According to our database1, Anthony Labarre authored at least 26 papers between 2005 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Sorting genomes by prefix double-cut-and-joins.
Theor. Comput. Sci., 2025

2023
Sorting by prefix block-interchanges.
Theor. Comput. Sci., May, 2023

2021
Decomposing subcubic graphs into claws, paths or triangles.
J. Graph Theory, 2021

Central limit theorem for the prefix exchange distance under Ewens sampling formula.
Discret. Math., 2021

2020
The Clever Shopper Problem.
Theory Comput. Syst., 2020

Sorting with forbidden intermediates.
Discret. Appl. Math., 2020

2018
Solving the tree containment problem in linear time for nearly stable phylogenetic networks.
Discret. Appl. Math., 2018

The Clever Shopper Problem.
Proceedings of the Computer Science - Theory and Applications, 2018

2016
Asymptotic normality and combinatorial aspects of the prefix exchange distance distribution.
Adv. Appl. Math., 2016

Decomposing Cubic Graphs into Connected Subgraphs of Size Three.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015
Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with <i>IDP3</i>.
Theory Pract. Log. Program., 2015

Locating a Tree in a Phylogenetic Network in Quadratic Time.
Proceedings of the Research in Computational Molecular Biology, 2015

Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time.
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

2014
Merging Partially Labelled Trees: Hardness and a DeclarativeProgramming Solution.
IEEE ACM Trans. Comput. Biol. Bioinform., 2014

2013
Review of graph algorithms (2nd edition) by Shimon Even, edited by Guy Even.
SIGACT News, 2013

Lower Bounding Edit Distances between Permutations.
SIAM J. Discret. Math., 2013

The distribution of cycles in breakpoint graphs of signed permutations.
Discret. Appl. Math., 2013

Predicate Logic as a Modeling Language: Modeling and Solving some Machine Learning and Data Mining Problems with IDP3.
CoRR, 2013

2012
Review of combinatorial pattern matching algorithms in computational biology using Perl and R, by Gabriel Valiente.
SIGACT News, 2012

Modeling Machine Learning and Data Mining Problems with FO(·).
Proceedings of the Technical Communications of the 28th International Conference on Logic Programming, 2012

2011
Polynomial-time sortable stacks of burnt pancakes.
Theor. Comput. Sci., 2011

2009
Combinatorics of Genome Rearrangements.
Computational molecular biology, MIT Press, ISBN: 978-0-262-06282-4, 2009

2008
Combinatorial aspects of genome rearrangements and haplotype networks.
PhD thesis, 2008

Edit Distances and Factorisations of Even Permutations.
Proceedings of the Algorithms, 2008

2006
New Bounds and Tractable Instances for the Transposition Distance.
IEEE ACM Trans. Comput. Biol. Bioinform., 2006

2005
A New Tight Upper Bound on the Transposition Distance.
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005


  Loading...