1. Algorithmic Combinatorics on Partial Words, Discrete Mathematics and Its Applications;Blanchet-Sadri,2008
2. XPath containment in the presence of disjunction, DTDs, and variables;Neven,2003
3. On the complexity of XPath containment in the presence of disjunction, DTDs, and variables;Neven;Log. Methods Comput. Sci.,2006
4. The (almost) complete guide to tree pattern containment;Czerwiński,2015
5. Testing avoidability on sets of partial words is hard;Blanchet-Sadri;Theor. Comput. Sci.,2009