Konstantin Skodinis The Complexity of the K<sub>n, n</sub>-Problem for Node Replacement Graph Languages. 95-112 2001 168 Inf. Comput. 2 db/journals/iandc/iandc168.html#Skodinis01