Showing 1–20 of 58 results
/ Date/ Name
Dec 15, 2005Matching Subsequences in TreesJan 3, 2019Mergeable Dictionaries With ShiftsSep 15, 2006Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed TextsAug 31, 2006The Tree Inclusion Problem: In Linear Space and FasterJun 21, 2022The Complexity of the Co-Occurrence ProblemDec 8, 2010Capacitated Vehicle Routing with Non-Uniform SpeedsFeb 6, 2019Top Tree Compression of TriesMar 4, 2011Locating Depots for Capacitated Vehicle RoutingNov 20, 2017A Separation Between Run-Length SLPs and LZ77Feb 26, 2012Stochastic Vehicle Routing with RecourseJan 14, 2026How many users have been here for a long time? Efficient solutions for counting long aggregated visitsJul 4, 2012Sparse Suffix Tree Construction with Small SpaceAug 24, 2022Hierarchical Relative Lempel-Ziv CompressionAug 19, 2021The Fine-Grained Complexity of Episode MatchingJul 10, 2019Sparse Regular Expression MatchingApr 9, 2018From Regular Expression Matching to ParsingApr 29, 2015Dynamic Relative Compression, Dynamic Partial Sums, and Substring ConcatenationApr 21, 2013Tree Compression with Top TreesJun 8, 2018Compressed Communication Complexity of Longest Common PrefixesNov 8, 2019Space Efficient Construction of Lyndon Arrays in Linear Time