The Number of Minimal Word Chains Computing the Thue-Morse Word. - Mireille Bousquet-Mélou (Inf. Process. Lett., 1992)

Une bijection entre les polyominos convexes dirigés et les mots de Dyck bilatères. - Mireille Bousquet-Mélou (RAIRO Theor. Informatics Appl., 1992)

Empilements de segments et q-énumération de polyominos convexes dirigés. - Mireille Bousquet-Mélou; Xavier Gérard Viennot (J. Comb. Theory A, 1992)

q-Énumération de Polyominos Convexes. - Mireille Bousquet-Mélou (J. Comb. Theory A, 1993)

Codage des polyominos convexes et équations pour l'énumération suivant l'aire. - Mireille Bousquet-Mélou (Discret. Appl. Math., 1994)

Canonical Positions for the Factors in Paperfolding Sequences. - Jean-Paul Allouche; Mireille Bousquet-Mélou (Theor. Comput. Sci., 1994)

The generating function of convex polyominoes: The resolution of a q-differential system. - Mireille Bousquet-Mélou; Jean-Marc Fedou (Discret. Math., 1995)

Sur les matrices à signes alternants. - Mireille Bousquet-Mélou; Laurent Habsieger (Discret. Math., 1995)

A method for the enumeration of various classes of column-convex polygons. - Mireille Bousquet-Mélou (Discret. Math., 1996)

Percolation Models and Animals. - Mireille Bousquet-Mélou (Eur. J. Comb., 1996)

Multi-statistic enumeration of two-stack sortable permutations. - Mireille Bousquet-Mélou (Electron. J. Comb., 1998)

New enumerative results on two-dimensional directed animals. - Mireille Bousquet-Mélou (Discret. Math., 1998)

A Refinement of the Lecture Hall Theorem. - Mireille Bousquet-Mélou; Kimmo Eriksson (J. Comb. Theory A, 1999)

Enumeration of Planar Constellations. - Mireille Bousquet-Mélou; Gilles Schaeffer (Adv. Appl. Math., 2000)

Sorted and/or sortable permutations. - Mireille Bousquet-Mélou (Discret. Math., 2000)

Linear recurrences with constant coefficients: the multivariate case. - Mireille Bousquet-Mélou; Marko Petkovsek (Discret. Math., 2000)

Walks on the Slit Plane: Other Approaches. - Mireille Bousquet-Mélou (Adv. Appl. Math., 2001)

Random Generation of Directed Acyclic Graphs. - Guy Melançon; I. Dutour; Mireille Bousquet-Mélou (Electron. Notes Discret. Math., 2001)

Four Classes of Pattern-Avoiding Permutations Under One Roof: Generating Trees with Two Labels. - Mireille Bousquet-Mélou (Electron. J. Comb., 2002)

Generating functions for generating trees. - Cyril Banderier; Mireille Bousquet-Mélou; Alain Denise; Philippe Flajolet; Danièle Gardy; Dominique Gouyou-Beauchamps (Discret. Math., 2002)

Lattice animals and heaps of dimers. - Mireille Bousquet-Mélou; Andrew Rechnitzer (Discret. Math., 2002)

The site-perimeter of bargraphs. - Mireille Bousquet-Mélou; Andrew Rechnitzer (Adv. Appl. Math., 2003)

Walks confined in a quadrant are not always D-finite. - Mireille Bousquet-Mélou; Marko Petkovsek (Theor. Comput. Sci., 2003)

Algebraic Generating Functions in Enumerative Combinatorics and Context-Free Languages. - Mireille Bousquet-Mélou (STACS, 2005)

Polynomial equations with one catalytic variable, algebraic series and map enumeration. - Mireille Bousquet-Mélou; Arnaud Jehanne (J. Comb. Theory B, 2006)

Limit laws for embedded trees: Applications to the integrated superBrownian excursion. - Mireille Bousquet-Mélou (Random Struct. Algorithms, 2006)

Culminating Paths. - Mireille Bousquet-Mélou; Yann Ponty (Discret. Math. Theor. Comput. Sci., 2008)

Baxter permutations and plane bipolar orientations. - Nicolas Bonichon; Mireille Bousquet-Mélou; Éric Fusy (Electron. Notes Discret. Math., 2008)

