default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMireille Bousquet-Mélou
Person information
- affiliation: Bordeaux University, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j47]Mireille Bousquet-Mélou, Michael Wallner
:
Walks avoiding a quadrant and the reflection principle. Eur. J. Comb. 119: 103803 (2024)- 2020
- [j46]Mireille Bousquet-Mélou, Andrew Elvey Price:
The generating function of planar Eulerian orientations. J. Comb. Theory A 172: 105183 (2020) - [c2]Mireille Bousquet-Mélou, Michael Wallner:
More Models of Walks Avoiding a Quadrant. AofA 2020: 8:1-8:14
2010 – 2019
- 2017
- [j45]Nicolas Bonichon, Mireille Bousquet-Mélou, Paul Dorbec, Claire Pennarun:
On the number of planar Eulerian orientations. Eur. J. Comb. 65: 59-91 (2017) - 2016
- [j44]Mireille Bousquet-Mélou, Robert Sedgewick, Michèle Soria:
Introduction for S.I. AofA14. Algorithmica 75(4): 577-578 (2016) - [j43]Mireille Bousquet-Mélou:
Square lattice walks avoiding a quadrant. J. Comb. Theory A 144: 37-79 (2016) - 2015
- [j42]Michael H. Albert, Mireille Bousquet-Mélou:
Permutations sortable by two stacks in parallel and quarter plane walks. Eur. J. Comb. 43: 131-164 (2015) - [j41]Mireille Bousquet-Mélou, Julien Courtiel:
Spanning forests in regular planar maps. J. Comb. Theory A 135: 1-59 (2015) - [j40]Mireille Bousquet-Mélou, Markus Lohrey, Sebastian Maneth, Eric Nöth:
XML Compression via Directed Acyclic Graphs. Theory Comput. Syst. 57(4): 1322-1371 (2015) - 2014
- [j39]Mireille Bousquet-Mélou:
On the Importance Sampling of Self-Avoiding Walks. Comb. Probab. Comput. 23(5): 725-748 (2014) - [j38]Mireille Bousquet-Mélou, Kerstin Weller:
Asymptotic Properties of Some Minor-Closed Classes of Graphs. Comb. Probab. Comput. 23(5): 749-795 (2014) - 2013
- [j37]Andrei Asinowski, Gill Barequet, Mireille Bousquet-Mélou, Toufik Mansour, Ron Y. Pinter:
Orders Induced by Segments in Floorplans and (2 - 14 - 3, 3 - 41 - 2)-Avoiding Permutations. Electron. J. Comb. 20(2): 35 (2013) - [i2]Mireille Bousquet-Mélou, Markus Lohrey, Sebastian Maneth, Eric Noeth:
XML Compression via DAGs. CoRR abs/1309.5927 (2013) - 2012
- [j36]Mireille Bousquet-Mélou, Guillaume Chapuy:
The Vertical Profile of Embedded Trees. Electron. J. Comb. 19(3): 46 (2012) - 2011
- [j35]Mireille Bousquet-Mélou, Éric Fusy, Louis-François Préville-Ratelle:
The Number of Intervals in the m-Tamari Lattices. Electron. J. Comb. 18(2) (2011) - [j34]Olivier Bernardi, Mireille Bousquet-Mélou:
Counting colored planar maps: Algebraicity results. J. Comb. Theory B 101(5): 315-377 (2011) - [j33]Axel Bacher, Mireille Bousquet-Mélou:
Weakly directed self-avoiding walks. J. Comb. Theory A 118(8): 2365-2391 (2011) - 2010
- [j32]Mireille Bousquet-Mélou:
The expected number of inversions after n adjacent transpositions. Discret. Math. Theor. Comput. Sci. 12(2): 65-88 (2010) - [j31]Mireille Bousquet-Mélou:
Families of prudent self-avoiding walks. J. Comb. Theory A 117(3): 313-344 (2010) - [j30]Mireille Bousquet-Mélou, Anders Claesson, Mark Dukes, Sergey Kitaev:
(2+2)-free posets, ascent sequences and pattern avoiding permutations. J. Comb. Theory A 117(7): 884-909 (2010)
2000 – 2009
- 2009
- [j29]Mireille Bousquet-Mélou, James Propp, Julian West:
Perfect Matchings for the Three-Term Gale-Robinson Sequences. Electron. J. Comb. 16(1) (2009) - 2008
- [j28]Mireille Bousquet-Mélou, Yann Ponty:
Culminating Paths. Discret. Math. Theor. Comput. Sci. 10(2) (2008) - [j27]Mireille Bousquet-Mélou:
Counting coloured planar maps. Electron. Notes Discret. Math. 31: 57-62 (2008) - [j26]Nicolas Bonichon, Mireille Bousquet-Mélou, Éric Fusy:
Baxter permutations and plane bipolar orientations. Electron. Notes Discret. Math. 31: 69-74 (2008) - 2006
- [j25]Mireille Bousquet-Mélou, Arnaud Jehanne:
Polynomial equations with one catalytic variable, algebraic series and map enumeration. J. Comb. Theory B 96(5): 623-672 (2006) - [j24]Mireille Bousquet-Mélou:
Limit laws for embedded trees: Applications to the integrated superBrownian excursion. Random Struct. Algorithms 29(4): 475-523 (2006) - 2005
- [c1]Mireille Bousquet-Mélou:
Algebraic Generating Functions in Enumerative Combinatorics and Context-Free Languages. STACS 2005: 18-35 - 2004
- [i1]Cyril Banderier, Philippe Flajolet, Danièle Gardy, Mireille Bousquet-Mélou, Alain Denise, Dominique Gouyou-Beauchamps:
Generating functions for generating trees. CoRR math.CO/0411250 (2004) - 2003
- [j23]Mireille Bousquet-Mélou, Andrew Rechnitzer:
The site-perimeter of bargraphs. Adv. Appl. Math. 31(1): 86-112 (2003) - [j22]Mireille Bousquet-Mélou, Marko Petkovsek:
Walks confined in a quadrant are not always D-finite. Theor. Comput. Sci. 307(2): 257-276 (2003) - 2002
- [j21]Mireille Bousquet-Mélou:
Four Classes of Pattern-Avoiding Permutations Under One Roof: Generating Trees with Two Labels. Electron. J. Comb. 9(2) (2002) - [j20]Cyril Banderier, Mireille Bousquet-Mélou, Alain Denise, Philippe Flajolet, Danièle Gardy, Dominique Gouyou-Beauchamps:
Generating functions for generating trees. Discret. Math. 246(1-3): 29-55 (2002) - [j19]Mireille Bousquet-Mélou, Andrew Rechnitzer:
Lattice animals and heaps of dimers. Discret. Math. 258(1-3): 235-274 (2002) - 2001
- [j18]Mireille Bousquet-Mélou:
Walks on the Slit Plane: Other Approaches. Adv. Appl. Math. 27(Issues): 243-288 (2001) - [j17]Guy Melançon, I. Dutour, Mireille Bousquet-Mélou:
Random Generation of Directed Acyclic Graphs. Electron. Notes Discret. Math. 10: 202-207 (2001) - 2000
- [j16]Mireille Bousquet-Mélou, Gilles Schaeffer:
Enumeration of Planar Constellations. Adv. Appl. Math. 24(4): 337-368 (2000) - [j15]Mireille Bousquet-Mélou:
Sorted and/or sortable permutations. Discret. Math. 225(1-3): 25-50 (2000) - [j14]Mireille Bousquet-Mélou, Marko Petkovsek:
Linear recurrences with constant coefficients: the multivariate case. Discret. Math. 225(1-3): 51-75 (2000)
1990 – 1999
- 1999
- [j13]Mireille Bousquet-Mélou, Kimmo Eriksson:
A Refinement of the Lecture Hall Theorem. J. Comb. Theory A 86(1): 63-84 (1999) - 1998
- [j12]Mireille Bousquet-Mélou:
Multi-statistic enumeration of two-stack sortable permutations. Electron. J. Comb. 5 (1998) - [j11]Mireille Bousquet-Mélou:
New enumerative results on two-dimensional directed animals. Discret. Math. 180(1-3): 73-106 (1998) - 1996
- [j10]Mireille Bousquet-Mélou:
A method for the enumeration of various classes of column-convex polygons. Discret. Math. 154(1-3): 1-25 (1996) - [j9]Mireille Bousquet-Mélou:
Percolation Models and Animals. Eur. J. Comb. 17(4): 343-369 (1996) - 1995
- [j8]Mireille Bousquet-Mélou, Jean-Marc Fedou:
The generating function of convex polyominoes: The resolution of a q-differential system. Discret. Math. 137(1-3): 53-75 (1995) - [j7]Mireille Bousquet-Mélou, Laurent Habsieger:
Sur les matrices à signes alternants. Discret. Math. 139(1-3): 57-72 (1995) - 1994
- [j6]Mireille Bousquet-Mélou:
Codage des polyominos convexes et équations pour l'énumération suivant l'aire. Discret. Appl. Math. 48(1): 21-43 (1994) - [j5]Jean-Paul Allouche, Mireille Bousquet-Mélou:
Canonical Positions for the Factors in Paperfolding Sequences. Theor. Comput. Sci. 129(2): 263-278 (1994) - 1993
- [j4]Mireille Bousquet-Mélou:
q-Énumération de Polyominos Convexes. J. Comb. Theory A 64(2): 265-288 (1993) - 1992
- [j3]Mireille Bousquet-Mélou:
The Number of Minimal Word Chains Computing the Thue-Morse Word. Inf. Process. Lett. 44(2): 57-64 (1992) - [j2]Mireille Bousquet-Mélou:
Une bijection entre les polyominos convexes dirigés et les mots de Dyck bilatères. RAIRO Theor. Informatics Appl. 26: 205-219 (1992) - [j1]Mireille Bousquet-Mélou, Xavier Gérard Viennot:
Empilements de segments et q-énumération de polyominos convexes dirigés. J. Comb. Theory A 60(2): 196-224 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
