On the Critical Exponent of Generalized Thue-Morse Words. - Alexandre Blondin Massé; Srecko Brlek; Amy Glen; Sébastien Labbé 001 (Discret. Math. Theor. Comput. Sci., 2007)

Reconstructing words from a fixed palindromic length sequence. - Alexandre Blondin Massé; Srecko Brlek; Andrea Frosini; Sébastien Labbé 001; Simone Rinaldi (IFIP TCS, 2008)

Christoffel and Fibonacci Tiles. - Alexandre Blondin Massé; Srecko Brlek; Ariane Garon; Sébastien Labbé 001 (DGCI, 2009)

Codings of rotations on two intervals are full. - Alexandre Blondin Massé; Srecko Brlek; Sébastien Labbé 001; Laurent Vuillon (Electron. Notes Discret. Math., 2009)

An Arithmetic and Combinatorial Approach to Three-Dimensional Discrete Lines. - Valérie Berthé; Sébastien Labbé 001 (DGCI, 2011)

Uniformly balanced words with linear complexity and prescribed letter frequencies - Valérie Berthé; Sébastien Labbé 001 (WORDS, 2011)

Equations on palindromes and circular words. - Alexandre Blondin Massé; Srecko Brlek; Ariane Garon; Sébastien Labbé 001 (Theor. Comput. Sci., 2011)

Two infinite families of polyominoes that tile the plane by translation in two distinct ways. - Alexandre Blondin Massé; Srecko Brlek; Ariane Garon; Sébastien Labbé 001 (Theor. Comput. Sci., 2011)

Palindromic complexity of codings of rotations. - Alexandre Blondin Massé; Srecko Brlek; Sébastien Labbé 001; Laurent Vuillon (Theor. Comput. Sci., 2011)

A parallelogram tile fills the plane by translation in at most two distinct ways. - Alexandre Blondin Massé; Srecko Brlek; Sébastien Labbé 001 (Discret. Appl. Math., 2012)

Convergence and Factor Complexity for the Arnoux-Rauzy-Poincaré Algorithm. - Valérie Berthé; Sébastien Labbé 001 (WORDS, 2013)

Combinatorial properties of double square tiles. - Alexandre Blondin Massé; Ariane Garon; Sébastien Labbé 001 (Theor. Comput. Sci., 2013)

A Counterexample to a Question of Hof, Knill and Simon. - Sébastien Labbé 001 (Electron. J. Comb., 2014)

Factor Complexity of S-adic sequences generated by the Arnoux-Rauzy-Poincaré Algorithm. - Valérie Berthé; Sébastien Labbé 001 (CoRR, 2014)

Factor complexity of S-adic words generated by the Arnoux-Rauzy-Poincaré algorithm. - Valérie Berthé; Sébastien Labbé 001 (Adv. Appl. Math., 2015)

3-dimensional Continued Fraction Algorithms Cheat Sheets. - Sébastien Labbé 001 (CoRR, 2015)

A d-dimensional Extension of Christoffel Words. - Sébastien Labbé 001; Christophe Reutenauer (Discret. Comput. Geom., 2015)

Bispecial Factors in the Brun S-Adic System. - Sébastien Labbé 001; Julien Leroy 002 (DLT, 2016)

Palindromic sequences generated from marked morphisms. - Sébastien Labbé 001; Edita Pelantová (Eur. J. Comb., 2016)

A Set of Sequences of Complexity 2n+1 2 n + 1. - Julien Cassaigne; Sébastien Labbé 001; Julien Leroy 002 (WORDS, 2017)

A Permutation on Words in a Two Letter Alphabet. - Niccolò Castronuovo; Robert Cori; Sébastien Labbé 001 (WORDS, 2017)

On the Zero Defect Conjecture. - Sébastien Labbé 001; Edita Pelantová; Stepán Starosta (Eur. J. Comb., 2017)

A Numeration System for Fibonacci-Like Wang Shifts. - Sébastien Labbé 001; Jana Lepsová (WORDS, 2021)

Substitutive Structure of Jeandel-Rao Aperiodic Tilings. - Sébastien Labbé 001 (Discret. Comput. Geom., 2021)

A characterization of Sturmian sequences by indistinguishable asymptotic pairs. - Sebastián Barbieri; Sébastien Labbé 001; Stepán Starosta (Eur. J. Comb., 2021)

The $q$-analog of the Markoff injectivity conjecture over the language of a balanced sequence. - Sébastien Labbé 001; Mélodie Lapointe (Comb. Theory, 2022)

A Fibonacci's complement numeration system. - Sébastien Labbé 001; Jana Lepsová (CoRR, 2022)

A Fibonacci analogue of the two's complement numeration system. - Sébastien Labbé 001; Jana Lepsová (RAIRO Theor. Informatics Appl., 2023)

Decomposition of Rational Discrete Planes. - Tristan Roussillon; Sébastien Labbé 001 (DGMM, 2024)

A Succinct Study of Positionality for Dumont-Thomas Numeration Systems. - Savinien Kreczman; Sébastien Labbé 001; Manon Stipulanti (WORDS, 2025)

Analytical Integral Global Optimization. - Sébastien Labbé 001; Andrea Del Prete (L4DC, 2025)

Positionality of Dumont-Thomas numeration systems for integers. - Savinien Kreczman; Sébastien Labbé 001; Manon Stipulanti (CoRR, 2025)