Mireille Bousquet-Mélou

Mireille Bousquet-Mélou's AcademicInfluence.com Rankings

Mathematics

#6025

World Rank

#8413

Historical Rank

Combinatorics

#88

World Rank

#95

Historical Rank

Measure Theory

#3593

World Rank

#4237

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Mireille Bousquet-Mélou Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Mireille Bousquet-Mélou is a French mathematician who specializes in enumerative combinatorics and who works as a senior researcher for the Centre national de la recherche scientifique at the computer science department of the University of Bordeaux.

(See a Problem?)

Mireille Bousquet-Mélou's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Exactly Solved Models (2009) (329)
Generating functions for generating trees (2002) (266)
A method for the enumeration of various classes of column-convex polygons (1996) (211)
Linear recurrences with constant coefficients: the multivariate case (2000) (171)
Enumeration of Planar Constellations (2000) (160)
(2+2)-free Posets, Ascent Sequences and Pattern Avoiding Permutations (2008) (159)
Polynomial equations with one catalytic variable, algebraic series and map enumeration (2005) (125)
Four Classes of Pattern-Avoiding Permutations Under One Roof: Generating Trees with Two Labels (2003) (103)
Walks confined in a quadrant are not always D-finite (2002) (80)
Lattice animals and heaps of dimers (2002) (75)
New enumerative results on two-dimensional directed animals (1998) (69)
Baxter permutations and plane bipolar orientations (2008) (66)
On the independence complex of square grids (2006) (66)
The degree distribution in bipartite planar maps: applications to the Ising model (2002) (65)
The Number of Intervals in the m-Tamari Lattices (2011) (64)
Forest-Like Permutations (2006) (64)
Counting Walks in the Quarter Plane (2017) (60)
Lecture Hall Partitions (1997) (56)
Random Generation of Directed Acyclic Graphs (2001) (53)
Lecture Hall Partitions II (1997) (53)
On 3-Dimensional Lattice Walks Confined to the Positive Octant (2014) (51)
Counting colored planar maps: Algebraicity results (2009) (50)
The site-perimeter of bargraphs (2003) (47)
Stacking of segments and q -enumeration of convex directed polyominoes (1992) (47)
Sorted and/or sortable permutations (2000) (46)
Multi-statistic enumeration of two-stack sortable permutations (1998) (45)
Planar maps and algebraic series: polynomial equations with one catalytic variable (2004) (44)
Families of prudent self-avoiding walks (2008) (42)
Walks on the slit plane (2000) (40)
Enumeration of three-dimensional convex polygons (1997) (37)
Limit laws for embedded trees: Applications to the integrated superBrownian excursion (2005) (35)
The generating function of convex polyominoes: The resolution of a q-differential system (1995) (33)
The Critical Fugacity for Surface Adsorption of Self-Avoiding Walks on the Honeycomb Lattice is $${1+\sqrt{2}}$$1+2 (2011) (33)
Decreasing Subsequences in Permutations and Wilf Equivalence for Involutions (2004) (30)
Random generation of dags for graph drawing (2000) (28)
A Refinement of the Lecture Hall Theorem (1999) (28)
Square lattice walks avoiding a quadrant (2015) (26)
XML Compression via Directed Acyclic Graphs (2015) (26)
Perfect Matchings for the Three-Term Gale-Robinson Sequences (2009) (24)
Percolation Models and Animals (1996) (24)
Bijection of convex polyominoes and equations for enumerating them according to area (1994) (23)
Walks on the Slit Plane: Other Approaches (2001) (23)
Convex polyominoes and heaps of segments (1992) (22)
Canonical Positions for the Factors in Paperfolding Sequences (1994) (22)
Counting planar maps, coloured or uncoloured (2011) (22)
Standard paths in the composition poset (1995) (20)
Counting Coloured Planar Maps: Differential Equations (2015) (20)
The Critical Fugacity for Surface Adsorption of Self-Avoiding Walks on the Honeycomb Lattice is 1+2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemarg (2014) (19)
q -enumeration of convex polyominoes (1993) (19)
XML compression via DAGs (2013) (18)
Algebraic Generating Functions in Enumerative Combinatorics and Context-Free Languages (2005) (18)
Convex polyominoes and algebraic languages (1992) (18)
Culminating Paths (2007) (17)
Permutations sortable by two stacks in parallel and quarter plane walks (2013) (17)
Orders Induced by Segments in Floorplans and (2 - 14 - 3, 3 - 41 - 2)-Avoiding Permutations (2013) (17)
Inversion relations, reciprocity and polyominoes (1999) (16)
Counting permutations with no long monotone subsequence via generating trees and the kernel method (2010) (16)
Spanning forests in regular planar maps (2013) (14)
Asymptotic Properties of Some Minor-Closed Classes of Graphs (2013) (13)
On matrices with alternating signs (1995) (13)
On the number of planar Eulerian orientations (2016) (11)
On the conjectures of Rauzy and Shallit for infinite words (1995) (11)
Weakly directed self-avoiding walks (2010) (10)
The expected number of inversions after n adjacent transpositions (2009) (8)
On the Importance Sampling of Self-Avoiding Walks (2011) (8)
THREE-DIMENSIONAL SELF-AVOIDING CONVEX POLYGONS (1997) (5)
Proceedings of the 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (2014) (5)
More Models of Walks Avoiding a Quadrant (2020) (5)
Counting coloured planar maps (2008) (3)
The Vertical Profile of Embedded Trees (2012) (3)
Enumeration of directed animals on an infinite family of lattices (1996) (2)
Counting paths on the slit plane (2000) (2)
Sorting with two stacks in parallel (2013) (1)
Lattice walks at the Interface of Algebra, Analysis and Combinatorics (2018) (1)
The Number of Minimal Word Chains Computing the Thue-Morse Word (1992) (1)
Spanning forests in regular planar maps (conference version) (2016) (1)
Prudent self-avoiding walks (2008) (0)
Explorer XML Compression via Directed Acyclic Graphs (2014) (0)
ec 2 00 0 Walks on the slit plane (2008) (0)
Combinatorics and physics : dedicated to the memory of Claude Itzykson (1997) (0)
Workshop: Enumerative Combinatorics Table of Contents (2014) (0)
1 5 Se p 20 05 Self-avoiding walks crossing a square (2008) (0)
Counting Coloured Planar Maps: Differential Equations (2017) (0)
Introduction for S.I. AofA14 (2016) (0)
Introduction for S.I. AofA14 (2016) (0)
Animals, Domino Tilings, Functional Equations (2003) (0)
Ju n 20 05 Self-avoiding walks crossing a square (2008) (0)
On 3-Dimensional Lattice Walks Confined to the Positive Octant (2016) (0)
Dedication Claude Itzykson (1938-1995) (1997) (0)
A pr 2 00 1 Walks on the slit plane : other approaches (2001) (0)
ON THE INDEPENDENCE COMPLEX OF SQUARE GRIDS MIREILLE BOUSQUET-MÉLOU, SVANTE LINUSSON, AND ERAN NEVO (2008) (0)
Lattice paths and random walks (2013) (0)
CRM – SSC Prize Recipient (2016) (0)
More models of walks avoiding a quadrant (extended abstract) (2021) (0)
Enumerative Combinatorics (2019) (0)
Random Generation of Dags for Graph Drawing Random Generation of Dags for Graph Drawing (2000) (0)
XML Compression via Directed Acyclic Graphs (2014) (0)

This paper list is powered by the following services:

Other Resources About Mireille Bousquet-Mélou

en.wikipedia.org

Mireille Bousquet-Mélou's Academic­Influence.com Rankings

Why Is Mireille Bousquet-Mélou Influential?

Mireille Bousquet-Mélou's Published Works

Published Works

Other Resources About Mireille Bousquet-Mélou

Mireille Bousquet-Mélou's AcademicInfluence.com Rankings