bibliographer - Fedor V. Fomin

bibliographer a curated TCS bibliography

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

Exact Algorithms for Graph Homomorphisms Fedor V. Fomin Pinar Heggernes Dieter Kratsch [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]

Implicit branching and parameterized partial cover problems Omid Amini Fedor V. Fomin Saket Saurabh [github]

An annotated bibliography on guaranteed graph searching Fedor V. Fomin Dimitrios M. Thilikos [github]

Pursuing a fast robber on a graph Fedor V. Fomin Petr A. Golovach Jan Kratochvíl Nicolas Nisse Karol Suchan [github]

Tight Lower Bounds on Graph Embedding Problems Marek Cygan Fedor V. Fomin Alexander Golovnev Alexander S. Kulikov Ivan Mihajlin Jakub Pachocki Arkadiusz Socała [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 (7 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A

[show logs] [hide logs]