1. Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844–856 (1995)
2. Alon, N., Dao, P., Hajirasouliha, I., Hormozdiari, F., Sahinalp, S.C.: Biomolecular network motif counting and discovery by color coding. Bioinformatics 24(13), 241–249 (2008)
3. Arvind, V., Raman, V.: Approximation algorithms for some parameterized counting problems, ISAAC 2002, LNCS, vol. 2518, pp. 453–464. Springer, Berlin (2002)
4. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Narrow sieves for parameterized paths and packings.
arXiv:1007.1161
(2010)
5. Björklund, A., Kaski, P., Kowalik, L.: Probably optimal graph motifs. In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), LIPIcs, vol. 20, pp. 20–31, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2013)