Danny Hermelin

Journal of computer and system sciences (Print) · 2009

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

Whom Danny Hermelin trusts

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

  1. Rolf Niedermeier (in Computational Theory and Mathematics)
  2. Jiong Guo (in Computational Theory and Mathematics)
  3. Lance Fortnow (in Artificial Intelligence)

Papers from Danny Hermelin's perspective

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

  1. Parameterized Complexity Theory
  2. The complexity of theorem-proving procedures
  3. Invitation to data reduction and problem kernelization (SIGA)
  4. Infeasibility of instance compression and succinct PCPs for NP (Journal of computer and system sciences (Print))
  5. Invitation to fixed-parameter algorithms (Computer Science Review)
  6. Solving Real-World Linear Programs: A Decade and More of Progress (Operational Research)
  7. Parameterized Complexity and Approximation Algorithms (Computer/law journal)
  8. Multi-prover interactive proofs: how to remove intractability assumptions
  9. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
  10. PRIMES is in P

Their papers