ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “parameterized complexity”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.CCcs.DMcs.DSRecentJun 1, 2026

$O(n +f(k))$: Truly Linear FPT

Benjamin Merlin Bumpus, Rod Downey, Tala Eagling-Vose, Jessica Enright +6 more

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…

View →
cs.DScs.CCcs.CGTheoreticalRecentJul 29, 2026

The Parameterized Complexity of Problems on Outer k-Planar Graphs

Xiaobin Ren, Hans L. Bodlaender

This paper studies the parameterized complexity of various graph problems on outer k-planar graphs.

View →
cs.DSTheoreticalRecentJun 24, 2026

On the Parameterized Complexity of Bounded-Density Vertex Deletion

Jakob Raupach, Tom-Lukas Breitkopf, Anton Herrmann, André Nichterlein

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…

View →
cs.DScs.CCcs.DMTheoreticalRecentJul 20, 2026

On the Impact of Stability and the Helly Property on the Dominating Set Problem

Che Cheng, Daniel Mock, Peter Rossmanith

The paper removes stability requirement from the progressive exploration algorithm for Dominating Set, yielding a fixed-parameter tractable algorithm on certain graph classes.

View →
cs.CCmath.COTheoreticalRecentJun 28, 2026

On the Complexity of Counting Orderings in Graphs

Marcelo Arenas, María Alejandra Schild, Bernardo Subercaseaux

This paper shows #P-completeness for several graph counting problems using a new technique.

View →
cs.DScs.CCTheoreticalRecentJun 18, 2026

Computing Twin-Width via Treedepth and Vertex Integrity

Robert Ganian, Mathis Rocton

The authors develop fixed-parameter algorithms for computing or approximating twin-width under different parameterizations.

View →
math.COcs.CCcs.DMTheoreticalRecentJun 7, 2026

Fixed-Parameter Tractability of $t$-Uniform Hypergraphicality

Riley Brown, Istvan Miklos

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.

View →
cs.DCcs.CCcs.FLTheoreticalRecentJun 9, 2026

Generalizing LCL Complexity Gaps to Unbounded Degree via Monadic Second-Order Properties

Chiara Piombi

The authors extend the LOCAL model to unbounded degree graphs using Presburger monadic second-order (PMSO) formulas.

View →
cs.DScs.CCcs.ITTheoreticalRecentJun 9, 2026

A Unified Lower Bound on the Noisy Query Complexity of Boolean Functions

Yuzhou Gu, Xin Li, Yinzhan Xu

The paper provides a general lower bound on the noisy query complexity of Boolean functions in the noisy query model.

View →
cs.DScs.LGstat.MLTheoreticalRecentJun 9, 2026

Fixed-Parameter Tractability of Private Synthetic Data Generation

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.

View →