Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Lukáš Mach
Lower Bounds for the Parameterized Complexity of Minimum Fill-In and Other Completion Problems
Related publications
Subexponential Parameterized Algorithm for Minimum Fill-In
Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width
SIAM Journal on Computing
Mathematics
Computer Science
Tight RMR Lower Bounds for Mutual Exclusion and Other Problems
On the Space Complexity of Parameterized Problems
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
On Miniaturized Problems in Parameterized Complexity Theory
Theoretical Computer Science
Computer Science
Theoretical Computer Science
Some Lower Bounds for the Complexity of Continuation Methods
Journal of Complexity
Control
Numerical Analysis
Statistics
Probability
Algebra
Applied Mathematics
Number Theory
Optimization
Mathematics
Parameterized Complexity of Cardinality Constrained Optimization Problems
Computer Journal
Computer Science
Parameterized Complexity of Generalized Vertex Cover Problems
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Calculating Lower Bounds for Caching Problems
Computing (Vienna/New York)
Numerical Analysis
Computational Theory
Computer Science Applications
Computational Mathematics
Mathematics
Theoretical Computer Science
Software
