Hans L. Bodlaender

Computational Theory and Mathematics · 2008–2013

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

Subfields

Whom Hans L. Bodlaender trusts overall

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

  1. Dimitrios M. Thilikos
  2. Gregory F. Cooper
  3. Jiong Guo
  4. Robert Endre Tarjan
  5. Steffen L. Lauritzen
  6. Martin Grohe
  7. Lance Fortnow
  8. Rolf Niedermeier
  9. David J. Spiegelhalter
  10. Marek Cygan

Who trusts Hans L. Bodlaender overall

  1. Daniel Lokshtanov

Papers from Hans L. Bodlaender's perspective

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

  1. Parameterized Complexity Theory
  2. Invitation to fixed-parameter algorithms (Computer Science Review)
  3. Graphs on Surfaces (Johns Hopkins series in the mathematical sciences)
  4. Invitation to data reduction and problem kernelization (SIGA)
  5. The complexity of theorem-proving procedures
  6. Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
  7. On problems without polynomial kernels (Journal of computer and system sciences (Print))
  8. Introduction to automata theory, languages, and computation, 2nd edition (SIGA)
  9. Algorithm design
  10. Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time (IEEE Annual Symposium on Foundations of Computer Science)

Their papers