13 citations · 59 across the 31 of their papers we have counts for
6 papers · 1 filter
New Algorithms for Minimizing the Weighted Number of Tardy Jobs On a Single Machine
Danny Hermelin, Shlomo Karhi, Mike Pinedo +1
In this paper we study the classical single machine scheduling problem where the objective is to minimize the total weight of tardy jobs. Our analysis focuses on the case where one…
On The Parameterized Tractability of the Just-In-Time Flow-Shop Scheduling Problem
Danny Hermelin, Dvir Shabtay, Nimrod Talmon
Since its development in the early 90's, parameterized complexity has been widely used to analyze the tractability of many NP-hard combinatorial optimization problems with respect…
Scheduling Two Agents on a Single Machine: A Parameterized Analysis of NP-hard Problems
Danny Hermelin, Judith-Madeleine Kubitza, Dvir Shabtay +2
Scheduling theory is an old and well-established area in combinatorial optimization, whereas the much younger area of parameterized complexity has only recently gained the attentio…
How hard is it to satisfy (almost) all roommates?
Jiehua Chen, Danny Hermelin, Manuel Sorge +1
The classic Stable Roommates problem (which is the non-bipartite generalization of the well-known Stable Marriage problem) asks whether there is a stable matching for a given set o…
SETH-Based Lower Bounds for Subset Sum and Bicriteria Path
Amir Abboud, Karl Bringmann, Danny Hermelin +1
Subset-Sum and k-SAT are two of the most extensively studied problems in computer science, and conjectures about their hardness are among the cornerstones of fine-grained complexit…
Coordination of Mobile Mules via Facility Location Strategies
Danny Hermelin, Michael Segal, Harel Yedidsion
In this paper, we study the problem of wireless sensor network (WSN) maintenance using mobile entities called mules. The mules are deployed in the area of the WSN in such a way tha…