


default search action
Jakub Radoszewski
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j54]Panagiotis Charalampopoulos
, Huiping Chen, Peter Christen, Grigorios Loukides
, Nadia Pisanti, Solon P. Pissis
, Jakub Radoszewski:
Pattern Masking for Dictionary Matching: Theory and Practice. Algorithmica 86(6): 1948-1978 (2024) - [j53]Shuo Li, Jakub Pachocki, Jakub Radoszewski:
A Note on the Maximum Number of k-Powers in a Finite Word. Electron. J. Comb. 31(3) (2024) - [j52]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) - [c79]Hideo Bannai, Panagiotis Charalampopoulos
, Jakub Radoszewski:
Maintaining the Size of LZ77 on Semi-Dynamic Strings. CPM 2024: 3:1-3:20 - [c78]Jakub Radoszewski
, Wojciech Rytter
, Tomasz Walen
:
Faster Algorithms for Ranking/Unranking Bordered and Unbordered Words. SPIRE 2024: 257-271 - [c77]Jakub Radoszewski
, Wiktor Zuba
:
Computing String Covers in Sublinear Time. SPIRE 2024: 272-288 - [c76]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 - [i51]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) - [i50]Jakub Radoszewski, Wiktor Zuba:
Computing String Covers in Sublinear Time. CoRR abs/2409.14559 (2024) - [i49]Estéban Gabory, Njagi Moses Mwaniki, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski, Michelle Sweering, Wiktor Zuba:
Elastic-Degenerate String Comparison. CoRR abs/2411.07782 (2024) - 2023
- [j51]Tomasz Kociumaka
, Jakub Radoszewski
, Tatiana Starikovskaya:
Publisher Correction: Longest Common Substring with Approximately k Mismatches. Algorithmica 85(10): 3323 (2023) - [c75]Estéban Gabory, Njagi Moses Mwaniki, Nadia Pisanti, Solon P. Pissis
, Jakub Radoszewski, Michelle Sweering, Wiktor Zuba:
Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and Applications. CPM 2023: 11:1-11:20 - [c74]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 - [c73]Jakub Radoszewski:
Linear Time Construction of Cover Suffix Tree and Applications. ESA 2023: 89:1-89:17 - [i48]Jakub Radoszewski:
Linear Time Construction of Cover Suffix Tree and Applications. CoRR abs/2308.04289 (2023) - 2022
- [j50]Aleksander Kedzierski
, Jakub Radoszewski
:
k-Approximate Quasiperiodicity Under Hamming and Edit Distance. Algorithmica 84(3): 566-589 (2022) - [j49]Panagiotis Charalampopoulos
, Costas S. Iliopoulos, Tomasz Kociumaka
, Solon P. Pissis
, Jakub Radoszewski
, Juliusz Straszynski
:
Efficient Computation of Sequence Mappability. Algorithmica 84(5): 1418-1440 (2022) - [j48]Tomasz Kociumaka
, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
A periodicity lemma for partial words. Inf. Comput. 283: 104677 (2022) - [j47]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) - [c72]Panagiotis Charalampopoulos
, Solon P. Pissis
, Jakub Radoszewski:
Longest Palindromic Substring in Sublinear Time. CPM 2022: 20:1-20:9 - [c71]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 - [c70]Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Rectangular Tile Covers of 2D-Strings. CPM 2022: 23:1-23:14 - [c69]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 - [c68]Panagiotis Charalampopoulos
, Solon P. Pissis
, Jakub Radoszewski
, Wojciech Rytter
, Tomasz Walen
, Wiktor Zuba
:
Subsequence Covers of Words. SPIRE 2022: 3-15 - [i47]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
- [j46]Panagiotis Charalampopoulos
, Tomasz Kociumaka
, Manal Mohamed
, Jakub Radoszewski
, Wojciech Rytter
, Tomasz Walen
:
Internal Dictionary Matching. Algorithmica 83(7): 2142-2169 (2021) - [j45]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) - [j44]Shmuel T. Klein
, Jakub Radoszewski, Tamar C. Serebro, Dana Shapira
:
Optimal skeleton and reduced Huffman trees. Theor. Comput. Sci. 852: 157-171 (2021) - [j43]Patryk Czajka, Jakub Radoszewski:
Experimental evaluation of algorithms for computing quasiperiods. Theor. Comput. Sci. 854: 17-29 (2021) - [j42]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) - [c67]Panagiotis Charalampopoulos
, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
Computing Covers of 2D-Strings. CPM 2021: 12:1-12:20 - [c66]Panagiotis Charalampopoulos
, Tomasz Kociumaka
, Solon P. Pissis
, Jakub Radoszewski:
Faster Algorithms for Longest Common Substring. ESA 2021: 30:1-30:17 - [c65]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 - [c64]Panagiotis Charalampopoulos
, Huiping Chen, Peter Christen, Grigorios Loukides
, Nadia Pisanti, Solon P. Pissis
, Jakub Radoszewski:
Pattern Masking for Dictionary Matching. ISAAC 2021: 65:1-65:19 - [c63]Jakub Radoszewski
, Wojciech Rytter
, Juliusz Straszynski
, Tomasz Walen
, Wiktor Zuba
:
String Covers of a Tree. SPIRE 2021: 68-82 - [i46]Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski:
Faster Algorithms for Longest Common Substring. CoRR abs/2105.03106 (2021) - [i45]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
- [j41]Amihood Amir, Panagiotis Charalampopoulos
, Solon P. Pissis
, Jakub Radoszewski:
Dynamic and Internal Longest Common Substring. Algorithmica 82(12): 3707-3743 (2020) - [j40]Carl Barton, Tomasz Kociumaka
, Chang Liu
, Solon P. Pissis
, Jakub Radoszewski:
Indexing weighted sequences: Neat and efficient. Inf. Comput. 270 (2020) - [j39]Garance Gourdel, Tomasz Kociumaka
, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen
:
String periods in the order-preserving model. Inf. Comput. 270 (2020) - [j38]Jakub Radoszewski, Tatiana Starikovskaya:
Streaming k-mismatch with error correcting and applications. Inf. Comput. 271: 104513 (2020) - [j37]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) - [j36]Mai Alzamel
, Panagiotis Charalampopoulos
, Costas S. Iliopoulos, Solon P. Pissis
, Jakub Radoszewski, Wing-Kin Sung
:
Faster algorithms for 1-mappability of a sequence. Theor. Comput. Sci. 812: 2-12 (2020) - [j35]Pawel Gawrychowski
, Tomasz Kociumaka
, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
Universal reconstruction of a string. Theor. Comput. Sci. 812: 174-186 (2020) - [c62]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 - [c61]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 - [c60]Garance Gourdel, Tomasz Kociumaka
, Jakub Radoszewski
, Tatiana Starikovskaya:
Approximating Longest Common Substring with k mismatches: Theory and Practice. CPM 2020: 16:1-16:15 - [c59]Aleksander Kedzierski
, Jakub Radoszewski
:
k-Approximate Quasiperiodicity under Hamming and Edit Distance. CPM 2020: 18:1-18:15 - [c58]Panagiotis Charalampopoulos
, Jakub Radoszewski
, Wojciech Rytter
, Tomasz Walen
, Wiktor Zuba
:
The Number of Repetitions in 2D-Strings. ESA 2020: 32:1-32:18 - [c57]Jakub Radoszewski
, Juliusz Straszynski
:
Efficient Computation of 2-Covers of a String. ESA 2020: 77:1-77:17 - [c56]Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski
, Wojciech Rytter
, Juliusz Straszynski
, Tomasz Walen
, Wiktor Zuba
:
Internal Quasiperiod Queries. SPIRE 2020: 60-75 - [c55]Panagiotis Charalampopoulos
, Tomasz Kociumaka
, Jakub Radoszewski
, Wojciech Rytter
, Tomasz Walen
, Wiktor Zuba
:
Efficient Enumeration of Distinct Factors Using Package Representations. SPIRE 2020: 247-261 - [c54]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 - [i44]Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya:
Approximating longest common substring with $k$ mismatches: Theory and practice. CoRR abs/2004.13389 (2020) - [i43]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) - [i42]Aleksander Kedzierski, Jakub Radoszewski:
k-Approximate Quasiperiodicity under Hamming and Edit Distance. CoRR abs/2005.06329 (2020) - [i41]Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
The Number of Repetitions in 2D-Strings. CoRR abs/2006.15999 (2020) - [i40]Panagiotis Charalampopoulos, Huiping Chen, Peter Christen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski:
Pattern Masking for Dictionary Matching. CoRR abs/2006.16137 (2020) - [i39]Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Internal Quasiperiod Queries. CoRR abs/2007.13471 (2020)
2010 – 2019
- 2019
- [j34]Tomasz Kociumaka
, Jakub Radoszewski
, Tatiana Starikovskaya:
Longest Common Substring with Approximately k Mismatches. Algorithmica 81(6): 2633-2652 (2019) - [j33]Tomasz Kociumaka
, Jakub Radoszewski
, Tatiana Starikovskaya:
Correction to: Longest Common Substring with Approximately k Mismatches. Algorithmica 81(7): 3074 (2019) - [j32]Panagiotis Charalampopoulos
, Costas S. Iliopoulos, Solon P. Pissis
, Jakub Radoszewski:
On-line weighted pattern matching. Inf. Comput. 266: 49-59 (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) - [j30]Tomasz Kociumaka
, Solon P. Pissis
, Jakub Radoszewski
:
Pattern Matching and Consensus Problems on Weighted Sequences and Profiles. Theory Comput. Syst. 63(3): 506-542 (2019) - [j29]Maxime Crochemore, Jakub Radoszewski:
Special issue in honor of the 70th birthday of Prof. Wojciech Rytter. Theor. Comput. Sci. 792: 1 (2019) - [c53]Pawel Gawrychowski
, Jakub Radoszewski, Tatiana Starikovskaya:
Quasi-Periodicity in Streams. CPM 2019: 22:1-22:14 - [c52]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 - [c51]Amihood Amir, Panagiotis Charalampopoulos
, Solon P. Pissis
, Jakub Radoszewski
:
Longest Common Substring Made Fully Dynamic. ESA 2019: 6:1-6:17 - [c50]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 - [c49]Oluwole I. Ajala, Miznah Alshammary, Mai Alzamel, Jia Gao, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Bruce W. Watson:
On the Cyclic Regularities of Strings. AIAI (Workshops) 2019: 219-224 - [c48]Panagiotis Charalampopoulos
, Tomasz Kociumaka
, Manal Mohamed
, Jakub Radoszewski
, Wojciech Rytter
, Tomasz Walen
:
Internal Dictionary Matching. ISAAC 2019: 22:1-22:17 - [c47]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 - [c46]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 - [c45]Jakub Radoszewski:
Pattern Matching on Weighted Strings. Stringology 2019: 1 - [i38]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) - [i37]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) - [i36]Oluwole I. Ajala, Miznah Alshammary, Mai Alzamel, Jia Gao, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Bruce W. Watson:
On the cyclic regularities of strings. CoRR abs/1908.01664 (2019) - [i35]Patryk Czajka, Jakub Radoszewski:
Experimental Evaluation of Algorithms for Computing Quasiperiods. CoRR abs/1909.11336 (2019) - [i34]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) - [i33]Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Internal Dictionary Matching. CoRR abs/1909.11577 (2019) - 2018
- [j28]Szymon Grabowski
, Tomasz Kociumaka
, Jakub Radoszewski:
On Abelian Longest Common Factor with and without RLE. Fundam. Informaticae 163(3): 225-244 (2018) - [j27]Michal Adamczyk, Mai Alzamel
, Panagiotis Charalampopoulos
, Jakub Radoszewski:
Palindromic Decompositions with Gaps and Errors. Int. J. Found. Comput. Sci. 29(8): 1311-1329 (2018) - [j26]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) - [j25]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) - [c44]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 - [c43]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 - [c42]Tomasz Kociumaka
, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
On Periodicity Lemma for Partial Words. LATA 2018: 232-244 - [c41]Mai Alzamel
, Panagiotis Charalampopoulos
, Costas S. Iliopoulos
, Tomasz Kociumaka
, Solon P. Pissis
, Jakub Radoszewski
, Juliusz Straszynski
:
Efficient Computation of Sequence Mappability. SPIRE 2018: 12-26 - [c40]Tomasz Kociumaka
, Jakub Radoszewski
, Wojciech Rytter
, Juliusz Straszynski
, Tomasz Walen
, Wiktor Zuba
:
Faster Recovery of Approximate Periods over Edit Distance. SPIRE 2018: 233-240 - [c39]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 - [i32]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On Periodicity Lemma for Partial Words. CoRR abs/1801.01096 (2018) - [i31]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) - [i30]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) - [i29]Szymon Grabowski, Tomasz Kociumaka, Jakub Radoszewski:
On Abelian Longest Common Factor with and without RLE. CoRR abs/1804.06809 (2018) - [i28]Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski:
Longest Common Factor Made Fully Dynamic. CoRR abs/1804.08731 (2018) - [i27]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) - [i26]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski:
Efficient Computation of Sequence Mappability. CoRR abs/1807.11702 (2018) - [i25]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
- [j24]Tomasz Kociumaka
, Jakub Radoszewski, Wojciech Rytter:
Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet. Algorithmica 77(4): 1194-1215 (2017) - [j23]Tomasz Kociumaka
, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
String Powers in Trees. Algorithmica 79(3): 814-834 (2017) - [j22]Amihood Amir, Costas S. Iliopoulos, Jakub Radoszewski:
Two strings at Hamming distance 1 cannot be both quasiperiodic. Inf. Process. Lett. 128: 54-57 (2017) - [j21]Tomasz Kociumaka
, Jakub Radoszewski, Wojciech Rytter:
Fast algorithms for Abelian periods in words and greatest common divisor queries. J. Comput. Syst. Sci. 84: 205-218 (2017) - [j20]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) - [c38]Mai Alzamel, Panagiotis Charalampopoulos
, Costas S. Iliopoulos, Solon P. Pissis
, Jakub Radoszewski, Wing-Kin Sung
:
Faster Algorithms for 1-Mappability of a Sequence. COCOA (2) 2017: 109-121 - [c37]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 - [c36]Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos
, Costas S. Iliopoulos, Jakub Radoszewski:
Palindromic Decompositions with Gaps and Errors. CSR 2017: 48-61 - [c35]Jakub Radoszewski, Tatiana Starikovskaya:
Streaming K-Mismatch with Error Correcting and Applications. DCC 2017: 290-299 - [c34]Amihood Amir, Panagiotis Charalampopoulos
, Costas S. Iliopoulos, Solon P. Pissis
, Jakub Radoszewski:
Longest Common Factor After One Edit Operation. SPIRE 2017: 14-26 - [e1]Juha Kärkkäinen, Jakub Radoszewski, Wojciech Rytter:
28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland. LIPIcs 78, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-039-2 [contents] - [i24]Amihood Amir, Costas S. Iliopoulos, Jakub Radoszewski:
Two strings at Hamming distance 1 cannot be both quasiperiodic. CoRR abs/1703.00195 (2017) - [i23]Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Jakub Radoszewski:
Palindromic Decompositions with Gaps and Errors. CoRR abs/1703.08931 (2017) - [i22]Carl Barton, Tomasz Kociumaka, Chang Liu, Solon P. Pissis, Jakub Radoszewski:
Indexing Weighted Sequences: Neat and Efficient. CoRR abs/1704.07625 (2017) - [i21]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski, Wing-Kin Sung:
Faster algorithms for 1-mappability of a sequence. CoRR abs/1705.04022 (2017) - [i20]Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya:
Longest common substring with approximately k mismatches. CoRR abs/1712.08573 (2017) - 2016
- [j19]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) - [j18]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) - [j17]Jakub Radoszewski, Tomasz Radzik
:
2015 London Stringology Days and London Algorithmic Workshop (LSD & LAW). J. Discrete Algorithms 37: 1-2 (2016) - [j16]Tomasz Kociumaka
, Jakub Radoszewski, Wojciech Rytter:
Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence. SIAM J. Discret. Math. 30(4): 2027-2046 (2016) - [j15]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) - [j14]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]Carl Barton, Tomasz Kociumaka
, Solon P. Pissis
, Jakub Radoszewski:
Efficient Index for Weighted Sequences. CPM 2016: 4:1-4:13 - [c32]Costas S. Iliopoulos, Jakub Radoszewski:
Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties. CPM 2016: 8:1-8:12 - [c31]Tomasz Kociumaka, Solon P. Pissis
, Jakub Radoszewski:
Pattern Matching and Consensus Problems on Weighted Sequences and Profiles. ISAAC 2016: 46:1-46:12 - [c30]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 - [i19]Carl Barton, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski:
Efficient Index for Weighted Sequences. CoRR abs/1602.01116 (2016) - [i18]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word. CoRR abs/1604.02238 (2016) - [i17]Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski:
Parameterizing PWM- and Profile-Matching and Knapsack by the feasible-weight solutions count. CoRR abs/1604.07581 (2016) - [i16]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) - [i15]Jakub Radoszewski, Tatiana Starikovskaya:
Streaming k-mismatch with data recovery and applications. CoRR abs/1607.05626 (2016) - 2015
- [j13]Tomasz Kociumaka
, Solon P. Pissis
, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
Fast Algorithm for Partial Covers in Words. Algorithmica 73(1): 217-233 (2015) - [j12]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) - [j11]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) - [c29]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
String Powers in Trees. CPM 2015: 284-294 - [c28]Tomasz Kociumaka, Jakub Radoszewski, Bartlomiej Wisniewski:
Subquadratic-Time Algorithms for Abelian Stringology Problems. MACIS 2015: 320-334 - [c27]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
Internal Pattern Matching Queries in a Text and Applications. SODA 2015: 532-551 - [c26]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 - [c25]Pawel Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
Universal Reconstruction of a String. WADS 2015: 386-397 - [i14]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter:
Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence. CoRR abs/1510.02637 (2015) - [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
- [j10]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) - [j9]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) - [j8]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) - [c24]Tomasz Kociumaka, Solon P. Pissis
, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
Efficient Algorithms for Shortest Partial Seeds in Words. CPM 2014: 192-201 - [c23]Tomasz Kociumaka
, Jakub Radoszewski, Wojciech Rytter:
Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence. CPM 2014: 202-211 - [c22]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 - [c21]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 - [c20]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
- [j7]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) - [j6]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) - [j5]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) - [j4]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) - [c19]Tomasz Kociumaka
, Solon P. Pissis
, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
Fast Algorithm for Partial Covers in Words. CPM 2013: 177-188 - [c18]Tomasz Kociumaka
, Jakub Radoszewski, Wojciech Rytter:
Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet. ESA 2013: 625-636 - [c17]Tomasz Kociumaka
, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing. LATA 2013: 383-394 - [c16]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 - [c15]Tomasz Kociumaka
, Jakub Radoszewski, Wojciech Rytter:
Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries. STACS 2013: 245-256 - [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
- [j3]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) - [j2]Jakub Radoszewski, Wojciech Rytter:
On the structure of compacted subword graphs of Thue-Morse words and their applications. J. Discrete Algorithms 11: 15-24 (2012) - [j1]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) - [c14]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 - [c13]Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
Efficient Counting of Square Substrings in a Tree. ISAAC 2012: 207-216 - [c12]Tomasz Kociumaka
, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
A linear time algorithm for seeds computation. SODA 2012: 1095-1112 - [c11]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
- [c10]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 - [c9]Marek Cygan
, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
Polynomial-Time Approximation Algorithms for Weighted LCS Problem. CPM 2011: 455-466 - [c8]Jakub Radoszewski, Wojciech Rytter:
Hamiltonian Paths in the Square of a Tree. ISAAC 2011: 90-99 - [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
- [c7]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 - [c6]Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
On the Maximal Sum of Exponents of Runsin a String. IWOCA 2010: 10-19 - [c5]Maxime Crochemore
, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
On the Maximal Number of Cubic Runs in a String. LATA 2010: 227-238 - [c4]Jakub Radoszewski, Wojciech Rytter:
Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup. SOFSEM 2010: 663-671 - [c3]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
Extracting Powers and Periods in a String from Its Runs Structure. SPIRE 2010: 258-269 - [c2]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. Stringology 2010: 138-149 - [i3]Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the maximal sum of exponents of runs in a string. CoRR abs/1003.4866 (2010)
2000 – 2009
- 2009
- [c1]Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
On the Maximal Number of Cubic Subwords in a String. IWOCA 2009: 345-355 - [i2]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the maximal number of highly periodic runs in a string. CoRR abs/0907.2157 (2009) - [i1]Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the maximal number of cubic subwords in a string. CoRR abs/0911.1370 (2009)
Coauthor Index
aka: Mai Alzamel

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint