Publications

2019:

Journal papers:

  • Danny Hermelin, Michael Pinedo, Dvir Shabtay, Nimrod Talmon: On the parameterized tractability of single machine scheduling with rejection. European Journal of Operational Research 273(1): 67-73.

2018:

Journal papers:

  • Arnon Benshahar, Vered Chlifa-Caspi, Danny Hermelin, Michal Ziv-Ukelson: A Biclique Approach to Reference-Anchored Gene Blocks and Its Applications to Genomic Islands. Journal of Computational Biology 25(2): 214-235.
  • Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier: Fractals for Kernelization Lower Bounds. SIAM Journal of Discrete Mathematics 32(1): 656-681.

Conference papers:

  • Jiehua Chen, Danny Hermelin, Manuel Sorge, Harel Yedidsion: How Hard Is It to Satisfy (Almost) All Roommates?. ICALP 2018: 35:1-35:15
  • Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette: The Clever Shopper Problem. CSR 2018: 53-64
  • Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier: Diminishable Parameterized Problems and Strict Polynomial Kernelization. CiE 2018: 161-171

2017:

Journal papers:

  • Marek Cygan, Fabrizio Grandoni, Danny Hermelin: Tight Kernel Bounds for Problems on Graphs with Small Degeneracy. ACM Trans.actions on Algorithms 13(3): 43:1-43:22

Conference papers:

  • Eduard Eiben, Danny Hermelin, M. S. Ramanujan: Lossy Kernels for Hitting Subgraphs. MFCS 2017: 67:1-67:14
  • Danny Hermelin, Michael Segal, Harel Yedidsion: Coordination of Mobile Mules via Facility Location Strategies. PAAMS 2017: 107-119

2016:

Journal papers:

  • Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen: Parameterized complexity dichotomy for Steiner Multicut. Journal of Computer and System Sciences 82(6): 1020-1043
  • Danny Hermelin, Moshe Kaspi, Christian Komusiewicz, Barak Navon: Parameterized complexity of critical node cuts. Theoretical Computer Science 651: 62-75
  • Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai: Tractable Parameterizations for the Minimum Linear Arrangement Problem. ACM Transactions on Computation Theory 8(2): 6:1-6:12

Conference papers: