Jakub Radoszewski

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 122

Top Venues

Publications

Hideo Bannai, Panagiotis Charalampopoulos, Jakub Radoszewski
Maintaining the Size of LZ77 on Semi-Dynamic Strings. CPM (2024)
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)
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) (2024)
Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya
Publisher Correction: Longest Common Substring with Approximately k Mismatches. Algorithmica 85 (10) (2023)
Jakub Radoszewski
Linear Time Construction of Cover Suffix Tree and Applications. ESA (2023)
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)
Jakub Radoszewski
Linear Time Construction of Cover Suffix Tree and Applications. CoRR (2023)
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)
Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski
Longest Palindromic Substring in Sublinear Time. CPM (2022)
Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski
Efficient Computation of Sequence Mappability. Algorithmica 84 (5) (2022)
Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
Subsequence Covers of Words. SPIRE (2022)
Aleksander Kedzierski, Jakub Radoszewski
k-Approximate Quasiperiodicity Under Hamming and Edit Distance. Algorithmica 84 (3) (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, Huiping Chen, Peter Christen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski
Pattern Masking for Dictionary Matching. ISAAC (2021)
Patryk Czajka, Jakub Radoszewski
Experimental evaluation of algorithms for computing quasiperiods. Theor. Comput. Sci. 854 (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)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski
Faster Algorithms for Longest Common Substring. CoRR (2021)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski
Faster Algorithms for Longest Common Substring. ESA (2021)
Shmuel T. Klein, Jakub Radoszewski, Tamar C. Serebro, Dana Shapira
Optimal skeleton and reduced Huffman trees. Theor. Comput. Sci. 852 (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)
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 (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)
Aleksander Kedzierski, Jakub Radoszewski
k-Approximate Quasiperiodicity under Hamming and Edit Distance. CPM (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)
Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya
Approximating Longest Common Substring with k mismatches: Theory and Practice. CPM (2020)
Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski
Dynamic and Internal Longest Common Substring. Algorithmica 82 (12) (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, Huiping Chen, Peter Christen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski
Pattern Masking for Dictionary Matching. CoRR (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)
Jakub Radoszewski, Juliusz Straszynski
Efficient Computation of 2-Covers of a String. ESA (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)
Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya
Approximating longest common substring with $k$ mismatches: Theory and practice. CoRR (2020)
Aleksander Kedzierski, Jakub Radoszewski
k-Approximate Quasiperiodicity under Hamming and Edit Distance. CoRR (2020)
Jakub Radoszewski, Tatiana Starikovskaya
-mismatch with error correcting and applications. Inf. Comput. 271 (2020)
Carl Barton, Tomasz Kociumaka, Chang Liu, Solon P. Pissis, Jakub Radoszewski
Indexing weighted sequences: Neat and efficient. Inf. Comput. 270 (2020)
Pawel Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Universal reconstruction of a string. Theor. Comput. Sci. 812 (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)
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 (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)
Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski
Longest Common Substring Made Fully Dynamic. ESA (2019)
Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski
On-line weighted pattern matching. Inf. Comput. 266 (2019)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Internal Dictionary Matching. CoRR (2019)
Patryk Czajka, Jakub Radoszewski
Experimental Evaluation of Algorithms for Computing Quasiperiods. CoRR (2019)
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)
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)
Pawel Gawrychowski, Jakub Radoszewski, Tatiana Starikovskaya
Quasi-Periodicity in Streams. CPM (2019)
Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski
Pattern Matching and Consensus Problems on Weighted Sequences and Profiles. Theory Comput. Syst. 63 (3) (2019)
Maxime Crochemore, Jakub Radoszewski
Special issue in honor of the 70th birthday of Prof. Wojciech Rytter. Theor. Comput. Sci. 792 (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, Tatiana Starikovskaya
Longest Common Substring with Approximately k Mismatches. Algorithmica 81 (6) (2019)
Jakub Radoszewski
Pattern Matching on Weighted Strings. Stringology (2019)
Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya
Correction to: Longest Common Substring with Approximately k Mismatches. Algorithmica 81 (7) (2019)
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Efficient Representation and Counting of Antipower Factors in Words. LATA (2019)
Szymon Grabowski, Tomasz Kociumaka, Jakub Radoszewski
On Abelian Longest Common Factor with and without RLE. CoRR (2018)
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)
Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Jakub Radoszewski
Palindromic Decompositions with Gaps and Errors. Int. J. Found. Comput. Sci. 29 (8) (2018)
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Faster Recovery of Approximate Periods over Edit Distance. CoRR (2018)
Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski
Efficient Computation of Sequence Mappability. SPIRE (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)
Szymon Grabowski, Tomasz Kociumaka, Jakub Radoszewski
On Abelian Longest Common Factor with and without RLE. Fundam. Informaticae 163 (3) (2018)
Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski
Longest Common Factor Made Fully Dynamic. 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)
Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski
Efficient Computation of Sequence Mappability. CoRR (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)
Jakub Radoszewski, Tatiana Starikovskaya
Streaming K-Mismatch with Error Correcting and Applications. DCC (2017)
Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski, Wing-Kin Sung
Faster algorithms for 1-mappability of a sequence. CoRR (2017)
Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Jakub Radoszewski
Palindromic Decompositions with Gaps and Errors. CSR (2017)
Amihood Amir, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski
Longest Common Factor After One Edit Operation. SPIRE (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)
Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Jakub Radoszewski
Palindromic Decompositions with Gaps and Errors. CoRR (2017)
Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya
Longest common substring with approximately k mismatches. CoRR (2017)

Jakub Radoszewski.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jakub Radoszewski