bibliographer - Michael R. Fellows

bibliographer a curated TCS bibliography

obsidian
tags
authors
no doi
no pdf
bad author
add item
librarian

Nonconstructive Tools for Proving Polynomial-Time Decidability Michael R. Fellows Michael A. Langston [github]

Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications Michael R. Fellows Danny Hermelin Frances A. Rosamond [github]

Fixed-parameter tractability and completeness II: On completeness for W[1] Rod G. Downey Michael R. Fellows [github]

On the complexity of some colorful problems parameterized by treewidth Michael R. Fellows Fedor V. Fomin Daniel Lokshtanov Frances Rosamond Saket Saurabh Stefan Szeider Carsten Thomassen [github]

On problems without polynomial kernels Hans L. Bodlaender Rodney G. Downey Michael R. Fellows Danny Hermelin [github]

Library Size: 13G (5 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A

[show logs] [hide logs]