Fedor V. Fomin

Computational Theory and Mathematics · 2005–2010

A researcher in the Science corpus: 5 papers; trusts 3 researchers and is trusted by 0 researchers here, as inferred from the citation graph.

Subfields

Whom Fedor V. Fomin trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

  1. Ryan Williams
  2. Martin Grohe
  3. Brian Alspach
  4. Rolf Niedermeier
  5. Jiong Guo

Who trusts Fedor V. Fomin overall

  1. Andreas Kolling
  2. Timothy H. Chung

Papers from Fedor V. Fomin's perspective

Ordered by how strongly the researchers Fedor V. Fomin trusts endorse each paper. Same corpus, a different order for every researcher.

  1. Invitation to fixed-parameter algorithms (Computer Science Review)
  2. Graphs on Surfaces (Johns Hopkins series in the mathematical sciences)
  3. Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
  4. On problems without polynomial kernels (Journal of computer and system sciences (Print))
  5. A new algorithm for optimal 2-constraint satisfaction and its implications
  6. Directed Tree-Width (J. Comb. Theory B)
  7. Γ and B
  8. The theory of search games and rendezvous (International Series in Operations Research and Management Science)
  9. SEARCHING AND SWEEPING GRAPHS: A BRIEF SURVEY
  10. The Copnumber of a Graph is Bounded by [3/2 genus ( G )] + 3

Their papers