Jesper Nederlof

Computational Theory and Mathematics · 2011–2013

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

Subfields

Whom Jesper Nederlof trusts overall

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

  1. Robert Endre Tarjan
  2. Dimitrios M. Thilikos
  3. Bruce A. Reed

Papers from Jesper Nederlof's perspective

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

  1. Introduction to automata theory, languages, and computation, 2nd edition (SIGA)
  2. Algorithm design
  3. Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time (IEEE Annual Symposium on Foundations of Computer Science)
  4. Finding odd cycle transversals (Operations Research Letters)
  5. Fourier meets möbius: fast subset convolution (Symposium on the Theory of Computing)
  6. Invitation to fixed-parameter algorithms (Computer Science Review)
  7. Exact Algorithms for NP-Hard Problems: A Survey (Combinatorial Optimization)
  8. Parameterized Complexity Theory
  9. Authoritative sources in a hyperlinked environment
  10. On the Foundations of Combinatorial Theory

Their papers