Bartosz Szreder

According to our database, Bartosz Szreder authored at least 4 papers between 2011 and 2015.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2015

A note on the longest common compatible prefix problem for partial words.

Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen

J. Discrete Algorithms, 2015

2013

Efficient seed computation revisited.

Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen

Theor. Comput. Sci., 2013

2012

Computing Maximum Hamiltonian Paths in Complete Graphs with Tree Metric.

Wojciech Rytter, Bartosz Szreder

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

2011

Efficient Seeds Computation Revisited.

Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen

Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011