Publications

For there's nothing hidden anywhere
It's all there to be sought

—Procol Harum, In Held 'Twas in I
(by category and reverse chronological order)

Other pages are available on Google Scholar, DBLP, ResearcherID, Mendeley, and The Collection of Computer Science Bibliographies. Feel free to get in touch if you need a copy of a paper that I haven't gotten around to uploading yet.

[1] Fertin, G., Labarre, A., Rusu, I., Tannier, E., and Vialette, S. Combinatorics of Genome Rearrangements. Computational Molecular Biology. The MIT Press, 2009.
[ Zentralblatt | MathSciNet | Publisher's page ]

Combinatorics of Genome Rearrangements: front cover
[26] Labarre, A. Sorting by Prefix Block-Interchanges. Theoretical Computer Science 958 (May 2023), 113857.
[25] Fertin, G., Jean, G., and Labarre, A. Sorting Genomes by Prefix Double-Cut-and-Joins. In 29th International Symposium on String Processing and Information Retrieval (SPIRE) (Nov. 2022), D. Arroyuelo and B. Poblete, Eds., vol. 13617 of Lecture Notes in Computer Science, pp. 178–190.
[24] Bulteau, L., Fertin, G., Labarre, A., Rizzi, R., and Rusu, I. Decomposing subcubic graphs into claws, paths or triangles. Journal of Graph Theory 98, 4 (Dec. 2021), 557–588.
[23] Grusea, S., and Labarre, A. Central limit theorem for the prefix exchange distance under Ewens sampling formula. Discrete Mathematics 344 (Feb. 2021), 1–6.
[22] Labarre, A. Sorting by Prefix Block-Interchanges. In 31st International Symposium on Algorithms and Computation (ISAAC) (Dagstuhl, Germany, 2020), Y. Cao, S.-W. Cheng, and M. Li, Eds., vol. 181 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl–Leibniz-Zentrum für Informatik, pp. 55:1–55:15.
[21] Comin, C., Labarre, A., Rizzi, R., and Vialette, S. Sorting with forbidden intermediates. Discrete Applied Mathematics 279C (2020), 49–68.
[20] Bulteau, L., Hermelin, D., Knop, D., Labarre, A., and Vialette, S. The clever shopper problem. Theory of Computing Systems 64 (Apr. 2020), 17–34.
[19] Bulteau, L., Hermelin, D., Labarre, A., and Vialette, S. The clever shopper problem. In Proceedings of the 13th International Computer Science Symposium in Russia (CSR) (Moscow, Russia, June 2018), vol. 10846 of Lecture Notes in Computer Science, Springer, pp. 53–64.
[18] Gambette, P., Gunawan, A., Labarre, A., Vialette, S., and Zhang, L. Solving the tree containment problem in linear-time for nearly stable phylogenetic networks. Discrete Applied Mathematics 246 (2018), 62–79.
[17] Bulteau, L., Fertin, G., Labarre, A., Rizzi, R., and Rusu, I. Decomposing cubic graphs into connected subgraphs of size three. In Proceedings of the 22nd International Computing and Combinatorics Conference (COCOON) (Ho Chi Minh City, Vietnam, Aug. 2016), T. N. Dinh and M. T. Thai, Eds., vol. 9797 of Lecture Notes in Computer Science, Springer, pp. 393–404.
[16] Grusea, S., and Labarre, A. Asymptotic normality and combinatorial aspects of the prefix exchange distance distribution. Advances in Applied Mathematics 78 (July 2016), 94–13.
[15] Comin, C., Labarre, A., Rizzi, R., and Vialette, S. Sorting with forbidden intermediates. In Proceedings of the Third International Conference on Algorithms for Computational Biology (AlCoB) (Trujillo, Spain, June 2016), M. Botón-Fernández, C. Martín-Vide, S. Santander-Jiménez, and M. A. Vega-Rodríguez, Eds., vol. 9702 of Lecture Notes in Computer Science, Springer, pp. 133–144.
[14] Gambette, P., Gunawan, A., Labarre, A., Vialette, S., and Zhang, L. Solving the tree containment problem for genetically stable networks in quadratic time. In Proceedings of the 26th International Workshop on Combinatorial Algorithms (IWOCA) (Oct. 2016), Z. Lipták and W. F. Smyth, Eds., vol. 9538 of Lecture Notes in Computer Science, Springer, pp. 197–208.
[13] Gambette, P., Gunawan, A., Labarre, A., Vialette, S., and Zhang, L. Locating a tree in a phylogenetic network in quadratic time. In Proceedings of the 19th Annual International Conference on Research in Computational Molecular Biology (RECOMB) (Apr. 2015), T. M. Przytycka, Ed., vol. 9029 of Lecture Notes in Computer Science, Springer, pp. 96–107.
[12] Blockeel, H., Bogaerts, B., Bruynooghe, M., De Cat, B., De Pooter, S., Denecker, M., Jansen, J., Labarre, A., Ramon, J., and Verwer, S. Predicate logic as a modeling language: Modeling and solving some machine learning and data mining problems with IDP3. Theory and Practice of Logic Programming 15, 6 (Nov. 2015), 783–817.
[11] Labarre, A., and Verwer, S. Merging partially labelled trees: hardness and a declarative programming solution. IEEE/ACM Transactions on Computational Biology and Bioinformatics 11, 2 (Mar. 2014), 389–397.
[10] Labarre, A. Review of graph algorithms (2nd edition) by Shimon Even, edited by Guy Even. SIGACT News 44, 3 (2013), 15–16.
[9] Labarre, A. Lower bounding edit distances between permutations. SIAM Journal on Discrete Mathematics 27, 3 (2013), 1410–1428.
[8] Grusea, S., and Labarre, A. The distribution of cycles in breakpoint graphs of signed permutations. Discrete Applied Mathematics 161, 10-11 (2013), 1448–1466.
[7] Labarre, A. Review of combinatorial pattern matching algorithms in computational biology using Perl and R, by Gabriel Valiente. SIGACT News 43, 3 (2012), 48–50.
[6] Blockeel, H., Bogaerts, B., Bruynooghe, M., De Cat, B., De Pooter, S., Denecker, M., Labarre, A., Ramon, J., and Verwer, S. Modeling machine learning problems with FO(·). In Technical Communications of the Twenty-Eighth International Conference on Logic Programming (ICLP) (Dagstuhl, Germany, Sept. 2012), A. Dovier and V. Santos Costa, Eds., vol. 17 of Leibniz International Proceedings in Informatics, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, pp. 14–25.
[5] Labarre, A., and Cibulka, J. Polynomial-time sortable stacks of burnt pancakes. Theoretical Computer Science 412, 8-10 (Mar. 2011), 695–702.
[4] Labarre, A. Edit distances and factorisations of even permutations. In Proceedings of the Sixteenth Annual European Symposium on Algorithms (ESA) (Karlsruhe, Germany, Sept. 2008), D. Halperin and K. Mehlhorn, Eds., vol. 5193 of Lecture Notes in Computer Science, Springer-Verlag, pp. 635–646.
[3] Doignon, J.-P., and Labarre, A. On Hultman numbers. Journal of Integer Sequences 10, 6 (June 2007), 13. Article 07.6.2.
[2] Labarre, A. New bounds and tractable instances for the transposition distance. IEEE/ACM Transactions on Computational Biology and Bioinformatics 3, 4 (Oct. 2006), 380–394.
[1] Labarre, A. A new tight upper bound on the transposition distance. In Proceedings of the Fifth Workshop on Algorithms in Bioinformatics (WABI) (Mallorca, Spain, Oct. 2005), R. Casadio and G. Myers, Eds., vol. 3692 of Lecture Notes in Bioinformatics, Springer-Verlag, pp. 216–227.

This file was generated by bibtex2html 1.99.

[1] Labarre, A. Combinatorial aspects of genome rearrangements and haplotype networks. PhD thesis, Université Libre de Bruxelles, Brussels, Belgium, Sept. 2008.
[ pdf | Publisher's page ]
[2] Labarre, A. Distance des transpositions. Master's thesis, Université Libre de Bruxelles, Brussels, Belgium, June 2005.
[ pdf | Errata ]
[3] Labarre, A. Réarrangement de génomes, tri par inversions et distances entre permutations. Master's thesis, Université Libre de Bruxelles, Brussels, Belgium, June 2004.
[ pdf | Errata ]
[17] Labarre, A. Sorting genomes by prefix double-cut-and-joins, Mar. 2023. Pattern Avoidance, Statistical Mechanics and Computational Complexity.
[16] Labarre, A. Decomposing subcubic graphs into claws, paths or triangles, Oct. 2021. Séminaire de l'équipe QuaResMi.
[15] Labarre, A. Sorting by prefix block-interchanges, Dec. 2020. International Symposium on Algorithms and Computation (ISAAC).
[14] Labarre, A. The clever shopper problem, June 2018. The 13th International Computer Science Symposium in Russia.
[13] Labarre, A. Decomposing cubic graphs into connected subgraphs of size three, Aug. 2016. International Computing and Combinatorics Conference (COCOON).
[12] Labarre, A. Sorting with forbidden intermediates, Feb. 2016. Pattern Avoidance and Genome Sorting Workshop at Dagstuhl.
[11] Labarre, A. Solving the tree containment problem for genetically stable networks in quadratic time, Oct. 2015. International Workshop on Combinatorial Algorithms (IWOCA).
[10] Labarre, A. Permutations in comparative genomics, Feb. 2012. Workshop on Algorithms and Permutations, Paris, France (invited talk).
[9] Labarre, A. Distributions de cycles et distances entre génomes, Jan. 2012. Séminaire Algo du Laboratoire d'informatique Gaspard-Monge, Marne-la-Vallée, France.
[8] Labarre, A. Cycle distributions and genomic (dis)similarity, Mar. 2011. Spring Workshop on Mining and Learning (SML), Prüm, Germany.
[7] Labarre, A. Edit distances and factorisations of even permutations, Sept. 2008. Sixteenth European Symposium on Algorithms (ESA), Karlsruhe, Germany.
[6] Labarre, A. Distances d'édition et factorisations de permutations paires, Mar. 2008. Invited talk at the Séminaire de bioinformatique de l'équipe SEQUOIA, Lille, France.
[5] Labarre, A. Minimum common supergraphs and haplotype networks, Dec. 2007. Future Directions in Phylogenetic Methods and Models (PLGW03), Cambridge, United Kingdom.
[4] Labarre, A. Exploiting the disjoint cycle decomposition in genome rearrangements, Feb. 2007. Ordinal and Symbolic Data Analysis (OSDA), Gent, Belgium.
[3] Labarre, A. Graphs, permutations and sets in genome rearrangements, Feb. 2006. Computers in Scientific Discovery III (CSD3), Gent, Belgium.
[2] Labarre, A. Nouveaux résultats sur le tri par transpositions, Jan. 2006. Alignement et Phylogénie (ALPHY/GTGC), Lyon, France.
[1] Labarre, A. A new tight upper bound on the transposition distance, Oct. 2005. Fifth Workshop on Algorithms in Bioinformatics (WABI), Palma de Mallorca, Spain.

This file was generated by bibtex2html 1.99.

Posters

Slides for other people

  1. Géométrie de Paix: slides made for a talk given by Brussels, Belgium, June 3, 2005