Publications

Journal: Journal Of Discrete Algorithms

Number of publications: 8

2016

• Jakub Jan Radoszewski and Tomasz Radzik, 2015 London Stringology Days and London Algorithmic Workshop (LSD & LAW), Journal Of Discrete Algorithms 37 2016, p. 1–2.see in PBN

2015

• Maxime Crochemore, Costas Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder and Tomasz Waleń, A note on the longest common compatible prefix problem for partial words, Journal Of Discrete Algorithms 34 2015, p. 49–53.see in PBN

2013

• Zbigniew Adamczyk and Wojciech Rytter, A note on a simple computation of the maximal suffix of a string, Journal Of Discrete Algorithms 20 (Complete) 2013, p. 61–64.see in PBN

2012

• Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter and Tomasz Waleń, Efficient algorithms for three variants of the LPF table, Journal Of Discrete Algorithms 11 2012, p. 51–61.see in PBN
• Maxime Crochemore, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, On the maximal sum of exponents of runs in a string, Journal Of Discrete Algorithms 14 2012, p. 29–36.see in PBN
• Jakub Radoszewski and Wojciech Rytter, On the structure of compacted subword graphs of Thue-Morse words and their applications, Journal Of Discrete Algorithms 11 2012, p. 15–24.see in PBN

2011

• Marcin Kubica, Romeo Rizzi, Stephane Vialette and Tomasz Waleń, Approximation of RNA multiple structural alignment, Journal Of Discrete Algorithms 9 (4) 2011, p. 365–376.see in PBN
• Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith and Jakub Wojtaszczyk, Breaking the 2^n-barrier for Irredundance: Two lines of attack, Journal Of Discrete Algorithms 9 (3) 2011, p. 214–230.see in PBN