Refreshing results…
On the maximum number of cubic subwords in a word
Download from doi.orgA note on efficient computation of all Abelian periods in a string
Download from hal-upec-upem.archives-ouvertes.frA Linear Time Algorithm for Seeds Computation
Download from epubs.siam.orgOn the Maximal Sum of Exponents of Runs in a String
Download from doi.orgEfficient Seeds Computation Revisited
Download from arxiv.orgAlgorithms for Three Versions of the Shortest Common Superstring Problem
Download from hal-upec-upem.archives-ouvertes.frNew Simple Efficient Algorithms Computing Powers and Runs in Strings
Download from hal-upec-upem.archives-ouvertes.frExtracting powers and periods in a string from its runs structure
Download from hal-upec-upem.archives-ouvertes.frFinding Patterns In Given Intervals.
Download from www.researchgate.netOn the Maximal Number of Cubic Runs in a String.
Download from hal-upec-upem.archives-ouvertes.frImproved Induced Matchings in Sparse Graphs
Download from doi.orgMissing publications? Search for publications with a matching author name.