Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Till Tantau
On the Space Complexity of Parameterized Problems
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Related publications
On Miniaturized Problems in Parameterized Complexity Theory
Theoretical Computer Science
Computer Science
Theoretical Computer Science
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
Parameterized Proof Complexity
Computational Complexity
Mathematics
Computational Mathematics
Theoretical Computer Science
Computational Theory
Parameterized Complexity and Approximability of Coverability Problems in Weighted Petri Nets
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Lower Bounds for the Parameterized Complexity of Minimum Fill-In and Other Completion Problems
The Parameterized Complexity of the Shared Center Problem
Algorithmica
Applied Mathematics
Computer Science Applications
Computer Science
The Complexity of Irredundant Sets Parameterized by Size
Discrete Applied Mathematics
Combinatorics
Applied Mathematics
Discrete Mathematics
Approximation and Parameterized Complexity of Minimax Approval Voting
Journal of Artificial Intelligence Research
Artificial Intelligence
