Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Kitty Meeks
Some Hard Families of Parameterized Counting Problems
ACM Transactions on Computation Theory
Computational Theory
Theoretical Computer Science
Mathematics
Approximately Counting and Sampling Small Witnesses Using a Colourful Decision Oracle
Related publications
Leopoldt’s Conjecture in Parameterized Families
Proceedings of the American Mathematical Society
Mathematics
Applied Mathematics
LP Relaxations of Some NP-Hard Problems Are as Hard as Any LP
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
On the Space Complexity of Parameterized Problems
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Parameterized Complexity of Cardinality Constrained Optimization Problems
Computer Journal
Computer Science
Knapsack Problems: A Parameterized Point of View
Theoretical Computer Science
Computer Science
Theoretical Computer Science
Counting and Finding Homomorphisms Is Universal for Parameterized Complexity Theory
Parameterized Complexity of Generalized Vertex Cover Problems
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Improved Parameterized Algorithms for Network Query Problems
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
