Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Marc Roth
Counting and Finding Homomorphisms Is Universal for Parameterized Complexity Theory
Related publications
On Miniaturized Problems in Parameterized Complexity Theory
Theoretical Computer Science
Computer Science
Theoretical Computer Science
Parameterized Proof Complexity
Computational Complexity
Mathematics
Computational Mathematics
Theoretical Computer Science
Computational Theory
Finding Vertex-Surjective Graph Homomorphisms
Acta Informatica
Computer Networks
Software
Information Systems
Communications
Efficient Algorithms for Counting Parameterized List H-Colorings
Journal of Computer and System Sciences
Computer Networks
Applied Mathematics
Communications
Computational Theory
Mathematics
Theoretical Computer Science
Some Hard Families of Parameterized Counting Problems
ACM Transactions on Computation Theory
Computational Theory
Theoretical Computer Science
Mathematics
Approximation and Parameterized Complexity of Minimax Approval Voting
Journal of Artificial Intelligence Research
Artificial Intelligence
On the Space Complexity of Parameterized Problems
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
A Theory of P-Homomorphisms
Colloquium Mathematicum
Mathematics
Parameterized Complexity of Cardinality Constrained Optimization Problems
Computer Journal
Computer Science
