Tomasz Walen

140 papers A* 2A 7B 27C 22Misc 2Journal 78Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Internal quasiperiod queries.
Theor. Comput. Sci.
Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2025 B conf
Counting Distinct Square Substrings in Sublinear Time.
MFCS
Panagiotis Charalampopoulos, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2025 J jnl
Counting Distinct Square Substrings in Sublinear Time.
CoRR
Panagiotis Charalampopoulos, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2025 J jnl
Fast Computation of
CoRR
Yuto Nakashima, Jakub Radoszewski, Tomasz Walen
2025 A conf
Fast Computation of k-Runs, Parameterized Squares, and Other Generalised Squares.
ESA
Yuto Nakashima, Jakub Radoszewski, Tomasz Walen
2025 J jnl
Subsequence Covers of Words.
CoRR
Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2025 J jnl
Subsequence covers of words.
Theor. Comput. Sci.
Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2024 A conf
Approximate Circular Pattern Matching Under Edit Distance.
STACS
Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2024 J jnl
Approximate Circular Pattern Matching under Edit Distance.
CoRR
Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2024 C conf
Faster Algorithms for Ranking/Unranking Bordered and Unbordered Words.
SPIRE
Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2024 J jnl
Internal Pattern Matching Queries in a Text and Applications.
SIAM J. Comput.
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2023 B conf
Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String.
CPM
Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2023 J jnl
Tight Bound for the Number of Distinct Palindromes in a Tree.
Electron. J. Comb.
Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen
2022 J jnl
A periodicity lemma for partial words.
Inf. Comput.
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2022 A conf
Approximate Circular Pattern Matching.
ESA
Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Solon P. Pissis, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2022 J jnl
Approximate Circular Pattern Matching.
CoRR
Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Solon P. Pissis, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2022 J jnl
Efficient representation and counting of antipower factors in words.
Inf. Comput.
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2022 B conf
Linear-Time Computation of Shortest Covers of All Rotations of a String.
CPM
Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2022 B conf
Rectangular Tile Covers of 2D-Strings.
CPM
Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2022 C conf
Subsequence Covers of Words.
SPIRE
Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2021 J jnl
Circular pattern matching with
J. Comput. Syst. Sci.
Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2021 B conf
Computing Covers of 2D-Strings.
CPM
Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2021 A conf
Hardness of Detecting Abelian and Additive Square Factors in Strings.
ESA
Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2021 J jnl
Hardness of Detecting Abelian and Additive Square Factors in Strings.
CoRR
Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2021 J jnl
Internal Dictionary Matching.
Algorithmica
Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2021 J jnl
Shortest covers of all cyclic shifts of a string.
Theor. Comput. Sci.
Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2021 C conf
String Covers of a Tree.
SPIRE
Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2020 J jnl
A Linear-Time Algorithm for Seeds Computation.
ACM Trans. Algorithms
Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2020 B conf
Counting Distinct Patterns in Internal Dictionary Matching.
CPM
Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2020 J jnl
Counting Distinct Patterns in Internal Dictionary Matching.
CoRR
Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2020 C conf
Efficient Enumeration of Distinct Factors Using Package Representations.
SPIRE
Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2020 C conf
Internal Quasiperiod Queries.
SPIRE
Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2020 J jnl
Internal Quasiperiod Queries.
CoRR
Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2020 B conf
Shortest Covers of All Cyclic Shifts of a String.
WALCOM
Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2020 J jnl
String periods in the order-preserving model.
Inf. Comput.
Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen
2020 A conf
The Number of Repetitions in 2D-Strings.
ESA
Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2020 J jnl
The Number of Repetitions in 2D-Strings.
CoRR
Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2020 J jnl
Tight Bound for the Number of Distinct Palindromes in a Tree.
CoRR
Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen
2020 B conf
Unary Words Have the Smallest Levenshtein k-Neighbourhoods.
CPM
Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Tomasz Walen, Wiktor Zuba
2020 J jnl
Universal reconstruction of a string.
Theor. Comput. Sci.
Pawel Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2019 B conf
Circular Pattern Matching with k Mismatches.
FCT
Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2019 J jnl
Circular Pattern Matching with k Mismatches.
CoRR
Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2019 C conf
Efficient Representation and Counting of Antipower Factors in Words.
LATA
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2019 J jnl
Efficient enumeration of non-equivalent squares in partial words with few holes.
J. Comb. Optim.
Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2019 B conf
Internal Dictionary Matching.
ISAAC
Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2019 J jnl
Internal Dictionary Matching.
CoRR
Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2019 B conf
Quasi-Linear-Time Algorithm for Longest Common Circular Factor.
CPM
Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2019 J jnl
Quasi-Linear-Time Algorithm for Longest Common Circular Factor.
CoRR
Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2019 C conf
Weighted Shortest Common Supersequence Problem Revisited.
SPIRE
Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2019 J jnl
Weighted Shortest Common Supersequence Problem Revisited.
CoRR
Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2018 J jnl
Efficient Representation and Counting of Antipower Factors in Words.
CoRR
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2018 J jnl
Efficient algorithms for shortest partial seeds in words.
Theor. Comput. Sci.
Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2018 C conf
Faster Recovery of Approximate Periods over Edit Distance.
SPIRE
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2018 J jnl
Faster Recovery of Approximate Periods over Edit Distance.
CoRR
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2018 — conf
How Much Different Are Two Words with Different Shortest Periods.
AIAI (Workshops)
Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2018 B conf
Linear-Time Algorithm for Long LCF with k Mismatches.
CPM
Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2018 J jnl
Linear-Time Algorithm for Long LCF with k Mismatches.
CoRR
Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2018 C conf
On Periodicity Lemma for Partial Words.
LATA
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2018 J jnl
On Periodicity Lemma for Partial Words.
CoRR
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2018 J jnl
On the string consensus problem and the Manhattan sequence consensus problem.
Theor. Comput. Sci.
Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2018 A conf
String Periods in the Order-Preserving Model.
STACS
Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen
2018 J jnl
String Periods in the Order-Preserving Model.
CoRR
Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen
2017 J jnl
Covering problems for partial words and for indeterminate strings.
Theor. Comput. Sci.
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2017 Misc conf
Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes.
COCOON
Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2017 J jnl
String Powers in Trees.
Algorithmica
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2016 B conf
Faster Longest Common Extension Queries in Strings over General Alphabets.
CPM
Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen
2016 J jnl
Faster Longest Common Extension Queries in Strings over General Alphabets.
CoRR
Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen
2016 J jnl
Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word.
CoRR
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2016 J jnl
Maximum number of distinct and nonequivalent nonstandard squares in a word.
Theor. Comput. Sci.
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2016 C conf
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries.
SPIRE
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2016 J jnl
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries.
CoRR
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2016 J jnl
On the greedy algorithm for the Shortest Common Superstring problem with reversals.
Inf. Process. Lett.
Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2016 J jnl
Order-preserving indexing.
Theor. Comput. Sci.
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2016 J jnl
Polynomial-time approximation algorithms for weighted LCS problem.
Discret. Appl. Math.
Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2015 J jnl
A note on the longest common compatible prefix problem for partial words.
J. Discrete Algorithms
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
2015 C conf
Efficient Algorithms for Longest Closed Factor Array.
SPIRE
Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto, Tomasz Walen
2015 J jnl
Fast Algorithm for Partial Covers in Words.
Algorithmica
Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2015 A* conf
Internal Pattern Matching Queries in a Text and Applications.
SODA
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2015 J jnl
Linear-time version of Holub's algorithm for morphic imprimitivity testing.
Theor. Comput. Sci.
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2015 J jnl
On the Greedy Algorithm for the Shortest Common Superstring Problem with Reversals.
CoRR
Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2015 B conf
String Powers in Trees.
CPM
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2015 C conf
Tight Bound for the Number of Distinct Palindromes in a Tree.
SPIRE
Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen
2015 B conf
Universal Reconstruction of a String.
WADS
Pawel Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014 B conf
Covering Problems for Partial Words and for Indeterminate Strings.
ISAAC
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014 J jnl
Covering Problems for Partial Words and for Indeterminate Strings.
CoRR
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014 B conf
Efficient Algorithms for Shortest Partial Seeds in Words.
CPM
Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014 J jnl
Efficient counting of square substrings in a tree.
Theor. Comput. Sci.
Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014 J jnl
Extracting powers and periods in a word from its runs structure.
Theor. Comput. Sci.
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014 J jnl
Fast Algorithm for Partial Covers in Words.
CoRR
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Solon P. Pissis, Tomasz Walen
2014 C conf
Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word.
Developments in Language Theory
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014 J jnl
New simple efficient algorithms computing powers and runs in strings.
Discret. Appl. Math.
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Krzysztof Stencel, Tomasz Walen
2014 C conf
On the String Consensus Problem and the Manhattan Sequence Consensus Problem.
SPIRE
Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014 J jnl
On the String Consensus Problem and the Manhattan Sequence Consensus Problem.
CoRR
Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014 J jnl
RNA Bricks - a database of RNA 3D motifs and their interactions.
Nucleic Acids Res.
Grzegorz Chojnowski, Tomasz Walen, Janusz M. Bujnicki
2013 J jnl
A Note on the Longest Common Compatible Prefix Problem for Partial Words.
CoRR
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
2013 J jnl
A linear time algorithm for consecutive permutation pattern matching.
Inf. Process. Lett.
Marcin Kubica, Tomasz Kulczynski, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2013 J jnl
A note on efficient computation of all Abelian periods in a string.
Inf. Process. Lett.
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen
2013 J jnl
Computing the Longest Previous Factor.
Eur. J. Comb.
Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen
2013 J jnl
Efficient seed computation revisited.
Theor. Comput. Sci.
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
2013 B conf
Fast Algorithm for Partial Covers in Words.
CPM
Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2013 C conf
Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing.
LATA
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2013 J jnl
On the maximum number of cubic subwords in a word.
Eur. J. Comb.
Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2013 J jnl
Optimal Data Structure for Internal Pattern Matching Queries in a Text and Applications.
CoRR
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2013 C conf
Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes.
SPIRE
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2013 J jnl
Order-Preserving Suffix Trees and Their Algorithmic Applications
CoRR
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2012 J jnl
A Note on Efficient Computation of All Abelian Periods in a String
CoRR
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen
2012 A* conf
A linear time algorithm for seeds computation.
SODA
Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2012 B conf
Efficient Counting of Square Substrings in a Tree.
ISAAC
Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2012 C conf
Efficient Data Structures for the Factor Periodicity Problem.
SPIRE
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2012 J jnl
Efficient algorithms for three variants of the LPF table.
J. Discrete Algorithms
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen
2012 J jnl
Improved algorithms for the range next value problem and applications.
Theor. Comput. Sci.
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, German Tischler, Tomasz Walen
2012 J jnl
On the maximal sum of exponents of runs in a string.
J. Discrete Algorithms
Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2012 B conf
The Maximum Number of Squares in a Tree.
CPM
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen
2012 J jnl
The maximal number of cubic runs in a word.
J. Comput. Syst. Sci.
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2011 J jnl
A Linear Time Algorithm for Seeds Computation
CoRR
Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2011 J jnl
Approximation of RNA multiple structural alignment.
J. Discrete Algorithms
Marcin Kubica, Romeo Rizzi, Stéphane Vialette, Tomasz Walen
2011 J jnl
Efficient Seeds Computation Revisited
CoRR
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
2011 B conf
Efficient Seeds Computation Revisited.
CPM
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
2011 B conf
Polynomial-Time Approximation Algorithms for Weighted LCS Problem.
CPM
Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2010 B conf
Algorithms for Three Versions of the Shortest Common Superstring Problem.
CPM
Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2010 B conf
Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays.
SOFSEM
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen
2010 C conf
Extracting Powers and Periods in a String from Its Runs Structure.
SPIRE
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2010 J jnl
Finding Patterns In Given Intervals.
Fundam. Informaticae
Maxime Crochemore, Marcin Kubica, Tomasz Walen, Costas S. Iliopoulos, M. Sohel Rahman
2010 J jnl
Improved induced matchings in sparse graphs.
Discret. Appl. Math.
Rok Erman, Lukasz Kowalik, Matjaz Krnc, Tomasz Walen
2010 Misc conf
New Simple Efficient Algorithms Computing Powers and Runs in Strings.
PSC
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Krzysztof Stencel, Tomasz Walen
2010 C conf
On the Maximal Number of Cubic Runs in a String.
LATA
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2010 C conf
On the Maximal Sum of Exponents of Runsin a String.
IWOCA
Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2010 J jnl
On the maximal sum of exponents of runs in a string
CoRR
Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2009 — conf
Improved Induced Matchings in Sparse Graphs.
IWPEC
Rok Erman, Lukasz Kowalik, Matjaz Krnc, Tomasz Walen
2009 C conf
LPF Computation Revisited.
IWOCA
Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen
2009 C conf
On the Maximal Number of Cubic Subwords in a String.
IWOCA
Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2009 J jnl
On the maximal number of cubic subwords in a string
CoRR
Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2009 J jnl
On the maximal number of highly periodic runs in a string
CoRR
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2008 A conf
Improved Algorithms for the Range Next Value Problem and Applications.
STACS
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Mohammad Sohel Rahman, Tomasz Walen
2007 B conf
Algorithms for Computing the Longest Parameterized Common Subsequence.
CPM
Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, Tomasz Walen
2007 J jnl
Approximating reversal distance for strings with bounded number of duplicates.
Discret. Appl. Math.
Petr Kolman, Tomasz Walen
2007 J jnl
RNA multiple structural alignment with longest common subsequences.
J. Comb. Optim.
Sergey Bereg, Marcin Kubica, Tomasz Walen, Binhai Zhu
2007 J jnl
Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set.
Electron. J. Comb.
Petr Kolman, Tomasz Walen
2006 B conf
Approximation of RNA Multiple Structural Alignment.
CPM
Marcin Kubica, Romeo Rizzi, Stéphane Vialette, Tomasz Walen
2006 B conf
Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set.
WAOA
Petr Kolman, Tomasz Walen