Publikacje

Czasopismo: J. Comput. Syst. Sci.

Liczba publikacji: 22

2025

• Piotr Faliszewski, Piotr Skowron , Arkadii Slinko, Krzysztof Sornat, Stanisław Szufa, Nimrod Talmon, How similar are two elections?, J. Comput. Syst. Sci., 2025. Zobacz w PBN
• Wojciech Czerwiński , Maciej Dębski, Tomasz Gogacz , Gordon Hoi, Sanjay Jain, Michał Skrzypczak , Frank Stephan, Christopher Tan, Languages given by finite automata over the unary alphabet, J. Comput. Syst. Sci., 151 2025, s. 103634. Zobacz w PBN
• Bart M.P. Jansen, Jari J.H. de Kroon, Michał Włodarczyk , Single-exponential FPT algorithms for enumerating secluded F-free subgraphs and deleting to scattered graph classes, J. Comput. Syst. Sci., 148 2025, s. 103597. Zobacz w PBN

2022

• Łukasz Kowalik , Shaohua Li, Wojciech Nadara , Marcin Smulewicz, Magnus Wahlström, Many-visits TSP revisited, J. Comput. Syst. Sci., 124 2022, s. 112-128. Zobacz w PBN
• Panagiotis Charalampopoulos, Adam Karczmarz , Single-source shortest paths and strong connectivity in dynamic planar graphs, J. Comput. Syst. Sci., 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, J. Comput. Syst. Sci., 115 2021, s. 73-85. Zobacz w PBN
• Sławomir Lasota , Lorenzo Clemente , Reachability relations of timed pushdown automata, J. Comput. Syst. Sci., 117 2021, s. 202-241. Zobacz w PBN
• Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Guillermo A., James Worrell, Filip Mazowiecki , When are emptiness and containment decidable for probabilistic automata?, J. Comput. Syst. Sci., 119 2021, s. 78--96. Zobacz w PBN

2019

• Cristian Riveros, Filip Mazowiecki , Copyless cost-register automata: Structure, expressiveness, and closure properties, J. Comput. Syst. Sci., 100 2019, s. 1-29. Zobacz w PBN
• Jakub Gajarský , Petr Hliněný, Martin Koutecký, Shmuel Onn, Parameterized shifted combinatorial optimization, J. Comput. Syst. Sci., 99 2019, s. 53-71. Zobacz w PBN

2017

• Tomasz Gogacz , Jerzy Marcinkowski, Converging to the chase : a tool for finite controllability, J. Comput. Syst. Sci., 83 (1) 2017, s. 180-206. Zobacz w PBN
• Wojciech Czerwiński , Claire David, Katja Losemann, Wim Martens, Deciding definability by deterministic regular expressions, J. Comput. Syst. Sci., 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, J. Comput. Syst. Sci., 84 2017, s. 205-218. Zobacz w PBN
• Marcin Wrochna , Reconfiguration in bounded bandwidth and tree-depth, J. Comput. Syst. Sci., 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, J. Comput. Syst. Sci., 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, J. Comput. Syst. Sci., 2014. Zobacz w PBN

2013

• Mikołaj Bojańczyk , Leszek Kołodziejczyk , Filip Murlak , Solutions in XML data exchange, J. Comput. Syst. Sci., 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, J. Comput. Syst. Sci., 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, J. Comput. Syst. Sci., 2012. Zobacz w PBN

2010

• Carole A. Goble, Jan Hidders, Paolo Missier, Jacek Sroka , A formal semantics for the Taverna 2 workflow model, J. Comput. Syst. Sci., 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, J. Comput. Syst. Sci., 2002. Zobacz w PBN
• P. Berman, M. Karpinski, L. Larmore, Wojciech Plandowski , The complexity of pattern matching of highly compressed two-dimensional texts, J. Comput. Syst. Sci., 2002. Zobacz w PBN