Lukás Mach

Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems

Marek Cygan, Michal Pilipczuk, Ivan A. Bliznets, 2015, SODA.

Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems

Marek Cygan, Michal Pilipczuk, Ivan A. Bliznets, 2020, ACM Trans. Algorithms.

A New Lower Bound Based on Gromov’s Method of Selecting Heavily Covered Points

D. Král, Jean-Sébastien Sereni, Lukás Mach, 2012, Discrete & Computational Geometry.

Kernelization lower bound for Permutation Pattern Matching pdf

Marek Cygan, Lukás Mach, Ivan Bliznets, 2014, Inf. Process. Lett..

Parameterized complexity : permutation patterns, graph arrangements, and matroid parameters

Lukás Mach, Lukás Mach, 2015 .

Amalgam Width of Matroids pdf

Lukás Mach, Tomas Toufar, Lukás Mach, 2013, IPEC.

First order convergence of matroids pdf

Daniel Král, Anita Liebenau, Frantisek Kardos, 2015, Eur. J. Comb..