Tomasz Walen

ORCID

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 65

Top Venues

Publications

Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
Approximate Circular Pattern Matching under Edit Distance. CoRR (2024)
Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
Approximate Circular Pattern Matching Under Edit Distance. STACS (2024)
Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String. CPM (2023)
Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen
Tight Bound for the Number of Distinct Palindromes in a Tree. Electron. J. Comb. 30 (2) (2023)
Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
Subsequence Covers of Words. SPIRE (2022)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Solon P. Pissis, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
Approximate Circular Pattern Matching. ESA (2022)
Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Rectangular Tile Covers of 2D-Strings. CPM (2022)
Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Linear-Time Computation of Shortest Covers of All Rotations of a String. CPM (2022)
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Efficient representation and counting of antipower factors in words. Inf. Comput. 286 (2022)
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
A periodicity lemma for partial words. Inf. Comput. 283 (2022)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Solon P. Pissis, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
Approximate Circular Pattern Matching. CoRR (2022)
Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
Computing Covers of 2D-Strings. CPM (2021)
Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
String Covers of a Tree. SPIRE (2021)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Internal Dictionary Matching. Algorithmica 83 (7) (2021)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
mismatches. J. Comput. Syst. Sci. 115 (2021)
Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Shortest covers of all cyclic shifts of a string. Theor. Comput. Sci. 866 (2021)
Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Hardness of Detecting Abelian and Additive Square Factors in Strings. ESA (2021)
Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Hardness of Detecting Abelian and Additive Square Factors in Strings. CoRR (2021)
Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
The Number of Repetitions in 2D-Strings. CoRR (2020)
Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Internal Quasiperiod Queries. SPIRE (2020)
Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Internal Quasiperiod Queries. CoRR (2020)
Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen
String periods in the order-preserving model. Inf. Comput. 270 (2020)
Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Tomasz Walen, Wiktor Zuba
Unary Words Have the Smallest Levenshtein k-Neighbourhoods. CPM (2020)
Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Shortest Covers of All Cyclic Shifts of a String. WALCOM (2020)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Counting Distinct Patterns in Internal Dictionary Matching. CPM (2020)
Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
The Number of Repetitions in 2D-Strings. ESA (2020)
Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
A Linear-Time Algorithm for Seeds Computation. ACM Trans. Algorithms 16 (2) (2020)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
Efficient Enumeration of Distinct Factors Using Package Representations. SPIRE (2020)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Counting Distinct Patterns in Internal Dictionary Matching. CoRR (2020)
Pawel Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Universal reconstruction of a string. Theor. Comput. Sci. 812 (2020)
Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen
Tight Bound for the Number of Distinct Palindromes in a Tree. CoRR (2020)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Weighted Shortest Common Supersequence Problem Revisited. SPIRE (2019)
Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Quasi-Linear-Time Algorithm for Longest Common Circular Factor. CoRR (2019)
Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Quasi-Linear-Time Algorithm for Longest Common Circular Factor. CPM (2019)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Circular Pattern Matching with k Mismatches. CoRR (2019)
Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Efficient enumeration of non-equivalent squares in partial words with few holes. J. Comb. Optim. 37 (2) (2019)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Internal Dictionary Matching. CoRR (2019)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Internal Dictionary Matching. ISAAC (2019)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Circular Pattern Matching with k Mismatches. FCT (2019)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Weighted Shortest Common Supersequence Problem Revisited. CoRR (2019)
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Efficient Representation and Counting of Antipower Factors in Words. LATA (2019)
Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
How Much Different Are Two Words with Different Shortest Periods. AIAI (Workshops) (2018)
Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen
String Periods in the Order-Preserving Model. CoRR (2018)
Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen
String Periods in the Order-Preserving Model. STACS (2018)
Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
On the string consensus problem and the Manhattan sequence consensus problem. Theor. Comput. Sci. 710 (2018)
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Faster Recovery of Approximate Periods over Edit Distance. CoRR (2018)
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Efficient Representation and Counting of Antipower Factors in Words. CoRR (2018)
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
On Periodicity Lemma for Partial Words. CoRR (2018)
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Faster Recovery of Approximate Periods over Edit Distance. SPIRE (2018)
Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Linear-Time Algorithm for Long LCF with k Mismatches. CoRR (2018)
Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Linear-Time Algorithm for Long LCF with k Mismatches. CPM (2018)
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
On Periodicity Lemma for Partial Words. LATA (2018)
Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Efficient algorithms for shortest partial seeds in words. Theor. Comput. Sci. 710 (2018)
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
String Powers in Trees. Algorithmica 79 (3) (2017)
Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes. COCOON (2017)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Covering problems for partial words and for indeterminate strings. Theor. Comput. Sci. 698 (2017)
Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
On the greedy algorithm for the Shortest Common Superstring problem with reversals. Inf. Process. Lett. 116 (3) (2016)
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Maximum number of distinct and nonequivalent nonstandard squares in a word. Theor. Comput. Sci. 648 (2016)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Order-preserving indexing. Theor. Comput. Sci. 638 (2016)
Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen
Faster Longest Common Extension Queries in Strings over General Alphabets. CPM (2016)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. SPIRE (2016)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. CoRR (2016)
Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen
Faster Longest Common Extension Queries in Strings over General Alphabets. CoRR (2016)
Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Polynomial-time approximation algorithms for weighted LCS problem. Discret. Appl. Math. 204 (2016)
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word. CoRR (2016)
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
String Powers in Trees. CPM (2015)
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Linear-time version of Holub's algorithm for morphic imprimitivity testing. Theor. Comput. Sci. 602 (2015)
Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto, Tomasz Walen
Efficient Algorithms for Longest Closed Factor Array. SPIRE (2015)
Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen
Tight Bound for the Number of Distinct Palindromes in a Tree. SPIRE (2015)
Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
On the Greedy Algorithm for the Shortest Common Superstring Problem with Reversals. CoRR (2015)
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Internal Pattern Matching Queries in a Text and Applications. SODA (2015)
Pawel Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Universal Reconstruction of a String. WADS (2015)
Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Fast Algorithm for Partial Covers in Words. Algorithmica 73 (1) (2015)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
A note on the longest common compatible prefix problem for partial words. J. Discrete Algorithms 34 (2015)
Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
On the String Consensus Problem and the Manhattan Sequence Consensus Problem. CoRR (2014)
Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Efficient Algorithms for Shortest Partial Seeds in Words. CPM (2014)
Grzegorz Chojnowski, Tomasz Walen, Janusz M. Bujnicki
RNA Bricks - a database of RNA 3D motifs and their interactions. Nucleic Acids Res. 42 (Database-Issue) (2014)
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word. Developments in Language Theory (2014)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Covering Problems for Partial Words and for Indeterminate Strings. CoRR (2014)
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Extracting powers and periods in a word from its runs structure. Theor. Comput. Sci. 521 (2014)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Covering Problems for Partial Words and for Indeterminate Strings. ISAAC (2014)
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Solon P. Pissis, Tomasz Walen
Fast Algorithm for Partial Covers in Words. CoRR (2014)
Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
On the String Consensus Problem and the Manhattan Sequence Consensus Problem. SPIRE (2014)
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Krzysztof Stencel, Tomasz Walen
New simple efficient algorithms computing powers and runs in strings. Discret. Appl. Math. 163 (2014)
Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Efficient counting of square substrings in a tree. Theor. Comput. Sci. 544 (2014)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Order-Preserving Suffix Trees and Their Algorithmic Applications CoRR (2013)
Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Fast Algorithm for Partial Covers in Words. CPM (2013)
Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen
Computing the Longest Previous Factor. Eur. J. Comb. 34 (1) (2013)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen
A note on efficient computation of all Abelian periods in a string. Inf. Process. Lett. 113 (3) (2013)
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
Efficient seed computation revisited. Theor. Comput. Sci. 483 (2013)
Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
On the maximum number of cubic subwords in a word. Eur. J. Comb. 34 (1) (2013)
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing. LATA (2013)
Marcin Kubica, Tomasz Kulczynski, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
A linear time algorithm for consecutive permutation pattern matching. Inf. Process. Lett. 113 (12) (2013)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
A Note on the Longest Common Compatible Prefix Problem for Partial Words. CoRR (2013)
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Optimal Data Structure for Internal Pattern Matching Queries in a Text and Applications. CoRR (2013)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes. SPIRE (2013)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen
The Maximum Number of Squares in a Tree. CPM (2012)
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen
Efficient algorithms for three variants of the LPF table. J. Discrete Algorithms 11 (2012)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen
A Note on Efficient Computation of All Abelian Periods in a String CoRR (2012)
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
The maximal number of cubic runs in a word. J. Comput. Syst. Sci. 78 (6) (2012)

Tomasz Walen.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Tomasz Walen