The following publications are possibly variants of this publication:
- Upper and lower bounds for finding connected motifs in vertex-colored graphsMichael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette. jcss, 77(4):799-811, 2011. [doi]
- Maximum Motif Problem in Vertex-Colored GraphsRiccardo Dondi, Guillaume Fertin, Stéphane Vialette. cpm 2009: 221-235 [doi]
- Obstructions to Within a Few Vertices or Edges of AcyclicKevin Cattell, Michael J. Dinneen, Michael R. Fellows. wads 1995: 415-427
- Parameterized Algorithmics for Finding Connected Motifs in Biological NetworksNadja Betzler, René van Bevern, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier. tcbb, 8(5):1296-1308, 2011. [doi]
- Finding Approximate and Constrained Motifs in GraphsRiccardo Dondi, Guillaume Fertin, Stéphane Vialette. cpm 2011: 388-401 [doi]
- Finding approximate and constrained motifs in graphsRiccardo Dondi, Guillaume Fertin, Stéphane Vialette. TCS, 483:10-21, 2013. [doi]