Publikacje

Czasopismo: European Journal of Combinatorics

2025

• Patrice Ossona de Mendez, Michał Pilipczuk , Sebastian Siebertz, Transducing paths in graph classes with unbounded shrubdepth, European Journal of Combinatorics, 123 2025, s. 103660. Zobacz w PBN

2021

• Michał Pilipczuk , Sebastian Siebertz, Kernelization and approximation of distance-r independent sets on nowhere dense graphs, European Journal of Combinatorics, 94 2021, s. 103309,1-19. Zobacz w PBN

2020

• O-joung Kwon, Michał Pilipczuk , Sebastian Siebertz, On low rank-width colorings, European Journal of Combinatorics, 83 2020. Zobacz w PBN
• Tomasz Krawczyk, Bartłomiej Bosek , On-line partitioning of width $w$ posets into $w^{O(log log w)}$ chains, European Journal of Combinatorics, 91 2020. Zobacz w PBN

2017

• Michał Dębski, Zbigniew Lonc, Paweł Rzążewski , Harmonious and achromatic colorings of fragmentable hypergraphs, European Journal of Combinatorics, 66 2017, s. 60-80. Zobacz w PBN

2016

• Tatjana V. Abramovskaya, Fedor V. Fomin, Petr A. Golovach, Michał Pilipczuk , How to hunt an invisible rabbit on a graph, European Journal of Combinatorics, 2016. Zobacz w PBN

2013

• Marcin Kubica, Tomasz Waleń , Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Wojciech Rytter , Computing the Longest Previous Factor, European Journal of Combinatorics, 34 (1) 2013, s. 15-26. Zobacz w PBN
• Wojciech Rytter , On the maximum number of cubic subwords in a word., European Journal of Combinatorics, 34 (1) 2013, s. 27-37. Zobacz w PBN

1998

• Mariusz Skałba , On the relative Davenport constant, European Journal of Combinatorics, 1998. Zobacz w PBN