E-LIB Suche - Ergebnisse für: Hermelin, Danny

1

On the parameterized complexity of interval scheduling with..:

Hermelin, Danny ; Itzhaki, Yuval ; Molter, Hendrik.
Journal of Computer and System Sciences. 144 (2024) - p. 103533 , 2024

Link: https://doi.org/10.1016/..

2

Approximating sparse quadratic programs:

Hermelin, Danny ; Kellerhals, Leon ; Niedermeier, Rolf.
Theoretical Computer Science. 984 (2024) - p. 114319 , 2024

Link: https://doi.org/10.1016/..

3

Minimizing the Weighted Number of Tardy Jobs via (max,+)-Co..:

Hermelin, Danny ; Molter, Hendrik ; Shabtay, Dvir
INFORMS Journal on Computing. 36 (2024) 3 - p. 836-848 , 2024

Link: https://doi.org/10.1287/..

4

A note on clustering aggregation for binary clusterings:

Chen, Jiehua ; Hermelin, Danny ; Sorge, Manuel
Operations Research Letters. 52 (2024) - p. 107052 , 2024

Link: https://doi.org/10.1016/..

5

Temporal interval cliques and independent sets:

Hermelin, Danny ; Itzhaki, Yuval ; Molter, Hendrik.
Theoretical Computer Science. 961 (2023) - p. 113885 , 2023

Link: https://doi.org/10.1016/..

6

Computing the k densest subgraphs of a graph:

Dondi, Riccardo ; Hermelin, Danny
Information Processing Letters. 179 (2023) - p. 106316 , 2023

Link: https://doi.org/10.1016/..

7

Parameterized algorithmics for time-evolving structures: te..:

Zschoche, Philipp , 2022

Link: https://nbn-resolving.de..

8

Equitable scheduling on a single machine:

Heeger, Klaus ; Hermelin, Danny ; Mertzios, George B....
Journal of Scheduling. 26 (2022) 2 - p. 209-225 , 2022

Link: https://doi.org/10.1007/..

9

A general scheme for solving a large set of scheduling prob..:

Hermelin, Danny ; Shabtay, Dvir ; Zelig, Chen.
Journal of Scheduling. 25 (2022) 2 - p. 229-255 , 2022

Link: https://doi.org/10.1007/..

10

Scheduling lower bounds via AND subset sum:

Abboud, Amir ; Bringmann, Karl ; Hermelin, Danny.
Journal of Computer and System Sciences. 127 (2022) - p. 29-40 , 2022

Link: https://doi.org/10.1016/..

11

SETH-based Lower Bounds for Subset Sum and Bicriteria Path:

Abboud, Amir ; Bringmann, Karl ; Hermelin, Danny.
ACM Transactions on Algorithms. 18 (2022) 1 - p. 1-22 , 2022

Link: https://doi.org/10.1145/..

12

SETH-based Lower Bounds for Subset Sum and Bicriteria Path:

Abboud, Amir ; Bringmann, Karl ; Hermelin, Danny.
ACM Transactions on Algorithms (TALG). 18 (2022) 1 - p. 1-22 , 2022

Link: https://dl.acm.org/doi/1..

13

Faster Minimization of Tardy Processing Time on a Single Ma..:

Bringmann, Karl ; Fischer, Nick ; Hermelin, Danny..
Algorithmica. 84 (2022) 5 - p. 1341-1356 , 2022

Link: https://doi.org/10.1007/..

14

Comparison between a quantum annealer and a classical appro..:

Yaacoby, Ran ; Schaar, Nathan ; Kellerhals, Leon...
Physical Review E. 105 (2022) 3 - p. , 2022

Link: https://doi.org/10.1103/..

15

Efficient fully dynamic elimination forests with applicatio..:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,

Chen, Jiehua ; Czerwiński, Wojciech ; Disser, Yann... - p. 796-809 , 2021

Link: https://dl.acm.org/doi/1..