Efficient Seeds Computation Revisited. - Michalis Christou; Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Bartosz Szreder; Tomasz Walen (CPM, 2011)

Computing Maximum Hamiltonian Paths in Complete Graphs with Tree Metric. - Wojciech Rytter; Bartosz Szreder (FUN, 2012)

Efficient seed computation revisited. - Michalis Christou; Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Bartosz Szreder; Tomasz Walen (Theor. Comput. Sci., 2013)

A note on the longest common compatible prefix problem for partial words. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Marcin Kubica 001; Alessio Langiu; Jakub Radoszewski; Wojciech Rytter; Bartosz Szreder; Tomasz Walen (J. Discrete Algorithms, 2015)