A linear time algorithm for consecutive permutation pattern matching M Kubica, T Kulczyński, J Radoszewski, W Rytter, T Waleń Information Processing Letters 113 (12), 430-433, 2013 | 126 | 2013 |

Extracting powers and periods in a word from its runs structure M Crochemore, CS Iliopoulos, M Kubica, J Radoszewski, W Rytter, ... Theoretical Computer Science 521, 29-41, 2014 | 91* | 2014 |

Order-preserving incomplete suffix trees and order-preserving indexes M Crochemore, CS Iliopoulos, T Kociumaka, M Kubica, A Langiu, ... String Processing and Information Retrieval: 20th International Symposium …, 2013 | 55 | 2013 |

Improved algorithms for the range next value problem and applications M Crochemore, CS Iliopoulos, M Kubica, MS Rahman, G Tischler, ... Theoretical Computer Science 434, 23-34, 2012 | 55* | 2012 |

Efficient algorithms for three variants of the LPF table M Crochemore, CS Iliopoulos, M Kubica, W Rytter, T Waleń Journal of Discrete Algorithms 11, 51-61, 2012 | 53* | 2012 |

Order-preserving indexing M Crochemore, CS Iliopoulos, T Kociumaka, M Kubica, A Langiu, ... Theoretical Computer Science 638, 122-135, 2016 | 44 | 2016 |

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 | 44 | 2012 |

LPF computation revisited M Crochemore, L Ilie, CS Iliopoulos, M Kubica, W Rytter, T Waleń Combinatorial Algorithms: 20th International Workshop, IWOCA 2009, Hradec …, 2009 | 40 | 2009 |

A formal approach to computer systems requirements documentation M Engel, M Kubica, J Madey, DL Parnas, AP Ravn, AJ van Schouwen International Hybrid Systems Workshop, 452-474, 1991 | 36 | 1991 |

Efficient seed computation revisited M Christou, M Crochemore, CS Iliopoulos, M Kubica, SP Pissis, ... Theoretical Computer Science 483, 171-181, 2013 | 35 | 2013 |

Computing the longest previous factor M Crochemore, L Ilie, CS Iliopoulos, M Kubica, W Rytter, T Waleń European Journal of Combinatorics 34 (1), 15-26, 2013 | 35 | 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 | 29 | 2013 |

On the Maximal Sum of Exponents of Runs in a String M Crochemore, M Kubica, J Radoszewski, W Rytter, T Waleń Combinatorial Algorithms, 10-19, 2011 | 26 | 2011 |

The maximal number of cubic runs in a word M Crochemore, CS Iliopoulos, M Kubica, J Radoszewski, W Rytter, ... Journal of Computer and System Sciences 78 (6), 1828-1836, 2012 | 25 | 2012 |

Algorithms for computing the longest parameterized common subsequence CS Iliopoulos, M Kubica, MS Rahman, T Waleń Combinatorial Pattern Matching: 18th Annual Symposium, CPM 2007, London …, 2007 | 23 | 2007 |

A linear-time algorithm for seeds computation T Kociumaka, M Kubica, J Radoszewski, W Rytter, T Waleń ACM Transactions on Algorithms (TALG) 16 (2), 1-23, 2020 | 22 | 2020 |

The maximum number of squares in a tree M Crochemore, CS Iliopoulos, T Kociumaka, M Kubica, J Radoszewski, ... Annual Symposium on Combinatorial Pattern Matching, 27-40, 2012 | 20 | 2012 |

Algorithms without Programming. M Kubica, J Radoszewski Olympiads in Informatics 4, 2010 | 20 | 2010 |

Polish olympiad in informatics–14 years of experience K Diks, M Kubica, K Stencel Olympiads in Informatics 1 (1), 50-56, 2007 | 20 | 2007 |

RNA multiple structural alignment with longest common subsequences S Bereg, M Kubica, T Waleń, B Zhu Journal of Combinatorial Optimization 13, 179-188, 2007 | 17 | 2007 |