TITLE: Enumerative combinatorics applications in Computer Science
QUESTION [9 upvotes]: I am interested in specific examples and applications of enumerative combinatorics in Computer Science -- concrete problems in this field that make explicit use of the concepts and ideas from combinatorics. Are there any good references that you can point me to (books, lectures, ...)?

REPLY [2 votes]: The emphasis  is on enumeration  rather than counting if  I understand
the question correctly. The  perfect match would be the combstruct
package that is  included with Maple. This software  is a companion to
the book  Analytical Combinatorics by Flajolet  and Sedgewick, which
is the canonical text and  basically provides a map of future computer
science  research for  decades to  come. Highly  recommended. Computer
science  has a  particular focus  on trees  and  combstruct really
shines  here,  providing  total  enumeration  as  well  as  generating
functions and functional equations.  The landmark paper by Flajolet et
al. on  random mapping  statistics (which are  closely related  to the
labeled    tree    function)     is    discussed    at    this    MSE
link.    The  Maple
package    is    used   the    following    MSE   combstruct    link,
I   and  this  MSE
combstruct                                                        link,
II.     The    book
Analytical Combinatorics  is unprecedented in that  it pioneered the
use  of complex variable  methods to  treat generating  functions that
arise from  species theory and  the folklore theorem  of combinatorial
enumeration (providing  instant translation from  species equations to
generating  functions),  thereby   putting  an  emphasis  on  unifying
combinatorial  methods  with  complex  variable  techniques.   Another
relevant early text is the  book Graphical Enumeration by Harary and
Palmer which contains  many results on labeled and  unlabeled trees as
well as accessible presentations  of the Polya Enumeration Theorem and
of  Power Group  Enumeration.   Finally a  classic  contender for  the
enumeration of  unlabeled trees is  the NAUTY package by  McKay, which
was          used         at          this          MSE         NAUTY
link. (Use  Pruefer
codes for labeled trees.)