| Faster deterministic feedback vertex set T Kociumaka, M Pilipczuk Information Processing Letters 114 (10), 556-560, 2014 | 72 | 2014 |
| Order-preserving indexing M Crochemore, CS Iliopoulos, T Kociumaka, M Kubica, A Langiu, ... Theoretical Computer Science 638, 122-135, 2016 | 56* | 2016 |
| Efficient indexes for jumbled pattern matching with constant-sized alphabet T Kociumaka, J Radoszewski, W Rytter Algorithmica 77 (4), 1194-1215, 2017 | 32* | 2017 |
| A fast branching algorithm for cluster vertex deletion A Boral, M Cygan, T Kociumaka, M Pilipczuk Theory of Computing Systems 58 (2), 357-376, 2016 | 31 | 2016 |
| Wavelet trees meet suffix trees M Babenko, P Gawrychowski, T Kociumaka, T Starikovskaya Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2015 | 30 | 2015 |
| Efficient data structures for the factor periodicity problem T Kociumaka, J Radoszewski, W Rytter, T Waleń International Symposium on String Processing and Information Retrieval, 284-294, 2012 | 29 | 2012 |
| A linear time algorithm for seeds computation T Kociumaka, M Kubica, J Radoszewski, W Rytter, T Waleń Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 29 | 2012 |
| Internal pattern matching queries in a text and applications T Kociumaka, J Radoszewski, W Rytter, T Waleń Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2015 | 28 | 2015 |
| Approximating LZ77 via small-space multiple-pattern matching J Fischer, T Gagie, P Gawrychowski, T Kociumaka Algorithms-ESA 2015, 533-544, 2015 | 28 | 2015 |
| Fast algorithms for abelian periods in words and greatest common divisor queries T Kociumaka, J Radoszewski, W Rytter Journal of Computer and System Sciences 84, 205-218, 2017 | 23* | 2017 |
| Enhanced string covering T Flouri, CS Iliopoulos, T Kociumaka, SP Pissis, SJ Puglisi, WF Smyth, ... Theoretical Computer Science 506, 102-114, 2013 | 22 | 2013 |
| A note on efficient computation of all Abelian periods in a string M Crochemore, CS Iliopoulos, T Kociumaka, M Kubica, J Pachocki, ... Information Processing Letters 113 (3), 74-77, 2013 | 20 | 2013 |
| Efficient index for weighted sequences C Barton, T Kociumaka, SP Pissis, J Radoszewski 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 4:1--4:13, 2016 | 18 | 2016 |
| Pattern matching and consensus problems on weighted sequences and profiles T Kociumaka, SP Pissis, J Radoszewski 27th International Symposium on Algorithms and Computation (ISAAC 2016), 46 …, 2016 | 17 | 2016 |
| Faster longest common extension queries in strings over general alphabets P Gawrychowski, T Kociumaka, W Rytter, T Waleń 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 5:1-5:13, 2016 | 17 | 2016 |
| Optimal dynamic strings P Gawrychowski, A Karczmarz, T Kociumaka, J Łącki, P Sankowski Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 15 | 2018 |
| Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence T Kociumaka, J Radoszewski, W Rytter SIAM Journal on Discrete Mathematics 30 (4), 2027-2046, 2016 | 15* | 2016 |
| Fast algorithm for partial covers in words T Kociumaka, SP Pissis, J Radoszewski, W Rytter, T Waleń Algorithmica 73 (1), 217-233, 2015 | 15 | 2015 |
| Sublinear space algorithms for the longest common substring problem T Kociumaka, T Starikovskaya, HW Vildhøj European Symposium on Algorithms, 605-617, 2014 | 15 | 2014 |
| Linear search by a pair of distinct-speed robots E Bampas, J Czyzowicz, L Gąsieniec, D Ilcinkas, R Klasing, T Kociumaka, ... Algorithmica 81 (1), 317-342, 2019 | 14 | 2019 |
Jakub RadoszewskiUniversity of WarsawVerified email at mimuw.edu.pl
