A subscription is required to access this article.
Enumerative Combinatorics focusses on the exact and asymptotic counting of combinatorial objects. It is strongly connected to the probabilistic analysis of large combinatorial structures and has fruitful connections to several disciplines, including statistical physics, algebraic combinatorics, graph theory and computer science. This workshop brought together experts from all these various fields, including also computer algebra, with the goal of promoting cooperation and interaction among researchers with largely varying backgrounds.
Cite this article
Mireille Bousquet-Mélou, Michael Drmota, Christian Krattenthaler, Marc Noy, Enumerative Combinatorics. Oberwolfach Rep. 11 (2014), no. 1, pp. 635–720DOI 10.4171/OWR/2014/12