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

Michael R. Fellows

1 indexed paper

Recent (6 mo)
1
With code
0
Influential cites
0
Benchmarked
0

Publications per year

1
26

Top categories

Complexity×1Discrete Math×1Algorithms×1

Frequent co-authors

Benjamin Merlin Bumpus1×
Rod Downey1×
Tala Eagling-Vose1×
Jessica Enright1×
David C. Kutner1×
Laura Larios-Jones1×

Research Timeline

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

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 for various parameterized problems.

Highlighted terms show continued research focus across papers

Papers

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 →