placeholder image
  • Contact Info
  • 08-6472216
Publications in VIVO

Hermelin, Dan


My main research focus lies in the areas of combinatorial algorithm design and computational complexity. Specifically, I am interested in analyzing combinatorial problems, typically NP-hard, in various aspects and under different frameworks. I have worked on parameterized and approximation algorithms for NP-hard problems in different settings such as graphs and networks, string matching, bioinformatics, and scheduling and resource allocation. I have also contributed to the development of the kernelization lower-bounds framework which has by now become standard in parameterized complexity.

Research Areas research areas

Geographic Focus

selected publications