A separation between RLSLPs and LZ77

Asymmetric k-center with minimum coverage

scholarly article by Inge Li Gørtz published February 2008 in Information Processing Letters

Capacitated Vehicle Routing with Non-uniform Speeds

Capacitated Vehicle Routing with Nonuniform Speeds

Compact q-Gram Profiling of Compressed Strings

Compact q-gram profiling of compressed strings

Compressed Communication Complexity of Longest Common Prefixes

article by Philip Bille et al published 2018 in Lecture Notes in Computer Science

Compressed Data Structures for Range Searching

Compressed Subsequence Matching and Packed Tree Coloring

Compressed Subsequence Matching and Packed Tree Coloring

Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation

Fast Arc-Annotated Subsequence Matching in Linear Space

Fast Arc-Annotated Subsequence Matching in Linear Space

Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs

Finger Search in Grammar-Compressed Strings

Fingerprints in Compressed Strings

Fingerprints in compressed strings

Immersive Algorithms

scholarly article published 2017

Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts

Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts

Locating Depots for Capacitated Vehicle Routing

Locating depots for capacitated vehicle routing

Longest Common Extensions in Sublinear Space

Longest Common Extensions in Trees

Longest Common Extensions via Fingerprinting

Longest common extensions in trees

Matching subsequences in trees

Minimum Makespan Multi-Vehicle Dial-a-Ride

Minimum Makespan Multi-vehicle Dial-a-Ride

Sparse Suffix Tree Construction in Small Space

Sparse Text Indexing in Small Space

Stochastic Vehicle Routing with Recourse

String Indexing for Patterns with Wildcards

Theory of Computing Systems article

String Indexing for Patterns with Wildcards

SWAT 2012 article

String Indexing for Top-k Close Consecutive Occurrences

scientific article published in January 2020

String matching with variable length gaps

Subsequence Automata with Default Transitions

Subsequence automata with default transitions

Substring Range Reporting

Substring Range Reporting

Tight Bounds for Top Tree Compression

Time-Space Trade-Offs for Longest Common Extensions

Time–space trade-offs for longest common extensions

Topics in Algorithms: Data Structures on Trees and Approximation Algorithms on Graphs ⬇️

Tree Compression with Top Trees

Tree compression with top trees

Union-Find with Constant Time Deletions