Powrót do listy instytutów
Publikacje
Czasopismo: Journal of Computer and System Sciences
Liczba publikacji: 182022
- Łukasz Kowalik , Shaohua Li, Wojciech Nadara , Marcin Smulewicz, Magnus Wahlström, Many-visits TSP revisited, Journal of Computer and System Sciences, 124 2022, s. 112-128. Zobacz w PBN
- Panagiotis Charalampopoulos, Adam Karczmarz , Single-source shortest paths and strong connectivity in dynamic planar graphs, Journal of Computer and System Sciences, 124 2022, s. 97-111. Zobacz w PBN
2021
- Tomasz Kociumaka, Solon P. Pissis, Wojciech Rytter , Tomasz Waleń , Jakub Radoszewski , Juliusz Straszyński , Wiktor Zuba, Panagiotis Charalampopoulos, Circular pattern matching with k mismatches, Journal of Computer and System Sciences, 115 2021, s. 73-85. Zobacz w PBN
- Sławomir Lasota , Lorenzo Clemente , Reachability relations of timed pushdown automata, Journal of Computer and System Sciences, 117 2021, s. 202-241. Zobacz w PBN
2020
- Paweł Rzążewski , Karolina Okrasa, Subexponential algorithms for variants of the homomorphism problem in string graphs, Journal of Computer and System Sciences, 109 2020, s. 126-144. Zobacz w PBN
2019
- Jakub Gajarský , Petr Hliněný, Martin Koutecký, Shmuel Onn, Parameterized shifted combinatorial optimization, Journal of Computer and System Sciences, 99 2019, s. 53-71. Zobacz w PBN
2017
- Tomasz Gogacz , Jerzy Marcinkowski, Converging to the chase : a tool for finite controllability, Journal of Computer and System Sciences, 83 (1) 2017, s. 180-206. Zobacz w PBN
- Wojciech Czerwiński , Claire David, Katja Losemann, Wim Martens, Deciding definability by deterministic regular expressions, Journal of Computer and System Sciences, 88 2017, s. 75-89. Zobacz w PBN
- Tomasz Kociumaka, Jakub Radoszewski , 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
- Marcin Wrochna , Reconfiguration in bounded bandwidth and tree-depth, Journal of Computer and System Sciences, 93 2017, s. 1-10. Zobacz w PBN
2014
- Cristina Bazgan, Morgan Chopin, Marek Cygan , Michael R. Fellows, Fedor V. Fomin, Erik Jan van Leeuwen, Parameterized complexity of firefighting, Journal of Computer and System Sciences, 2014. Zobacz w PBN
- Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk , Michał Pilipczuk , Yngve Villanger, Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters, Journal of Computer and System Sciences, 2014. Zobacz w PBN
2013
- Mikołaj Bojańczyk , Leszek Kołodziejczyk , 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 Iliopoulos, Marcin Kubica, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , On the Maximal Number of Cubic Runs in a String, Journal of Computer and System Sciences, 2012. Zobacz w PBN
- Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , The maximal number of cubic runs in a word, Journal of Computer and System Sciences, 2012. Zobacz w PBN
2010
- Carole A. Goble, Jan Hidders, Paolo Missier, Jacek Sroka , A formal semantics for the Taverna 2 workflow model, Journal of Computer and System Sciences, 2010. Zobacz w PBN
2002
- Piotr Berman, Marek Karpinski, Lawrence Larmore, Wojciech Plandowski , Wojciech Rytter , On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts, Journal of Computer and System Sciences, 2002. Zobacz w PBN
- P. Berman, M. Karpinski, L. Larmore, Wojciech Plandowski , The complexity of pattern matching of highly compressed two-dimensional texts, Journal of Computer and System Sciences, 2002. Zobacz w PBN