Kernelization lower bound for Permutation Pattern Matching. - Ivan Bliznets; Marek Cygan; Pawel Komosa; Lukás Mach (Inf. Process. Lett., 2015)

Hardness of Approximation for H-Free Edge Modification Problems. - Ivan Bliznets; Marek Cygan; Pawel Komosa; Michal Pilipczuk (APPROX-RANDOM, 2016)

Randomized contractions meet lean decompositions. - Marek Cygan; Pawel Komosa; Daniel Lokshtanov; Michal Pilipczuk; Marcin Pilipczuk; Saket Saurabh 001 (CoRR, 2018)

Hardness of Approximation for H-free Edge Modification Problems. - Ivan Bliznets; Marek Cygan; Pawel Komosa; Michal Pilipczuk (ACM Trans. Comput. Theory, 2018)

Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems. - Ivan Bliznets; Marek Cygan; Pawel Komosa; Michal Pilipczuk; Lukás Mach (ACM Trans. Algorithms, 2020)

Randomized Contractions Meet Lean Decompositions. - Marek Cygan; Pawel Komosa; Daniel Lokshtanov; Marcin Pilipczuk; Michal Pilipczuk; Saket Saurabh 001; Magnus Wahlström (ACM Trans. Algorithms, 2021)

Constant Congestion Brambles. - Meike Hatzel; Pawel Komosa; Marcin Pilipczuk; Manuel Sorge (Discret. Math. Theor. Comput. Sci., 2022)