| c-trie++: A dynamic trie tailored for fast prefix searches | 0 | 0.34 | 2022 |
| Palindromic trees for a sliding window and its applications | 0 | 0.34 | 2022 |
| Computing Minimal Unique Substrings for a Sliding Window | 0 | 0.34 | 2022 |
| Combinatorics of minimal absent words for a sliding window | 0 | 0.34 | 2022 |
| Parameterized DAWGs: Efficient constructions and bidirectional pattern searches | 0 | 0.34 | 2022 |
| Factorizing Strings into Repetitions | 0 | 0.34 | 2022 |
| Longest Common Rollercoasters. | 0 | 0.34 | 2021 |
| Efficiently Computing Runs On A Trie | 0 | 0.34 | 2021 |
| Computing Longest Palindromic Substring After Single-Character Or Block-Wise Edits | 1 | 0.37 | 2021 |
| Space-efficient algorithms for computing minimal/shortest unique substrings. | 0 | 0.34 | 2020 |
| c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches | 0 | 0.34 | 2020 |
| Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings | 0 | 0.34 | 2020 |
| An Improved Data Structure for Left-Right Maximal Generic Words Problem. | 0 | 0.34 | 2019 |
| Compact Data Structures for Shortest Unique Substring Queries. | 0 | 0.34 | 2019 |
| The Parameterized Position Heap of a Trie. | 0 | 0.34 | 2019 |
| Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets. | 0 | 0.34 | 2019 |
| On Longest Common Property Preserved Substring Queries. | 0 | 0.34 | 2019 |
| On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations. | 0 | 0.34 | 2019 |
| Computing Maximal Palindromes and Distinct Palindromes in a Trie. | 0 | 0.34 | 2019 |
| On the size of the smallest alphabet for Lyndon trees | 0 | 0.34 | 2019 |
| Faster queries for longest substring palindrome after block edit. | 0 | 0.34 | 2019 |
| Computing runs on a trie. | 0 | 0.34 | 2019 |
| Dynamic Packed Compact Tries Revisited. | 0 | 0.34 | 2019 |
| Faster Online Elastic Degenerate String Matching. | 0 | 0.34 | 2018 |
| Lyndon Factorization of Grammar Compressed Texts Revisited. | 0 | 0.34 | 2018 |
| Computing longest common square subsequences. | 0 | 0.34 | 2018 |
| Right-to-left online construction of parameterized position heaps. | 0 | 0.34 | 2018 |
| Longest substring palindrome after edit. | 0 | 0.34 | 2018 |
| O(n log n)-time text compression by LZ-style longest first substitution. | 0 | 0.34 | 2018 |
| Algorithms and combinatorial properties on shortest unique palindromic substrings. | 0 | 0.34 | 2018 |
| Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays. | 0 | 0.34 | 2018 |
| Longest Lyndon Substring After Edit. | 0 | 0.34 | 2018 |
| Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings. | 0 | 0.34 | 2017 |
| Small-Space LCE Data Structure with Constant-Time Queries. | 1 | 0.37 | 2017 |
| On Reverse Engineering the Lyndon Tree. | 2 | 0.38 | 2017 |
| A Guidance System for Wide-area Complex Disaster Evacuation based on Ant Colony Optimization. | 1 | 0.40 | 2016 |
| Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text. | 2 | 0.37 | 2013 |
| Behavioral analysis based on relations in weblogs | 0 | 0.34 | 2006 |
| Users' Behavioral Analysis on Weblogs. | 2 | 0.40 | 2006 |
| Analysis of user's relation and reading activity in weblogs | 0 | 0.34 | 2005 |
