bibliographer a curated TCS bibliography
  • obsidian
  • tags
  • authors
  • no doi
  • no pdf
  • bad author
  • add item
  • librarian

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]
Implicit branching and parameterized partial cover problems Omid Amini Fedor V. Fomin Saket Saurabh [github]
FO Model Checking on Posets of Bounded Width Jakub Gajarsky Petr Hlineny Daniel Lokshtanov Jan Obdrzalek Sebastian Ordyniak M.S. Ramanujan Saket Saurabh [github]
Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth Fedor V. Fomin Daniel Lokshtanov Saket Saurabh MichaƁ Pilipczuk Marcin Wrochna [github]

Library Size: 13G (4 entries), Last Updated: Apr 05, 2026, 08:41:35, Build Time: N/A badge
[show logs] [hide logs]