Pawel Komosa

According to our database, Pawel Komosa authored at least 7 papers between 2015 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Constant Congestion Brambles.

Meike Hatzel, Pawel Komosa, Marcin Pilipczuk, Manuel Sorge

Discret. Math. Theor. Comput. Sci., 2022

2021

Randomized Contractions Meet Lean Decompositions.

Marek Cygan, Pawel Komosa, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh, Magnus Wahlström

ACM Trans. Algorithms, 2021

2018

Hardness of Approximation for <i>H</i>-free Edge Modification Problems.

Ivan Bliznets, Marek Cygan, Pawel Komosa, Michal Pilipczuk

ACM Trans. Comput. Theory, 2018

Randomized contractions meet lean decompositions.

Marek Cygan, Pawel Komosa, Daniel Lokshtanov, Michal Pilipczuk, Marcin Pilipczuk, Saket Saurabh

CoRR, 2018

2016

Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems.

Ivan Bliznets, Marek Cygan, Pawel Komosa, Lukás Mach, Michal Pilipczuk

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Hardness of Approximation for H-Free Edge Modification Problems.

Ivan Bliznets, Marek Cygan, Pawel Komosa, Michal Pilipczuk

Proceedings of the Approximation, 2016

2015

Kernelization lower bound for Permutation Pattern Matching.

Ivan Bliznets, Marek Cygan, Pawel Komosa, Lukás Mach

Inf. Process. Lett., 2015