39 citations · 241 across the 54 of their papers we have counts for
7 papers · 2 filters
Fast Algorithm for Partial Covers in Words
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter +2
A factor of a word is a cover of if every position in lies within some occurrence of in . A word covered by thus generalizes the idea of a repetition…
A Note on the Longest Common Compatible Prefix Problem for Partial Words
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka +6
For a partial word the longest common compatible prefix of two positions , denoted , is the largest such that , where $\uparr…
Internal Pattern Matching Queries in a Text and Applications
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter +1
We consider several types of internal queries, that is, questions about fragments of a given text specified in constant space by their locations in . Our main result is an o…
Substring Suffix Selection
Maxim Babenko, Paweł Gawrychowski, Tomasz Kociumaka +1
We study the following substring suffix selection problem: given a substring of a string T of length n, compute its k-th lexicographically smallest suffix. This a natural generaliz…
Fast branching algorithm for Cluster Vertex Deletion
Anudhyan Boral, Marek Cygan, Tomasz Kociumaka +1
In the family of clustering problems, we are given a set of objects (vertices of the graph), together with some observed pairwise similarities (edges). The goal is to identify clus…
Faster deterministic Feedback Vertex Set
Tomasz Kociumaka, Marcin Pilipczuk
We present two new deterministic algorithms for the Feedback Vertex Set problem parameterized by the solution size. We begin with a simple algorithm, which runs in O*((2 + ϕ)^k) ti…
Order-Preserving Suffix Trees and Their Algorithmic Applications
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka +6
Recently Kubica et al. (Inf. Process. Let., 2013) and Kim et al. (submitted to Theor. Comp. Sci.) introduced order-preserving pattern matching. In this problem we are looking for c…