20 results for “parameterized complexity”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
The paper introduces and explores Truly Linear FPT (TLFPT), a complexity class defined by $O(n) + f(k)$, demonstrating that it is a strict subset of standard Linear FPT and providing new algorithms fo…
This paper studies the parameterized complexity of various graph problems on outer k-planar graphs.
The paper investigates the parameterized complexity of Bounded Density Vertex Deletion, resolving the question of W[1]-hardness with respect to treewidth and providing a refined complexity landscape f…
The paper removes stability requirement from the progressive exploration algorithm for Dominating Set, yielding a fixed-parameter tractable algorithm on certain graph classes.
This paper shows #P-completeness for several graph counting problems using a new technique.
The authors develop fixed-parameter algorithms for computing or approximating twin-width under different parameterizations.
The authors prove that the $t$-uniform hypergraphicality problem is fixed-parameter tractable parameterized by $(k,t)$, where $k$ is the number of distinct degrees.
The authors extend the LOCAL model to unbounded degree graphs using Presburger monadic second-order (PMSO) formulas.
The paper provides a general lower bound on the noisy query complexity of Boolean functions in the noisy query model.
Badih Ghazi, Cristóbal Guzmán, Pritish Kamath, Alexander Knop +2 more
The paper studies the problem of generating synthetic data under differential privacy and achieves fixed-parameter tractability.