Mireille Bousquet-Mélou

Affiliations:
  • Bordeaux University, France


According to our database1, Mireille Bousquet-Mélou authored at least 49 papers between 1992 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
The generating function of planar Eulerian orientations.
J. Comb. Theory, Ser. A, 2020

More Models of Walks Avoiding a Quadrant.
Proceedings of the 31st International Conference on Probabilistic, 2020

2017
On the number of planar Eulerian orientations.
Eur. J. Comb., 2017

2016
Square lattice walks avoiding a quadrant.
J. Comb. Theory, Ser. A, 2016

Introduction for S.I. AofA14.
Algorithmica, 2016

2015
XML Compression via Directed Acyclic Graphs.
Theory Comput. Syst., 2015

Spanning forests in regular planar maps.
J. Comb. Theory, Ser. A, 2015

Permutations sortable by two stacks in parallel and quarter plane walks.
Eur. J. Comb., 2015

2014
Asymptotic Properties of Some Minor-Closed Classes of Graphs.
Comb. Probab. Comput., 2014

On the Importance Sampling of Self-Avoiding Walks.
Comb. Probab. Comput., 2014

2013
XML Compression via DAGs.
CoRR, 2013

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

2012
The Vertical Profile of Embedded Trees.
Electron. J. Comb., 2012

2011
Counting colored planar maps: Algebraicity results.
J. Comb. Theory, Ser. B, 2011

Weakly directed self-avoiding walks.
J. Comb. Theory, Ser. A, 2011

The Number of Intervals in the <i>m</i>-Tamari Lattices.
Electron. J. Comb., 2011

2010
(2+2)-free posets, ascent sequences and pattern avoiding permutations.
J. Comb. Theory, Ser. A, 2010

Families of prudent self-avoiding walks.
J. Comb. Theory, Ser. A, 2010

The expected number of inversions after n adjacent transpositions.
Discret. Math. Theor. Comput. Sci., 2010

2009
Perfect Matchings for the Three-Term Gale-Robinson Sequences.
Electron. J. Comb., 2009

2008
Counting coloured planar maps.
Electron. Notes Discret. Math., 2008

Baxter permutations and plane bipolar orientations.
Electron. Notes Discret. Math., 2008

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

2006
Limit laws for embedded trees: Applications to the integrated superBrownian excursion.
Random Struct. Algorithms, 2006

Polynomial equations with one catalytic variable, algebraic series and map enumeration.
J. Comb. Theory, Ser. B, 2006

2005
Algebraic Generating Functions in Enumerative Combinatorics and Context-Free Languages.
Proceedings of the STACS 2005, 2005

2003
Walks confined in a quadrant are not always D-finite.
Theor. Comput. Sci., 2003

The site-perimeter of bargraphs.
Adv. Appl. Math., 2003

2002
Lattice animals and heaps of dimers.
Discret. Math., 2002

Generating functions for generating trees.
Discret. Math., 2002

Four Classes of Pattern-Avoiding Permutations Under One Roof: Generating Trees with Two Labels.
Electron. J. Comb., 2002

2001
Random Generation of Directed Acyclic Graphs.
Electron. Notes Discret. Math., 2001

Walks on the Slit Plane: Other Approaches.
Adv. Appl. Math., 2001

2000
Linear recurrences with constant coefficients: the multivariate case.
Discret. Math., 2000

Sorted and/or sortable permutations.
Discret. Math., 2000

Enumeration of Planar Constellations.
Adv. Appl. Math., 2000

1999
A Refinement of the Lecture Hall Theorem.
J. Comb. Theory, Ser. A, 1999

1998
New enumerative results on two-dimensional directed animals.
Discret. Math., 1998

Multi-statistic enumeration of two-stack sortable permutations.
Electron. J. Comb., 1998

1996
Percolation Models and Animals.
Eur. J. Comb., 1996

A method for the enumeration of various classes of column-convex polygons.
Discret. Math., 1996

1995
Sur les matrices à signes alternants.
Discret. Math., 1995

The generating function of convex polyominoes: The resolution of a q-differential system.
Discret. Math., 1995

1994
Canonical Positions for the Factors in Paperfolding Sequences.
Theor. Comput. Sci., 1994

Codage des polyominos convexes et équations pour l'énumération suivant l'aire.
Discret. Appl. Math., 1994

1993
q-Énumération de Polyominos Convexes.
J. Comb. Theory, Ser. A, 1993

1992
Empilements de segments et q-énumération de polyominos convexes dirigés.
J. Comb. Theory, Ser. A, 1992

Une bijection entre les polyominos convexes dirigés et les mots de Dyck bilatères.
RAIRO Theor. Informatics Appl., 1992

The Number of Minimal Word Chains Computing the Thue-Morse Word.
Inf. Process. Lett., 1992


  Loading...