Jakub Radoszewski
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
80
Venues
19
Active years
2009–2026
Best venue rank
A*
Where they publish
Papers
80 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | CPM | Improved Bounds on the Maximum Number of Distinct Squares in Circular Words. | Panagiotis Charalampopoulos, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2026 | FUN | Sorting Magazines and Boxes. | Gabriele Fici, Manal Mohamed, Jakub Radoszewski |
| 2026 | SODA | Space-Efficient k-Mismatch Text Indexes. | Tomasz Kociumaka, Jakub Radoszewski |
| 2025 | CPM | Faster Approximate Elastic-Degenerate String Matching - Part A. | Solon P. Pissis, Jakub Radoszewski, Wiktor Zuba |
| 2025 | ESA | Fast Computation of k-Runs, Parameterized Squares, and Other Generalised Squares. | Yuto Nakashima, Jakub Radoszewski, Tomasz Walen |
| 2025 | MFCS | Counting Distinct Square Substrings in Sublinear Time. | Panagiotis Charalampopoulos, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2024 | CPM | Maintaining the Size of LZ77 on Semi-Dynamic Strings. | Hideo Bannai, Panagiotis Charalampopoulos, Jakub Radoszewski |
| 2024 | STACS | Approximate Circular Pattern Matching Under Edit Distance. | Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2024 | SPIRE | Faster Algorithms for Ranking/Unranking Bordered and Unbordered Words. | Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2024 | SPIRE | Computing String Covers in Sublinear Time. | Jakub Radoszewski, Wiktor Zuba |
| 2023 | CPM | Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and Applications. | Estban Gabory, Njagi Moses Mwaniki, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski, Michelle Sweering, Wiktor Zuba |
| 2023 | CPM | Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String. | Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2023 | ESA | Linear Time Construction of Cover Suffix Tree and Applications. | Jakub Radoszewski |
| 2022 | CPM | Longest Palindromic Substring in Sublinear Time. | Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski |
| 2022 | CPM | Linear-Time Computation of Shortest Covers of All Rotations of a String. | Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2022 | CPM | Rectangular Tile Covers of 2D-Strings. | Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2022 | ESA | Approximate Circular Pattern Matching. | Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Solon P. Pissis, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2022 | SPIRE | Subsequence Covers of Words. | Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2021 | CPM | Computing Covers of 2D-Strings. | Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2021 | ESA | Faster Algorithms for Longest Common Substring. | Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski |
| 2021 | ESA | Hardness of Detecting Abelian and Additive Square Factors in Strings. | Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2021 | ISAAC | Pattern Masking for Dictionary Matching. | Panagiotis Charalampopoulos, Huiping Chen, Peter Christen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski |
| 2021 | SPIRE | String Covers of a Tree. | Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2020 | CPM | Counting Distinct Patterns in Internal Dictionary Matching. | Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2020 | CPM | Unary Words Have the Smallest Levenshtein k-Neighbourhoods. | Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Tomasz Walen, Wiktor Zuba |
| 2020 | CPM | Approximating Longest Common Substring with k mismatches: Theory and Practice. | Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya |
| 2020 | CPM | k-Approximate Quasiperiodicity under Hamming and Edit Distance. | Aleksander Kedzierski, Jakub Radoszewski |
| 2020 | ESA | The Number of Repetitions in 2D-Strings. | Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2020 | ESA | Efficient Computation of 2-Covers of a String. | Jakub Radoszewski, Juliusz Straszynski |
| 2020 | SPIRE | Efficient Enumeration of Distinct Factors Using Package Representations. | Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2020 | SPIRE | Internal Quasiperiod Queries. | Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2020 | WALCOM | Shortest Covers of All Cyclic Shifts of a String. | Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2019 | CPM | Quasi-Linear-Time Algorithm for Longest Common Circular Factor. | Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2019 | CPM | Quasi-Periodicity in Streams. | Pawel Gawrychowski, Jakub Radoszewski, Tatiana Starikovskaya |
| 2019 | ESA | Longest Common Substring Made Fully Dynamic. | Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski |
| 2019 | FCT | Circular Pattern Matching with k Mismatches. | Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2019 | ISAAC | Internal Dictionary Matching. | Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2019 | LATA | Efficient Representation and Counting of Antipower Factors in Words. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2019 | SPIRE | Weighted Shortest Common Supersequence Problem Revisited. | Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2018 | CPM | Linear-Time Algorithm for Long LCF with k Mismatches. | Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2018 | LATA | On Periodicity Lemma for Partial Words. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2018 | STACS | String Periods in the Order-Preserving Model. | Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen |
| 2018 | SPIRE | Efficient Computation of Sequence Mappability. | Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski |
| 2018 | SPIRE | Faster Recovery of Approximate Periods over Edit Distance. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2017 | COCOA | Faster Algorithms for 1-Mappability of a Sequence. | Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski, Wing-Kin Sung |
| 2017 | COCOON | Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes. | Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2017 | CSR | Palindromic Decompositions with Gaps and Errors. | Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Jakub Radoszewski |
| 2017 | DCC | Streaming K-Mismatch with Error Correcting and Applications. | Jakub Radoszewski, Tatiana Starikovskaya |
| 2017 | SPIRE | Longest Common Factor After One Edit Operation. | Amihood Amir, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski |
| 2016 | CPM | Efficient Index for Weighted Sequences. | Carl Barton, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski |
| 2016 | CPM | Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties. | Costas S. Iliopoulos, Jakub Radoszewski |
| 2016 | ISAAC | Pattern Matching and Consensus Problems on Weighted Sequences and Profiles. | Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski |
| 2016 | SPIRE | Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. | Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2015 | CPM | String Powers in Trees. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2015 | SODA | Internal Pattern Matching Queries in a Text and Applications. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2015 | SPIRE | Efficient Algorithms for Longest Closed Factor Array. | Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto, Tomasz Walen |
| 2015 | WADS | Universal Reconstruction of a String. | Pawel Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2014 | CPM | Efficient Algorithms for Shortest Partial Seeds in Words. | Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2014 | CPM | Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter |
| 2014 | DLT | Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2014 | ISAAC | Covering Problems for Partial Words and for Indeterminate Strings. | Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2014 | SPIRE | On the String Consensus Problem and the Manhattan Sequence Consensus Problem. | Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2013 | CPM | Fast Algorithm for Partial Covers in Words. | Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2013 | ESA | Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter |
| 2013 | LATA | Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2013 | STACS | Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter |
| 2013 | SPIRE | Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes. | Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2012 | CPM | The Maximum Number of Squares in a Tree. | Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen |
| 2012 | ISAAC | Efficient Counting of Square Substrings in a Tree. | Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2012 | SODA | A linear time algorithm for seeds computation. | Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2012 | SPIRE | Efficient Data Structures for the Factor Periodicity Problem. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2011 | CPM | Efficient Seeds Computation Revisited. | Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen |
| 2011 | CPM | Polynomial-Time Approximation Algorithms for Weighted LCS Problem. | Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2011 | ISAAC | Hamiltonian Paths in the Square of a Tree. | Jakub Radoszewski, Wojciech Rytter |
| 2010 | CPM | Algorithms for Three Versions of the Shortest Common Superstring Problem. | Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2010 | IWOCA | On the Maximal Sum of Exponents of Runsin a String. | Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2010 | LATA | On the Maximal Number of Cubic Runs in a String. | Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2010 | SOFSEM | Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup. | Jakub Radoszewski, Wojciech Rytter |
| 2010 | SPIRE | Extracting Powers and Periods in a String from Its Runs Structure. | Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2009 | IWOCA | On the Maximal Number of Cubic Subwords in a String. | Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |