year 
with 
title and venue 
cite/pdf 
2017 

On the aperiodic avoidability of binary patterns with variables and reversals. Theoretical Computer Science, Vol. 682, pp 180189 

2017 
H. Fernau, F. Manea, M. Schmid 
Revisiting Shinohara's Algorithm for Computing Descriptive Patterns. Theoretical Computer Science, Vol. XXX, pp XXXX 

2017 
D. Nowotka 
A note on Thue games. Information Processing Letters, Vol. 118, pp 7577 

2017 
G. Badkobeh, M. Crochemore 
Counting maximalexponent factors in words. Theoretical Computer Science, Vol. 658, Part A, pp 2735 

2016 
M. Crochemore 
On the density of Lyndon roots in factors. Theoretical Computer Science, Vol. 656, Part B, pp 234240 

2016 
R. Grossi, C. Iliopoulos, N. Pisanti, S. Pissis, A. Retha, F. Vayani 
Circular Sequence Comparison: Algorithms and Applications. Algorithms for Molecular Biology, Vol. 11, a. 12 

2015 
T. Ehlers, F. Manea, D. Nowotka 
kAbelian Pattern Matching. Journal of Discrete Algorithms, Vol. 34, pp 37–48 

2014 
J. Dassow, F. Manea, M. Müller 
Inner palindromic closure. International Journal of Foundations of Computer Science, Vol. 25(8), pp 10491064 

2014 
S.Z. Fazekas, F. Manea, K. ShikishimaTsuji 
The pseudopalindromic completion of regular languages. Information and Computation, Vol. 239, pp 222236 

2014 
F. Manea, C. Tiseanu 
An Algorithmic Toolbox for Periodic Partial Words. Discrete Applied Mathematics, Vol. 179, pp 174192 

2014 
A. Saarela 
5Abelian Cubes Are Avoidable on Binary Alphabets. RAIRO  Theoretical Informatics and Applications, Vol. 48 (4), pp 467478 

2014 
P. Ochem, A. Samsonov, A. Shur 
Binary patterns in binary cubefree words: avoidability and growth. RAIRO  Theoretical Informatics and Applications, Vol. 48 (4), pp 369389 

2014 
J. Dassow, F. Manea 
Regular Languages of Partial Words. Information Sciences, Vol. 268, pp 290304 

2013 
S.Z. Fazekas 
A note on the decidability of subword inequalities. International Journal of Foundations of Computer Science, Vol. 24, pp 445452 

2012 
F. Manea, V. Mitrana 
Hairpin Lengthening and Shortening of Regular Languages. Languages Alive, LNCS 7300, pp 145159 

2012 
F. BlanchetSadri, A. Rashin, E. Willett 
Periodicity algorithms and a conjecture on overlaps in partial words. Theoretical Computer Science, Vol. 443, pp 3545 

2012 
F. BlanchetSadri 
The threesquares lemma for partial words with one hole. Theoretical Computer Science, Vol. 428, pp 19 

2012 
F. BlanchetSadri, J. Kim, W. Severa, S. Simmons, D. Xu 
Avoiding abelian squares in partial words. Journal of Combinatorial Theory, Series A, Vol. 119, Issue 1, pp 357270 

2011 
F. BlanchetSadri, I. Choi 
Avoiding large squares in partial words. Theoretical Computer Science, Vol. 412, Issue 29, pp 37523758 

2011 
E. Allen, F. BlanchetSadri, C. Byrum, M. Cucuringu 
Counting Bordered Partial Words by Critical Positions. The electronic journal of combinatorics, Vol. 18, pp 138 

2011 
F. BlanchetSadri, S. Simmons, E. Weissenstein 
Avoidable binary patterns in partial words. Acta Informatica, Vol. 48, Issue 1, pp 3541 

2010 
C. Choffrut 
Contextual partial commutations. Discrete Mathematics and Theoretical Computer Science, Vol. 12, Issue 4, pp 5972 

2009 
F. BlanchetSadri, G. Scott 
Counting distinct squares in partial words. Acta Cybernetica, Vol. 19, Issues 2, pp 465477 

2009 
F. BlanchetSadri 
A note on the number of squares in a partial word with one hole. RAIRO  Theoretical Informatics and Applications, Vol. 43, Issue 4, pp 767774 

2009 
F. BlanchetSadri, G. Scott 
A generalization of Thue freeness for partial words. Theoretical Computer Science, Vol. 410, Issues 810, pp 793800 

2008 
F. BlanchetSadri, C.D. Davis, J. Dodge, M. Moorefield 
Unbordered Partial Words. Discrete Applied Mathematics, Vol. 157, Issue 5, pp 890900 

2007 
F. Manea 
Freeness of partial words. Theoretical Computer Science, Vol. 389, Issue 12, pp 265277 
