A. M. Ambalath, R. Balasundaram, R. Chintan, V. Koppula, N. Misra et al., On the Kernelization Complexity of Colorful Motifs, IPEC 2010, pp.14-25, 2010.
DOI : 10.1093/acprof:oso/9780198566076.001.0001

P. Alimonti and V. Kann, Some APX-completeness results for cubic graphs, Theoretical Computer Science, vol.237, issue.1-2, pp.123-134, 2000.
DOI : 10.1016/S0304-3975(98)00158-3

N. Alon, R. Yuster, and U. Zwick, Color-coding, Journal of the ACM, vol.42, issue.4, pp.844-856, 1995.
DOI : 10.1145/210332.210337

N. Betzler, M. R. Fellows, C. Komusiewicz, and R. Niedermeier, Parameterized Algorithms and Hardness Results for Some Graph Motif Problems, CPM 2008, pp.31-43, 2008.
DOI : 10.1007/978-3-540-69068-9_6

S. Bruckner, F. Hüffner, R. M. Karp, R. Sharan, and R. Shamir, Topology-Free Querying of Protein Interaction Networks, RECOMB 2009, pp.74-89, 2009.

M. Cesati, Compendium of parameterized problems

R. Dondi, G. Fertin, and S. Vialette, WEAK PATTERN MATCHING IN COLORED GRAPHS: MINIMIZING THE NUMBER OF CONNECTED COMPONENTS, Theoretical Computer Science, pp.27-38, 2007.
DOI : 10.1142/9789812770998_0007
URL : https://hal.archives-ouvertes.fr/hal-00417910

R. Dondi, G. Fertin, and S. Vialette, Maximum Motif Problem in Vertex-Colored Graphs, CPM 2009, pp.221-235, 2009.
DOI : 10.1073/pnas.0409522102
URL : https://hal.archives-ouvertes.fr/hal-00416463

M. Fellows, G. Fertin, D. Hermelin, and S. Vialette, Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs, ICALP 2007, pp.340-351, 2007.
DOI : 10.1007/978-3-540-73420-8_31
URL : https://hal.archives-ouvertes.fr/hal-00417928

S. Guillemot and F. Sikora, Finding and Counting Vertex-Colored Subtrees, MFCS 2010, pp.405-416, 2010.
DOI : 10.1007/s00453-011-9600-8
URL : https://hal.archives-ouvertes.fr/hal-00455134

B. P. Kelley, R. Sharan, R. M. Karp, T. Sittler, D. E. Root et al., Conserved pathways within bacteria and yeast as revealed by global protein network alignment, Proc. Nat. Acad. Sci, pp.100-11394, 2003.
DOI : 10.1073/pnas.1534710100

M. Koyutürk, A. Grama, and W. Szpankowski, Pairwise Local Alignment of Protein Interaction Networks Guided by Models of Evolution, RECOMB 2005, pp.48-65, 2005.
DOI : 10.1007/11415770_4

V. Lacroix, C. G. Fernandes, and M. F. Sagot, Motif Search in Graphs: Application to Metabolic Networks, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.3, issue.4, pp.360-368, 2006.
DOI : 10.1109/TCBB.2006.55
URL : https://hal.archives-ouvertes.fr/hal-00427984

R. Niedermeier, Invitation to Fixed-Parameter Algorithms, 2006.
DOI : 10.1093/acprof:oso/9780198566076.001.0001

A. Paz and S. Moran, Non deterministic polynomial optimization problems and their approximations, Theoretical Computer Science, vol.15, issue.3, pp.251-277, 1981.
DOI : 10.1016/0304-3975(81)90081-5
URL : http://doi.org/10.1016/0304-3975(81)90081-5

J. Scott, T. Ideker, R. M. Karp, and R. Sharan, Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks, Journal of Computational Biology, vol.13, issue.2, pp.133-144, 2006.
DOI : 10.1089/cmb.2006.13.133

R. Sharan, T. Ideker, B. Kelley, R. Shamir, and R. M. Karp, Identification of Protein Complexes by Comparative Analysis of Yeast and Bacterial Protein Interaction Data, pp.282-289, 2004.

R. Sharan, S. Suthram, R. Kelley, T. Kuhn, S. Mccuine et al., Conserved patterns of protein interaction in multiple species, Proceedings of the National Academy of Sciences, vol.102, issue.6, pp.1974-1979, 2005.
DOI : 10.1073/pnas.0409522102