Counting coloured planar maps. - Mireille Bousquet-Mélou (Electron. Notes Discret. Math., 2008)

Perfect Matchings for the Three-Term Gale-Robinson Sequences. - Mireille Bousquet-Mélou; James Propp; Julian West (Electron. J. Comb., 2009)

The expected number of inversions after n adjacent transpositions. - Mireille Bousquet-Mélou (Discret. Math. Theor. Comput. Sci., 2010)

Families of prudent self-avoiding walks. - Mireille Bousquet-Mélou (J. Comb. Theory A, 2010)

(2+2)-free posets, ascent sequences and pattern avoiding permutations. - Mireille Bousquet-Mélou; Anders Claesson; Mark Dukes; Sergey Kitaev (J. Comb. Theory A, 2010)

The Number of Intervals in the m-Tamari Lattices. - Mireille Bousquet-Mélou; Éric Fusy; Louis-François Préville-Ratelle (Electron. J. Comb., 2011)

Weakly directed self-avoiding walks. - Axel Bacher; Mireille Bousquet-Mélou (J. Comb. Theory A, 2011)

Counting colored planar maps: Algebraicity results. - Olivier Bernardi; Mireille Bousquet-Mélou (J. Comb. Theory B, 2011)

The Vertical Profile of Embedded Trees. - Mireille Bousquet-Mélou; Guillaume Chapuy (Electron. J. Comb., 2012)

Orders Induced by Segments in Floorplans and (2 - 14 - 3, 3 - 41 - 2)-Avoiding Permutations. - Andrei Asinowski; Gill Barequet; Mireille Bousquet-Mélou; Toufik Mansour; Ron Y. Pinter (Electron. J. Comb., 2013)

XML Compression via DAGs. - Mireille Bousquet-Mélou; Markus Lohrey; Sebastian Maneth; Eric Noeth (CoRR, 2013)

On the Importance Sampling of Self-Avoiding Walks. - Mireille Bousquet-Mélou (Comb. Probab. Comput., 2014)

Asymptotic Properties of Some Minor-Closed Classes of Graphs. - Mireille Bousquet-Mélou; Kerstin Weller (Comb. Probab. Comput., 2014)

Permutations sortable by two stacks in parallel and quarter plane walks. - Michael H. Albert; Mireille Bousquet-Mélou (Eur. J. Comb., 2015)

Spanning forests in regular planar maps. - Mireille Bousquet-Mélou; Julien Courtiel (J. Comb. Theory A, 2015)

XML Compression via Directed Acyclic Graphs. - Mireille Bousquet-Mélou; Markus Lohrey; Sebastian Maneth; Eric Nöth (Theory Comput. Syst., 2015)

Introduction for S.I. AofA14. - Mireille Bousquet-Mélou; Robert Sedgewick; Michèle Soria (Algorithmica, 2016)

Square lattice walks avoiding a quadrant. - Mireille Bousquet-Mélou (J. Comb. Theory A, 2016)

On the number of planar Eulerian orientations. - Nicolas Bonichon; Mireille Bousquet-Mélou; Paul Dorbec; Claire Pennarun (Eur. J. Comb., 2017)

More Models of Walks Avoiding a Quadrant. - Mireille Bousquet-Mélou; Michael Wallner 001 (AofA, 2020)

The generating function of planar Eulerian orientations. - Mireille Bousquet-Mélou; Andrew Elvey Price (J. Comb. Theory A, 2020)

Counting quadrant walks via Tutte's invariant method. - Olivier Bernardi; Mireille Bousquet-Mélou; Kilian Raschel (Comb. Theory, 2021)

Intervals in the greedy Tamari posets. - Mireille Bousquet-Mélou; Frédéric Chapoton (Comb. Theory, 2024)

Walks avoiding a quadrant and the reflection principle. - Mireille Bousquet-Mélou; Michael Wallner 001 (Eur. J. Comb., 2024)

The Ascent Lattice on Dyck Paths. - Jean-Luc Baril; Mireille Bousquet-Mélou; Sergey Kirgizov; Mehdi Naima (Electron. J. Comb., 2025)