Danny Hermelin
Scholar

Danny Hermelin

Google Scholar ID: uWH3Nz0AAAAJ
Ben-Gurion University of the Negev
AlgorithmsSchedulingComplexity
Citations & Impact
All-time
Citations
1,261
 
H-index
17
 
i10-index
36
 
Publications
20
 
Co-authors
50
list available
Resume (English only)
Academic Achievements
  • Published extensively since 2005, including but not limited to:
  • - A paper on fairness in repetitive scheduling in the European Journal of Operational Research
  • - A study on fair repetitive interval scheduling in Algorithmica
  • - A note on clustering aggregation for binary clusterings in Operations Research Letters
Research Experience
  • Full Professor at the Department of Industrial Engineering and Management, Ben-Gurion University; involved in multiple research projects, focusing on scheduling, optimization, etc.
Background
  • Research interests: Combinatorial Optimization, Computational Complexity