The Number of Runs in Sturmian Words. - Pawel Baturo; Marcin Piatkowski; Wojciech Rytter (CIAA, 2008)

Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words. - Pawel Baturo; Marcin Piatkowski; Wojciech Rytter (Int. J. Found. Comput. Sci., 2009)

Algorithmics of Posets Generated by Words over Partially Commutative Alphabets. - Lukasz Mikulski; Marcin Piatkowski; Sebastian Smyczynski (Stringology, 2011)

The Number of Cubes in Sturmian Words. - Marcin Piatkowski; Wojciech Rytter (Stringology, 2012)

Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words. - Marcin Piatkowski; Wojciech Rytter (Int. J. Found. Comput. Sci., 2012)

Lexicographical Generations of Combined Traces. - Lukasz Mikulski; Marcin Piatkowski; Sebastian Smyczynski (ACSD, 2013)

The Sum of Exponents of Maximal Repetitions in Standard Sturmian Words. - Marcin Piatkowski (Stringology, 2013)

The Maximal Number of Runs in Standard Sturmian Words. - Pawel Baturo; Marcin Piatkowski; Wojciech Rytter (Electron. J. Comb., 2013)

Algorithmics of Posets Generated by Words Over Partially Commutative Alphabets (Extended). - Lukasz Mikulski; Marcin Piatkowski; Sebastian Smyczynski (Sci. Ann. Comput. Sci., 2013)

Generating CA-Plans from Multisets of Services. - Lukasz Mikulski; Artur Niewiadomski 001; Marcin Piatkowski; Sebastian Smyczynski (PNSE @ Petri Nets, 2014)

On Generation of Context-Abstract Plans. - Lukasz Mikulski; Artur Niewiadomski 001; Marcin Piatkowski; Sebastian Smyczynski (SEFM Workshops, 2014)

Computing the number of cubic runs in standard Sturmian words. - Marcin Piatkowski; Wojciech Rytter (Discret. Appl. Math., 2014)

On Binary Words Being Petri Net Solvable. - Kamila Barylska; Eike Best; Evgeny Erofeev; Lukasz Mikulski; Marcin Piatkowski (ATAED@Petri Nets/ACSD, 2015)

Diverse Palindromic Factorization Is NP-complete. - Hideo Bannai; Travis Gagie; Shunsuke Inenaga; Juha Kärkkäinen; Dominik Kempa; Marcin Piatkowski; Simon J. Puglisi; Shiho Sugimoto (DLT, 2015)

Square-Free Words over Partially Commutative Alphabets. - Lukasz Mikulski; Marcin Piatkowski; Wojciech Rytter (LATA, 2015)

Diverse Palindromic Factorization is NP-Complete. - Travis Gagie; Shunsuke Inenaga; Juha Kärkkäinen; Dominik Kempa; Marcin Piatkowski; Simon J. Puglisi; Shiho Sugimoto (CoRR, 2015)

String Inference from the LCP Array. - Juha Kärkkäinen; Marcin Piatkowski; Simon J. Puglisi (CoRR, 2016)

Tighter bounds for the sum of irreducible LCP values. - Juha Kärkkäinen; Dominik Kempa; Marcin Piatkowski (Theor. Comput. Sci., 2016)

Conditions for Petri Net Solvable Binary Words. - Kamila Barylska; Eike Best; Evgeny Erofeev; Lukasz Mikulski; Marcin Piatkowski (Trans. Petri Nets Other Model. Concurr., 2016)

Reduction of Order Structures. - Lukasz Mikulski; Andrey Mokhov; Marcin Piatkowski (ACSD, 2017)

Reversing Computations Modelled by Coloured Petri Nets. - Kamila Barylska; Anna Gogolinska; Lukasz Mikulski; Anna Philippou; Marcin Piatkowski; Kyriaki Psara (ATAED@Petri Nets/ACSD, 2018)

Reversing Transitions in Bounded Petri Nets. - Kamila Barylska; Evgeny Erofeev; Maciej Koutny; Lukasz Mikulski; Marcin Piatkowski (Fundam. Informaticae, 2018)

Diverse Palindromic Factorization is NP-Complete. - Hideo Bannai; Travis Gagie; Shunsuke Inenaga; Juha Kärkkäinen; Dominik Kempa; Marcin Piatkowski; Shiho Sugimoto (Int. J. Found. Comput. Sci., 2018)

Reversible computation vs. reversibility in Petri nets. - Kamila Barylska; Maciej Koutny; Lukasz Mikulski; Marcin Piatkowski (Sci. Comput. Program., 2018)

GPU Computations and Memory Access Model Based on Petri Nets. - Anna Gogolinska; Lukasz Mikulski; Marcin Piatkowski (Trans. Petri Nets Other Model. Concurr., 2018)

Indexing the Bijective BWT. - Hideo Bannai; Juha Kärkkäinen; Dominik Köppl; Marcin Piatkowski (CPM, 2019)

Constructing the Bijective BWT. - Hideo Bannai; Juha Kärkkäinen; Dominik Köppl; Marcin Piatkowski (CoRR, 2019)

Generating all minimal petri net unsolvable binary words. - Evgeny Erofeev; Kamila Barylska; Lukasz Mikulski; Marcin Piatkowski (Discret. Appl. Math., 2020)

Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time. - Hideo Bannai; Juha Kärkkäinen; Dominik Köppl; Marcin Piatkowski (CPM, 2021)

Formal Translation from Reversing Petri Nets to Coloured Petri Nets. - Kamila Barylska; Anna Gogolinska; Lukasz Mikulski; Anna Philippou; Marcin Piatkowski; Kyriaki Psara (RC, 2022)

String inference from longest-common-prefix array. - Juha Kärkkäinen; Marcin Piatkowski; Simon J. Puglisi (Theor. Comput. Sci., 2023)

Constructing and indexing the bijective and extended Burrows-Wheeler transform. - Hideo Bannai; Juha Kärkkäinen; Dominik Köppl; Marcin Piatkowski (Inf. Comput., 2024)