The following pages link to Mireille Bousquet-Mélou (Q232252):
Displaying 50 items.
- XML compression via directed acyclic graphs (Q269349) (← links)
- An elementary solution of Gessel's walks in the quadrant (Q323719) (← links)
- The vertical profile of embedded trees (Q456391) (← links)
- Permutations sortable by two stacks in parallel and quarter plane walks (Q458593) (← links)
- Spanning forests in regular planar maps (Q491963) (← links)
- On 3-dimensional lattice walks confined to the positive octant (Q505688) (← links)
- Counting permutations with no long monotone subsequence via generating trees and the kernel method (Q536566) (← links)
- Walks in the quarter plane: Kreweras' algebraic model (Q558684) (← links)
- Baxter permutations and plane bipolar orientations (Q624807) (← links)
- Weakly directed self-avoiding walks (Q640847) (← links)
- The number of intervals in the \(m\)-Tamari lattices (Q665767) (← links)
- Square lattice walks avoiding a quadrant (Q739386) (← links)
- On partitions avoiding 3-crossings (Q817945) (← links)
- The density of the ISE and local limit laws for embedded trees (Q862221) (← links)
- On the independence complex of square grids (Q930427) (← links)
- Families of prudent self-avoiding walks (Q965213) (← links)
- (2+2)-free posets, ascent sequences and pattern avoiding permutations (Q986124) (← links)
- Lecture hall partitions. II (Q1127609) (← links)
- Lecture hall partitions (Q1127631) (← links)
- Empilements de segments et \(q\)-énumération de polyominos convexes dirigés. (Heaps of segments and \(q\)-enumeration of directed convex polyominoes) (Q1193571) (← links)
- The number of minimal word chains computing the Thue-Morse word (Q1201862) (← links)
- A refinement of the lecture hall theorem (Q1284469) (← links)
- Enumeration of three-dimensional convex polygons (Q1293442) (← links)
- (Q1306596) (redirect page) (← links)
- Inversion relations, reciprocity and polyominoes (Q1306597) (← links)
- Coding the convex polyominoes and equations for the enumeration according to the area (Q1314326) (← links)
- \(q\)-enumeration of convex polyominoes (Q1318368) (← links)
- Factors of generalized Rudin-Shapiro sequences (Q1326949) (← links)
- Canonical positions for the factors in paperfolding sequences (Q1329729) (← links)
- The generating function of convex polyominoes: The resolution of a \(q\)- differential system (Q1343776) (← links)
- Generating functions for generating trees (Q1348138) (← links)
- New enumerative results on two-dimensional directed animals (Q1381815) (← links)
- Multi-static enumeration of two-stack sortable permutations (Q1383515) (← links)
- The site-perimeter of bargraphs (Q1408282) (← links)
- Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels (Q1422120) (← links)
- Enumeration of planar constellations (Q1578973) (← links)
- Sorted and/or sortable permutations (Q1591137) (← links)
- Linear recurrences with constant coefficients: The multivariate case (Q1591138) (← links)
- Length enumeration of fully commutative elements in finite and affine Coxeter groups (Q1786472) (← links)
- Lattice animals and heaps of dimers (Q1850063) (← links)
- Walks on the slit plane (Q1864418) (← links)
- Walks confined in a quadrant are not always D-finite (Q1885016) (← links)
- Alternating sign matrices (Q1893978) (← links)
- Percolation models and animals (Q1916056) (← links)
- A method for the enumeration of various classes of column-convex polygons (Q1918535) (← links)
- Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations (Q1953524) (← links)
- Counting walks with large steps in an orthant (Q2039575) (← links)
- Counting colored planar maps: algebraicity results (Q2275895) (← links)
- The generating function of planar Eulerian orientations (Q2299632) (← links)
- Eulerian orientations and the six-vertex model on planar maps (Q2306542) (← links)
