- F. Blanchet-Sadri, Bob Chen, Aleksandar Chakarov, “Number of holes in unavoidable sets of partial words I”, Journal of Discrete Algorithms, 14, 2012, 55
- Francine Blanchet-Sadri, Bob Chen, Aleksandar Chakarov, 6460, Combinatorial Algorithms, 2011, 43
- Sergey Avgustinovich, Sergey Kitaev, “On uniquely k-determined permutations”, Discrete Mathematics, 308, № 9, 2008, 1500
- Brandon Blakeley, F. Blanchet-Sadri, Josh Gunter, Narad Rampersad, “On the complexity of deciding avoidability of sets of partial words”, Theoretical Computer Science, 411, № 49, 2010, 4263
- Hongyu Zheng, Guillaume Marçais, Carl Kingsford, “Creating and Using Minimizer Sketches in Computational Genomics”, Journal of Computational Biology, 30, № 12, 2023, 1251
- Amy Glen, Bjarni V. Halldórsson, Sergey Kitaev, 5583, Developments in Language Theory, 2009, 264
- Yunseo Choi, “Counting crucial permutations with respect to monotone patterns”, Discrete Mathematics, 347, № 4, 2024, 113861
- Alexander Burstein, Sergey Kitaev, “On Unavoidable Sets of Word Patterns”, SIAM J. Discrete Math., 19, № 2, 2005, 371
- Peter M. Higgins, Christopher J. Saker, “Unavoidable sets”, Theoretical Computer Science, 359, № 1-3, 2006, 231
- F. Blanchet-Sadri, Daniel Seita, David Wise, “Computing abelian complexity of binary uniform morphic words”, Theoretical Computer Science, 640, 2016, 41