The following pages link to Tomasz Kociumaka (Q255283):
Displaying 50 items.
- A fast branching algorithm for cluster vertex deletion (Q255285) (← links)
- Computing minimal and maximal suffixes of a substring (Q294952) (← links)
- Order-preserving indexing (Q294954) (← links)
- Maximum number of distinct and nonequivalent nonstandard squares in a word (Q313973) (← links)
- Fast algorithms for abelian periods in words and greatest common divisor queries (Q340577) (← links)
- Enhanced string covering (Q393116) (← links)
- An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph (Q477619) (← links)
- A note on the longest common compatible prefix problem for partial words (Q491152) (← links)
- Fast algorithm for partial covers in words (Q493243) (← links)
- Linear-time version of Holub's algorithm for morphic imprimitivity testing (Q497670) (← links)
- Fast computation of abelian runs (Q507408) (← links)
- Efficient indexes for jumbled pattern matching with constant-sized alphabet (Q524375) (← links)
- On the greedy algorithm for the shortest common superstring problem with reversals (Q903196) (← links)
- On periodicity lemma for partial words (Q1647705) (← links)
- Covering problems for partial words and for indeterminate strings (Q1676304) (← links)
- String powers in trees (Q1679231) (← links)
- On the string consensus problem and the Manhattan sequence consensus problem (Q1698720) (← links)
- Efficient algorithms for shortest partial seeds in words (Q1698721) (← links)
- Linear search by a pair of distinct-speed robots (Q1755792) (← links)
- Near-optimal computation of runs over general alphabet via non-crossing LCE queries (Q1796824) (← links)
- A note on efficient computation of all abelian periods in a string (Q1943614) (← links)
- Pattern matching and consensus problems on weighted sequences and profiles (Q2000001) (← links)
- Faster deterministic \textsc{Feedback Vertex Set} (Q2015151) (← links)
- Internal dictionary matching (Q2037109) (← links)
- Towards a definitive measure of repetitiveness (Q2081618) (← links)
- A periodicity lemma for partial words (Q2113379) (← links)
- Efficient computation of sequence mappability (Q2134748) (← links)
- Computing longest (common) Lyndon subsequences (Q2169947) (← links)
- Efficient counting of square substrings in a tree (Q2250458) (← links)
- Dynamic dictionary matching in the online model (Q2285108) (← links)
- Indexing weighted sequences: neat and efficient (Q2288210) (← links)
- String periods in the order-preserving model (Q2288212) (← links)
- Universal reconstruction of a string (Q2297860) (← links)
- Deleting vertices to graphs of bounded genus (Q2319638) (← links)
- Longest common substring with approximately \(k\) mismatches (Q2414870) (← links)
- Correction to: ``Longest common substring with approximately \(k\) mismatches'' (Q2415358) (← links)
- Subquadratic-Time Algorithms for Abelian Stringology Problems (Q2807851) (← links)
- Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence (Q2830442) (← links)
- Linear Search by a Pair of Distinct-Speed Robots (Q2835026) (← links)
- Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet (Q2849352) (← links)
- The Maximum Number of Squares in a Tree (Q2904476) (← links)
- Sublinear Space Algorithms for the Longest Common Substring Problem (Q2921446) (← links)
- Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word (Q2921985) (← links)
- String Powers in Trees (Q2942264) (← links)
- Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries (Q2957888) (← links)
- Constant Factor Approximation for Capacitated k-Center with Outliers (Q2965488) (← links)
- String Periods in the Order-Preserving Model (Q3304137) (← links)
- Universal Reconstruction of a String (Q3449836) (← links)
- Approximating LZ77 via Small-Space Multiple-Pattern Matching (Q3452816) (← links)
- Sparse Suffix Tree Construction in Optimal Time and Space (Q4575764) (← links)