Publikacje

Czasopismo: Journal of Discrete Algorithms

2016

• Jakub Radoszewski , Tomasz Radzik, 2015 London Stringology Days and London Algorithmic Workshop (LSD & LAW), Journal of Discrete Algorithms, 2016. Zobacz w PBN

2015

• Maxime Crochemore, Costas Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski , Wojciech Rytter , Bartosz Szreder, Tomasz Waleń , A note on the longest common compatible prefix problem for partial words, Journal of Discrete Algorithms, 2015. Zobacz w PBN

2013

• Zbigniew Adamczyk, Wojciech Rytter , A note on a simple computation of the maximal suffix of a string, Journal of Discrete Algorithms, 20 (Complete) 2013, s. 61-64. Zobacz w PBN

2012

• Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter , Tomasz Waleń , Efficient algorithms for three variants of the LPF table, Journal of Discrete Algorithms, 2012. Zobacz w PBN
• Maxime Crochemore, Marcin Kubica, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , On the maximal sum of exponents of runs in a string, Journal of Discrete Algorithms, 2012. Zobacz w PBN
• Jakub Radoszewski , Wojciech Rytter , On the structure of compacted subword graphs of Thue-Morse words and their applications, Journal of Discrete Algorithms, 2012. Zobacz w PBN

2011

• Marcin Kubica, Romeo Rizzi, Stephane Vialette, Tomasz Waleń , Approximation of RNA multiple structural alignment, Journal of Discrete Algorithms, 2011. Zobacz w PBN
• Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan , Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk , Peter Rossmanith, Jakub Wojtaszczyk, Breaking the 2^n-barrier for Irredundance: Two lines of attack, Journal of Discrete Algorithms, 2011. Zobacz w PBN