bibliographer - Daniel Lokshtanov

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]

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]

A New Perspective on FO Model Checking of Dense Graph Classes Jakub Gajarský Petr Hliněný Jan Obdrżálek Daniel Lokshtanov M. S. Ramanujan [github]

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

[show logs] [hide logs]