Lukas Mach
Lukas Mach
Google Research
Verified email at google.com - Homepage
Title
Cited by
Cited by
Year
A new lower bound based on Gromov’s method of selecting heavily covered points
D Kral, L Mach, JS Sereni
Discrete & Computational Geometry 48 (2), 487-498, 2012
542012
Detecting scene elements using maximally stable colour regions
S Basovnik, L Mach, A Mikulik, D Obdrzalek
Proceedings of the EUROBOT Conference, 2009
34*2009
Lower bounds for the parameterized complexity of minimum fill-in and other completion problems
I Bliznets, M Cygan, P Komosa, L Mach, M Pilipczuk
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
212016
First order convergence of matroids
F Kardoš, A Liebenau, L Mach
European Journal of Combinatorics 59, 150-168, 2017
102017
Kernelization lower bound for Permutation Pattern Matching
I Bliznets, M Cygan, P Komosa, L Mach
Information Processing Letters 115 (5), 527-531, 2015
32015
Parameterized complexity: permutation patterns, graph arrangements, and matroid parameters
L Mach
University of Warwick, 2015
22015
Amalgam width of matroids
L Mach, T Toufar
International Symposium on Parameterized and Exact Computation, 268-280, 2013
22013
Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems
I Bliznets, M Cygan, P Komosa, M Pilipczuk, L Mach
ACM Transactions on Algorithms (TALG) 16 (2), 1-31, 2020
2020
First order convergence of matroids
L Mach
arXiv preprint arXiv:1501.06518, 2015
2015
Extremální vlastnosti hypergrafů
L Mach
Univerzita Karlova, Matematicko-fyzikální fakulta, 2011
2011
Triangles in arrangements of points and lines in the plane
D Kral, P Klavík, L Mach
Journal of Combinatorial Theory, Series A 118 (3), 1140-1142, 2011
2011
Systém pro polo-automatickou 3D rekonstrukci scén
L Mach
Univerzita Karlova, Matematicko-fyzikální fakulta, 2009
2009
The system can't perform the operation now. Try again later.
Articles 1–12