Publikacje

Czasopismo: Journal Of Computer And System Sciences

Liczba publikacji: 11

2017

• Tomasz Kociumaka, Jakub Radoszewski i Wojciech Rytter, Fast algorithms for Abelian periods in words and greatest common divisor queries, Journal Of Computer And System Sciences 84 2017, s. 205–218.zobacz w PBN
• Wojciech Czerwiński, Claire David, Katja Losemann i Wim Martens, Deciding definability by deterministic regular expressions, Journal Of Computer And System Sciences 88 2017, s. 75–89.zobacz w PBN
• Marcin Wrochna, Reconfiguration in bounded bandwidth and tree-depth, Journal Of Computer And System Sciences 93 2017, s. 1–10.zobacz w PBN

2014

• Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk i Yngve Villanger, Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters, Journal Of Computer And System Sciences 80 (7) 2014, s. 1430–1447.zobacz w PBN
• Cristina Bazgan, Morgan Chopin, Marek Adam Cygan, Michael R. Fellows, Fedor V. Fomin i Erik Jan van Leeuwen, Parameterized complexity of firefighting, Journal Of Computer And System Sciences 80 (7) 2014, s. 1285–1297.zobacz w PBN

2013

• Mikołaj Bojańczyk, Leszek Aleksander Kołodziejczyk i Filip Murlak, Solutions in XML data exchange, Journal Of Computer And System Sciences 79 (6) 2013, s. 785–815.zobacz w PBN

2012

• Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, The maximal number of cubic runs in a word, Journal Of Computer And System Sciences 78 (6) 2012, s. 1828–1836.zobacz w PBN
• Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, On the Maximal Number of Cubic Runs in a String, Journal Of Computer And System Sciences 78 (6) 2012, s. 1828–1836.zobacz w PBN

2010

• Jacek Sroka, Jan Hidders, Paolo Missier i Carole A. Goble, A formal semantics for the Taverna 2 workflow model, Journal Of Computer And System Sciences 76 (6) 2010, s. 490–508.zobacz w PBN

2002

• Wojciech Plandowski, P. Berman, M. Karpinski i L. Larmore, The complexity of pattern matching of highly compressed two-dimensional texts, Journal Of Computer And System Sciences 65 (2) 2002, s. 332–350.zobacz w PBN
• Piotr Berman, Marek Karpinski, Lawrence Larmore, Wojciech Plandowski i Wojciech Rytter, On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts, Journal Of Computer And System Sciences 65 (2) 2002, s. 332–350.zobacz w PBN