


default search action
Tomasz Walen
Person information
- affiliation: University of Warsaw, Poland
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j41]Tomasz Kociumaka
, Jakub Radoszewski
, Wojciech Rytter
, Tomasz Walen
:
Internal Pattern Matching Queries in a Text and Applications. SIAM J. Comput. 53(5): 1524-1577 (2024) - [c60]Jakub Radoszewski
, Wojciech Rytter
, Tomasz Walen
:
Faster Algorithms for Ranking/Unranking Bordered and Unbordered Words. SPIRE 2024: 257-271 - [c59]Panagiotis Charalampopoulos
, Solon P. Pissis
, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
Approximate Circular Pattern Matching Under Edit Distance. STACS 2024: 24:1-24:22 - [i32]Panagiotis Charalampopoulos
, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
Approximate Circular Pattern Matching under Edit Distance. CoRR abs/2402.14550 (2024) - 2023
- [j40]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) - [c58]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: 15:1-15:15 - 2022
- [j39]Tomasz Kociumaka
, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
A periodicity lemma for partial words. Inf. Comput. 283: 104677 (2022) - [j38]Tomasz Kociumaka
, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Efficient representation and counting of antipower factors in words. Inf. Comput. 286: 104779 (2022) - [c57]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: 22:1-22:15 - [c56]Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Rectangular Tile Covers of 2D-Strings. CPM 2022: 23:1-23:14 - [c55]Panagiotis Charalampopoulos
, Tomasz Kociumaka
, Jakub Radoszewski, Solon P. Pissis
, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
Approximate Circular Pattern Matching. ESA 2022: 35:1-35:19 - [c54]Panagiotis Charalampopoulos
, Solon P. Pissis
, Jakub Radoszewski
, Wojciech Rytter
, Tomasz Walen
, Wiktor Zuba
:
Subsequence Covers of Words. SPIRE 2022: 3-15 - [i31]Panagiotis Charalampopoulos
, Tomasz Kociumaka, Jakub Radoszewski, Solon P. Pissis, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
Approximate Circular Pattern Matching. CoRR abs/2208.08915 (2022) - 2021
- [j37]Panagiotis Charalampopoulos
, Tomasz Kociumaka
, Manal Mohamed
, Jakub Radoszewski
, Wojciech Rytter
, Tomasz Walen
:
Internal Dictionary Matching. Algorithmica 83(7): 2142-2169 (2021) - [j36]Panagiotis Charalampopoulos
, Tomasz Kociumaka
, Solon P. Pissis
, Jakub Radoszewski
, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Circular pattern matching with k mismatches. J. Comput. Syst. Sci. 115: 73-85 (2021) - [j35]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: 70-81 (2021) - [c53]Panagiotis Charalampopoulos
, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
Computing Covers of 2D-Strings. CPM 2021: 12:1-12:20 - [c52]Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Hardness of Detecting Abelian and Additive Square Factors in Strings. ESA 2021: 77:1-77:19 - [c51]Jakub Radoszewski
, Wojciech Rytter
, Juliusz Straszynski
, Tomasz Walen
, Wiktor Zuba
:
String Covers of a Tree. SPIRE 2021: 68-82 - [i30]Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Hardness of Detecting Abelian and Additive Square Factors in Strings. CoRR abs/2107.09206 (2021) - 2020
- [j34]Garance Gourdel, Tomasz Kociumaka
, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen
:
String periods in the order-preserving model. Inf. Comput. 270 (2020) - [j33]Tomasz Kociumaka
, Marcin Kubica, Jakub Radoszewski
, Wojciech Rytter, Tomasz Walen
:
A Linear-Time Algorithm for Seeds Computation. ACM Trans. Algorithms 16(2): 27:1-27:23 (2020) - [j32]Pawel Gawrychowski
, Tomasz Kociumaka
, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
Universal reconstruction of a string. Theor. Comput. Sci. 812: 174-186 (2020) - [c50]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: 8:1-8:15 - [c49]Panagiotis Charalampopoulos
, Solon P. Pissis
, Jakub Radoszewski
, Tomasz Walen
, Wiktor Zuba
:
Unary Words Have the Smallest Levenshtein k-Neighbourhoods. CPM 2020: 10:1-10:12 - [c48]Panagiotis Charalampopoulos
, Jakub Radoszewski
, Wojciech Rytter
, Tomasz Walen
, Wiktor Zuba
:
The Number of Repetitions in 2D-Strings. ESA 2020: 32:1-32:18 - [c47]Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski
, Wojciech Rytter
, Juliusz Straszynski
, Tomasz Walen
, Wiktor Zuba
:
Internal Quasiperiod Queries. SPIRE 2020: 60-75 - [c46]Panagiotis Charalampopoulos
, Tomasz Kociumaka
, Jakub Radoszewski
, Wojciech Rytter
, Tomasz Walen
, Wiktor Zuba
:
Efficient Enumeration of Distinct Factors Using Package Representations. SPIRE 2020: 247-261 - [c45]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: 69-80 - [i29]Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Counting Distinct Patterns in Internal Dictionary Matching. CoRR abs/2005.05681 (2020) - [i28]Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
The Number of Repetitions in 2D-Strings. CoRR abs/2006.15999 (2020) - [i27]Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Internal Quasiperiod Queries. CoRR abs/2007.13471 (2020) - [i26]Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen:
Tight Bound for the Number of Distinct Palindromes in a Tree. CoRR abs/2008.13209 (2020)
2010 – 2019
- 2019
- [j31]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): 501-522 (2019) - [c44]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: 25:1-25:14 - [c43]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: 213-228 - [c42]Panagiotis Charalampopoulos
, Tomasz Kociumaka
, Manal Mohamed
, Jakub Radoszewski
, Wojciech Rytter
, Tomasz Walen
:
Internal Dictionary Matching. ISAAC 2019: 22:1-22:17 - [c41]Tomasz Kociumaka
, Jakub Radoszewski
, Wojciech Rytter
, Juliusz Straszynski
, Tomasz Walen
, Wiktor Zuba
:
Efficient Representation and Counting of Antipower Factors in Words. LATA 2019: 421-433 - [c40]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: 221-238 - [i25]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 abs/1901.11305 (2019) - [i24]Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Circular Pattern Matching with k Mismatches. CoRR abs/1907.01815 (2019) - [i23]Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Weighted Shortest Common Supersequence Problem Revisited. CoRR abs/1909.11433 (2019) - [i22]Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Internal Dictionary Matching. CoRR abs/1909.11577 (2019) - 2018
- [j30]Tomasz Kociumaka
, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
On the string consensus problem and the Manhattan sequence consensus problem. Theor. Comput. Sci. 710: 126-138 (2018) - [j29]Tomasz Kociumaka
, Solon P. Pissis
, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
Efficient algorithms for shortest partial seeds in words. Theor. Comput. Sci. 710: 139-147 (2018) - [c39]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: 23:1-23:16 - [c38]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: 168-178 - [c37]Tomasz Kociumaka
, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
On Periodicity Lemma for Partial Words. LATA 2018: 232-244 - [c36]Tomasz Kociumaka
, Jakub Radoszewski
, Wojciech Rytter
, Juliusz Straszynski
, Tomasz Walen
, Wiktor Zuba
:
Faster Recovery of Approximate Periods over Edit Distance. SPIRE 2018: 233-240 - [c35]Garance Gourdel, Tomasz Kociumaka
, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen:
String Periods in the Order-Preserving Model. STACS 2018: 38:1-38:16 - [i21]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On Periodicity Lemma for Partial Words. CoRR abs/1801.01096 (2018) - [i20]Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen:
String Periods in the Order-Preserving Model. CoRR abs/1801.01404 (2018) - [i19]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 abs/1802.06369 (2018) - [i18]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Faster Recovery of Approximate Periods over Edit Distance. CoRR abs/1807.10483 (2018) - [i17]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Efficient Representation and Counting of Antipower Factors in Words. CoRR abs/1812.08101 (2018) - 2017
- [j28]Tomasz Kociumaka
, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
String Powers in Trees. Algorithmica 79(3): 814-834 (2017) - [j27]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: 25-39 (2017) - [c34]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: 99-111 - 2016
- [j26]Marek Cygan
, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Polynomial-time approximation algorithms for weighted LCS problem. Discret. Appl. Math. 204: 38-48 (2016) - [j25]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): 245-251 (2016) - [j24]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: 122-135 (2016) - [j23]Tomasz Kociumaka
, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Maximum number of distinct and nonequivalent nonstandard squares in a word. Theor. Comput. Sci. 648: 84-95 (2016) - [c33]Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen:
Faster Longest Common Extension Queries in Strings over General Alphabets. CPM 2016: 5:1-5:13 - [c32]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: 22-34 - [i16]Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen:
Faster Longest Common Extension Queries in Strings over General Alphabets. CoRR abs/1602.00447 (2016) - [i15]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word. CoRR abs/1604.02238 (2016) - [i14]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 abs/1606.08275 (2016) - 2015
- [j22]Tomasz Kociumaka
, Solon P. Pissis
, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
Fast Algorithm for Partial Covers in Words. Algorithmica 73(1): 217-233 (2015) - [j21]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: 49-53 (2015) - [j20]Tomasz Kociumaka
, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Linear-time version of Holub's algorithm for morphic imprimitivity testing. Theor. Comput. Sci. 602: 7-21 (2015) - [c31]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
String Powers in Trees. CPM 2015: 284-294 - [c30]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
Internal Pattern Matching Queries in a Text and Applications. SODA 2015: 532-551 - [c29]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: 95-102 - [c28]Pawel Gawrychowski, Tomasz Kociumaka
, Wojciech Rytter, Tomasz Walen
:
Tight Bound for the Number of Distinct Palindromes in a Tree. SPIRE 2015: 270-276 - [c27]Pawel Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
Universal Reconstruction of a String. WADS 2015: 386-397 - [i13]Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the Greedy Algorithm for the Shortest Common Superstring Problem with Reversals. CoRR abs/1511.08431 (2015) - 2014
- [j19]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: 258-267 (2014) - [j18]Grzegorz Chojnowski
, Tomasz Walen
, Janusz M. Bujnicki:
RNA Bricks - a database of RNA 3D motifs and their interactions. Nucleic Acids Res. 42(Database-Issue): 123-131 (2014) - [j17]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: 29-41 (2014) - [j16]Tomasz Kociumaka
, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient counting of square substrings in a tree. Theor. Comput. Sci. 544: 60-73 (2014) - [c26]Tomasz Kociumaka, Solon P. Pissis
, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
Efficient Algorithms for Shortest Partial Seeds in Words. CPM 2014: 192-201 - [c25]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word. Developments in Language Theory 2014: 215-226 - [c24]Maxime Crochemore
, Costas S. Iliopoulos, Tomasz Kociumaka
, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
Covering Problems for Partial Words and for Indeterminate Strings. ISAAC 2014: 220-232 - [c23]Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
On the String Consensus Problem and the Manhattan Sequence Consensus Problem. SPIRE 2014: 244-255 - [i12]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Solon P. Pissis, Tomasz Walen:
Fast Algorithm for Partial Covers in Words. CoRR abs/1401.0163 (2014) - [i11]Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the String Consensus Problem and the Manhattan Sequence Consensus Problem. CoRR abs/1407.6144 (2014) - [i10]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Covering Problems for Partial Words and for Indeterminate Strings. CoRR abs/1412.3696 (2014) - 2013
- [j15]Maxime Crochemore
, Lucian Ilie
, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen
:
Computing the Longest Previous Factor. Eur. J. Comb. 34(1): 15-26 (2013) - [j14]Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
On the maximum number of cubic subwords in a word. Eur. J. Comb. 34(1): 27-37 (2013) - [j13]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): 74-77 (2013) - [j12]Marcin Kubica, Tomasz Kulczynski, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
A linear time algorithm for consecutive permutation pattern matching. Inf. Process. Lett. 113(12): 430-433 (2013) - [j11]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: 171-181 (2013) - [c22]Tomasz Kociumaka
, Solon P. Pissis
, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
Fast Algorithm for Partial Covers in Words. CPM 2013: 177-188 - [c21]Tomasz Kociumaka
, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing. LATA 2013: 383-394 - [c20]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: 84-95 - [i9]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 abs/1303.6872 (2013) - [i8]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Optimal Data Structure for Internal Pattern Matching Queries in a Text and Applications. CoRR abs/1311.6235 (2013) - [i7]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 abs/1312.2381 (2013) - 2012
- [j10]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): 1828-1836 (2012) - [j9]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen
:
Efficient algorithms for three variants of the LPF table. J. Discrete Algorithms 11: 51-61 (2012) - [j8]Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
On the maximal sum of exponents of runs in a string. J. Discrete Algorithms 14: 29-36 (2012) - [j7]Maxime Crochemore
, Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman
, German Tischler, Tomasz Walen
:
Improved algorithms for the range next value problem and applications. Theor. Comput. Sci. 434: 23-34 (2012) - [c19]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: 27-40 - [c18]Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
Efficient Counting of Square Substrings in a Tree. ISAAC 2012: 207-216 - [c17]Tomasz Kociumaka
, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
A linear time algorithm for seeds computation. SODA 2012: 1095-1112 - [c16]Tomasz Kociumaka
, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
Efficient Data Structures for the Factor Periodicity Problem. SPIRE 2012: 284-294 - [i6]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 abs/1208.3313 (2012) - 2011
- [j6]Marcin Kubica, Romeo Rizzi
, Stéphane Vialette, Tomasz Walen
:
Approximation of RNA multiple structural alignment. J. Discrete Algorithms 9(4): 365-376 (2011) - [c15]Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis
, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
:
Efficient Seeds Computation Revisited. CPM 2011: 350-363 - [c14]Marek Cygan
, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
Polynomial-Time Approximation Algorithms for Weighted LCS Problem. CPM 2011: 455-466 - [i5]Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis
, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
Efficient Seeds Computation Revisited. CoRR abs/1104.3153 (2011) - [i4]Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
A Linear Time Algorithm for Seeds Computation. CoRR abs/1107.2422 (2011) - 2010
- [j5]Rok Erman, Lukasz Kowalik, Matjaz Krnc
, Tomasz Walen
:
Improved induced matchings in sparse graphs. Discret. Appl. Math. 158(18): 1994-2003 (2010) - [j4]Maxime Crochemore
, Marcin Kubica, Tomasz Walen
, Costas S. Iliopoulos, M. Sohel Rahman
:
Finding Patterns In Given Intervals. Fundam. Informaticae 101(3): 173-186 (2010) - [c13]Maxime Crochemore, Marek Cygan
, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
Algorithms for Three Versions of the Shortest Common Superstring Problem. CPM 2010: 299-309 - [c12]