| Efficient representation and counting of antipower factors in words T Kociumaka, J Radoszewski, W Rytter, J Straszyński, T Waleń, W Zuba International Conference on Language and Automata Theory and Applications …, 2019 | 15 | 2019 |
| Circular pattern matching with k mismatches P Charalampopoulos, T Kociumaka, SP Pissis, J Radoszewski, W Rytter, ... Journal of Computer and System Sciences 115, 73-85, 2021 | 14 | 2021 |
| A lower bound for the coverability problem in acyclic pushdown VAS M Englert, P Hofman, S Lasota, R Lazić, J Leroux, J Straszyński Information Processing Letters 167, 106079, 2021 | 13 | 2021 |
| Counting distinct patterns in internal dictionary matching P Charalampopoulos, T Kociumaka, M Mohamed, J Radoszewski, ... arXiv preprint arXiv:2005.05681, 2020 | 11 | 2020 |
| Internal quasiperiod queries M Crochemore, CS Iliopoulos, J Radoszewski, W Rytter, J Straszyński, ... International Symposium on String Processing and Information Retrieval, 60-75, 2020 | 9 | 2020 |
| Quasi-linear-time algorithm for longest common circular factor M Alzamel, M Crochemore, CS Iliopoulos, T Kociumaka, J Radoszewski, ... arXiv preprint arXiv:1901.11305, 2019 | 9 | 2019 |
| Efficient computation of sequence mappability M Alzamel, P Charalampopoulos, CS Iliopoulos, T Kociumaka, SP Pissis, ... International Symposium on String Processing and Information Retrieval, 12-26, 2018 | 7 | 2018 |
| Shortest covers of all cyclic shifts of a string M Crochemore, CS Iliopoulos, J Radoszewski, W Rytter, J Straszyński, ... Theoretical Computer Science 866, 70-81, 2021 | 6 | 2021 |
| Efficient computation of 2-covers of a string J Radoszewski, J Straszyński 28th Annual European Symposium on Algorithms (ESA 2020), 77: 1-77: 17, 2020 | 5 | 2020 |
| Faster recovery of approximate periods over edit distance T Kociumaka, J Radoszewski, W Rytter, J Straszyński, T Waleń, W Zuba International Symposium on String Processing and Information Retrieval, 233-240, 2018 | 5 | 2018 |
| String covers of a tree J Radoszewski, W Rytter, J Straszyński, T Waleń, W Zuba String Processing and Information Retrieval: 28th International Symposium …, 2021 | 4 | 2021 |
| Efficient representation and counting of antipower factors in words T Kociumaka, J Radoszewski, W Rytter, J Straszyński, T Waleń, W Zuba Information and Computation 286, 104779, 2022 | 3 | 2022 |
| Hardness of detecting abelian and additive square factors in strings J Radoszewski, W Rytter, J Straszyński, T Waleń, W Zuba arXiv preprint arXiv:2107.09206, 2021 | 3 | 2021 |
| Linear-time computation of shortest covers of all rotations of a string M Crochemore, CS Iliopoulos, J Radoszewski, W Rytter, J Straszyński, ... 33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022), 22: 1-22: 15, 2022 | 2 | 2022 |
| Weighted shortest common supersequence problem revisited P Charalampopoulos, T Kociumaka, SP Pissis, J Radoszewski, W Rytter, ... International Symposium on String Processing and Information Retrieval, 221-238, 2019 | 2 | 2019 |
| Efficient representation and counting of antipower factors in words T Kociumaka, J Radoszewski, W Rytter, J Straszyński, T Waleń, W Zuba arXiv preprint arXiv:1812.08101, 2018 | 2 | 2018 |
| Rectangular Tile Covers of 2D-Strings J Radoszewski, W Rytter, J Straszyński, T Waleń, W Zuba 33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022), 23: 1-23: 14, 2022 | 1 | 2022 |
| Efficient Computation of Sequence Mappability P Charalampopoulos, CS Iliopoulos, T Kociumaka, SP Pissis, ... Algorithmica 84 (5), 1418-1440, 2022 | | 2022 |
| Exact Covers and Pattern Matching with Mismatches J Straszyński University of Warsaw Poland, 2022 | | 2022 |
| 31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020) T Husfeldt, M Alzamel, A Conte, S Denzumi, R Grossi, CS Iliopoulos, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2020 | | 2020 |
