A. J. Kfoury A Linear-Time Algorithm to Decide Whether A Binary Word Contains An Overlap. [Citation Graph (0, 0)][DBLP] ITA, 1988, v:22, n:2, pp:135-145 [Journal]
Pierre Charrier, Jean Roman Étude De La Séparation Et De L'Élimination Sur Une Famille De Graphes Quotients Déduite D'Une Méthode De Dissections Emboîtées. [Citation Graph (0, 0)][DBLP] ITA, 1988, v:22, n:2, pp:245-265 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP