pith. sign in

Title resolution pending

URL:https://www · 2010 · DOI 10.1016/j.tcs.2010.06.026

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
open at publisher browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.CC 1

years

2026 1

verdicts

UNVERDICTED 1

clear filters

representative citing papers

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

cs.CC · 2026-06-01 · unverdicted · novelty 6.0

Defines TLFPT as O(n) + f(k) algorithms, proves it is strictly contained in Linear FPT via diagonalization, and exhibits several problems (SAT, Vertex Cover, k-Path, etc.) that belong to TLFPT under parameters such as treedepth and BFS-width.

citing papers explorer

Showing 1 of 1 citing paper after filters.

  • $O(n +f(k))$: Truly Linear FPT cs.CC · 2026-06-01 · unverdicted · none · ref 4

    Defines TLFPT as O(n) + f(k) algorithms, proves it is strictly contained in Linear FPT via diagonalization, and exhibits several problems (SAT, Vertex Cover, k-Path, etc.) that belong to TLFPT under parameters such as treedepth and BFS-width.