C
[CMR01] Bruno Courcelle, Johann A. Makowsky, and Udi Rotics. On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discrete Applied Mathematics 108(1-2):23-52. Elsevier, February 2001. 
@article{dam108(1-2)-CMR,
  author =              {Courcelle, Bruno and Makowsky, Johann A. and Rotics,
                         Udi},
  title =               {On the fixed parameter complexity of graph
                         enumeration problems definable in monadic
                         second-order logic},
  publisher =           {Elsevier},
  journal =             {Discrete Applied Mathematics},
  volume =              {108},
  number =              {1-2},
  pages =               {23-52},
  year =                {2001},
  month =               feb,
}
List of authors