Daniel Lokshtanov

Computational Theory and Mathematics · 2008–2011

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

Subfields

Whom Daniel Lokshtanov trusts overall

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

  1. Andreas Björklund
  2. Martin Grohe
  3. Thore Husfeldt
  4. Dimitrios M. Thilikos
  5. Hans L. Bodlaender
  6. Petteri Kaski

Who trusts Daniel Lokshtanov overall

  1. Richard Ryan Williams

Papers from Daniel Lokshtanov's perspective

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

  1. Graphs on Surfaces (Johns Hopkins series in the mathematical sciences)
  2. Parameterized Complexity Theory
  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. PRISM: Probabilistic Symbolic Model Checker (Computer Performance Evaluation / TOOLS)
  6. Fourier meets möbius: fast subset convolution (Symposium on the Theory of Computing)
  7. Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width (Theory of Computing Systems)
  8. Introduction to the theory of computation
  9. Combinatorial Optimization on Graphs of Bounded Treewidth (Computer/law journal)
  10. Exact Algorithms for NP-Hard Problems: A Survey (Combinatorial Optimization)

Their papers