13 citations · 59 across the 31 of their papers we have counts for
4 papers · 1 filter
Fairness in Repetitive Scheduling
Danny Hermelin, Hendrik Molter, Rolf Niedermeier +2
Recent research found that fairness plays a key role in customer satisfaction. Therefore, many manufacturing and services industries have become aware of the need to treat customer…
Temporal Interval Cliques and Independent Sets
Danny Hermelin, Yuval Itzhaki, Hendrik Molter +1
Temporal graphs have been recently introduced to model changes to a given network that occur throughout a fixed period of time. The Temporal Clique problem, that generalizes th…
Polynomial Turing Kernels for Clique with an Optimal Number of Queries
Till Fluschnik, Klaus Heeger, Danny Hermelin
A polynomial Turing kernel for some parameterized problem is a polynomial-time algorithm that solves using queries to an oracle of whose sizes are upper-bounded by some…
A comparison between D-wave and a classical approximation algorithm and a heuristic for computing the ground state of an Ising spin glass
Ran Yaacoby, Nathan Schaar, Leon Kellerhals +3
Finding the ground state of an Ising-spin glass on general graphs belongs to the class of NP-hard problems, widely believed to have no efficient polynomial-time algorithms for solv…