Mireille Bousquet-Mélou

Orcid: 0000-0002-2863-8300

Affiliations:

Bordeaux University, France

According to our database¹, Mireille Bousquet-Mélou authored at least 52 papers between 1992 and 2024.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

Walks avoiding a quadrant and the reflection principle.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Michael Wallner

Eur. J. Comb., 2024

Intervals in the greedy Tamari posets.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Frédéric Chapoton

Comb. Theory, 2024

2021

Counting quadrant walks via Tutte's invariant method.

[BibT_eX]

[DOI]

Olivier Bernardi

Mireille Bousquet-Mélou

Kilian Raschel

Comb. Theory, 2021

2020

The generating function of planar Eulerian orientations.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Andrew Elvey Price

J. Comb. Theory A, 2020

More Models of Walks Avoiding a Quadrant.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Michael Wallner

Proceedings of the 31st International Conference on Probabilistic, 2020

2017

On the number of planar Eulerian orientations.

[BibT_eX]

[DOI]

Nicolas Bonichon

Mireille Bousquet-Mélou

Paul Dorbec

Claire Pennarun

Eur. J. Comb., 2017

2016

Square lattice walks avoiding a quadrant.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

J. Comb. Theory A, 2016

Introduction for S.I. AofA14.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Robert Sedgewick

Michèle Soria

Algorithmica, 2016

2015

XML Compression via Directed Acyclic Graphs.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Markus Lohrey

Sebastian Maneth

Eric Nöth

Theory Comput. Syst., 2015

Spanning forests in regular planar maps.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Julien Courtiel

J. Comb. Theory A, 2015

Permutations sortable by two stacks in parallel and quarter plane walks.

[BibT_eX]

[DOI]

Michael H. Albert

Mireille Bousquet-Mélou

Eur. J. Comb., 2015

2014

Asymptotic Properties of Some Minor-Closed Classes of Graphs.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Kerstin Weller

Comb. Probab. Comput., 2014

On the Importance Sampling of Self-Avoiding Walks.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Comb. Probab. Comput., 2014

2013

XML Compression via DAGs.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Markus Lohrey

Sebastian Maneth

Eric Noeth

CoRR, 2013

Orders Induced by Segments in Floorplans and (2 - 14 - 3, 3 - 41 - 2)-Avoiding Permutations.

[BibT_eX]

[DOI]

Andrei Asinowski

Gill Barequet

Mireille Bousquet-Mélou

Toufik Mansour

Ron Y. Pinter

Electron. J. Comb., 2013

2012

The Vertical Profile of Embedded Trees.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Guillaume Chapuy

Electron. J. Comb., 2012

2011

Counting colored planar maps: Algebraicity results.

[BibT_eX]

[DOI]

Olivier Bernardi

Mireille Bousquet-Mélou

J. Comb. Theory B, 2011

Weakly directed self-avoiding walks.

[BibT_eX]

[DOI]

Axel Bacher

Mireille Bousquet-Mélou

J. Comb. Theory A, 2011

The Number of Intervals in the <i>m</i>-Tamari Lattices.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Éric Fusy

Louis-François Préville-Ratelle

Electron. J. Comb., 2011

2010

(2+2)-free posets, ascent sequences and pattern avoiding permutations.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Anders Claesson

Mark Dukes

Sergey Kitaev

J. Comb. Theory A, 2010

Families of prudent self-avoiding walks.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

J. Comb. Theory A, 2010

The expected number of inversions after n adjacent transpositions.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Discret. Math. Theor. Comput. Sci., 2010

2009

Perfect Matchings for the Three-Term Gale-Robinson Sequences.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

James Propp

Julian West

Electron. J. Comb., 2009

2008

Counting coloured planar maps.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Electron. Notes Discret. Math., 2008

Baxter permutations and plane bipolar orientations.

[BibT_eX]

[DOI]

Nicolas Bonichon

Mireille Bousquet-Mélou

Éric Fusy

Electron. Notes Discret. Math., 2008

Culminating Paths.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Yann Ponty

Discret. Math. Theor. Comput. Sci., 2008

2006

Limit laws for embedded trees: Applications to the integrated superBrownian excursion.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Random Struct. Algorithms, 2006

Polynomial equations with one catalytic variable, algebraic series and map enumeration.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Arnaud Jehanne

J. Comb. Theory B, 2006

2005

Algebraic Generating Functions in Enumerative Combinatorics and Context-Free Languages.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Proceedings of the STACS 2005, 2005

2003

Walks confined in a quadrant are not always D-finite.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Marko Petkovsek

Theor. Comput. Sci., 2003

The site-perimeter of bargraphs.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Andrew Rechnitzer

Adv. Appl. Math., 2003

2002

Lattice animals and heaps of dimers.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Andrew Rechnitzer

Discret. Math., 2002

Generating functions for generating trees.

[BibT_eX]

[DOI]

Cyril Banderier

Mireille Bousquet-Mélou

Alain Denise

Philippe Flajolet

Danièle Gardy

Dominique Gouyou-Beauchamps

Discret. Math., 2002

Four Classes of Pattern-Avoiding Permutations Under One Roof: Generating Trees with Two Labels.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Electron. J. Comb., 2002

2001

Random Generation of Directed Acyclic Graphs.

[BibT_eX]

[DOI]

Guy Melançon

I. Dutour

Mireille Bousquet-Mélou

Electron. Notes Discret. Math., 2001

Walks on the Slit Plane: Other Approaches.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Adv. Appl. Math., 2001

2000

Linear recurrences with constant coefficients: the multivariate case.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Marko Petkovsek

Discret. Math., 2000

Sorted and/or sortable permutations.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Discret. Math., 2000

Enumeration of Planar Constellations.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Gilles Schaeffer

Adv. Appl. Math., 2000

1999

A Refinement of the Lecture Hall Theorem.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Kimmo Eriksson

J. Comb. Theory A, 1999

1998

New enumerative results on two-dimensional directed animals.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Discret. Math., 1998

Multi-statistic enumeration of two-stack sortable permutations.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Electron. J. Comb., 1998

1996

Percolation Models and Animals.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Eur. J. Comb., 1996

A method for the enumeration of various classes of column-convex polygons.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Discret. Math., 1996

1995

Sur les matrices à signes alternants.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Laurent Habsieger

Discret. Math., 1995

The generating function of convex polyominoes: The resolution of a q-differential system.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Jean-Marc Fedou

Discret. Math., 1995

1994

Canonical Positions for the Factors in Paperfolding Sequences.

[BibT_eX]

[DOI]

Jean-Paul Allouche

Mireille Bousquet-Mélou

Theor. Comput. Sci., 1994

Codage des polyominos convexes et équations pour l'énumération suivant l'aire.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Discret. Appl. Math., 1994

1993

q-Énumération de Polyominos Convexes.

[BibT_eX]

Mireille Bousquet-Mélou

J. Comb. Theory A, 1993

1992

Empilements de segments et q-énumération de polyominos convexes dirigés.

[BibT_eX]

Mireille Bousquet-Mélou

Xavier Gérard Viennot

J. Comb. Theory A, 1992

Une bijection entre les polyominos convexes dirigés et les mots de Dyck bilatères.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

RAIRO Theor. Informatics Appl., 1992

The Number of Minimal Word Chains Computing the Thue-Morse Word.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Inf. Process. Lett., 1992

Mireille Bousquet-Mélou

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...