NewEvery arXiv paper, its researchers & institutions — mapped.
papers

Publications (22)

cs.CC2019

On Computing Centroids According to the $p$-Norms of Hamming Distance Vectors

Jiehua Chen, Danny Hermelin, Manuel Sorge

cs.DS2013

Tight Kernel Bounds for Problems on Graphs with Small Degeneracy

Marek Cygan, Fabrizio Grandoni, Danny Hermelin

cs.DS2017

New Algorithms for Minimizing the Weighted Number of Tardy Jobs On a Single Machine

Danny Hermelin, Shlomo Karhi, Mike Pinedo +1

cs.DS2017

Scheduling Two Agents on a Single Machine: A Parameterized Analysis of NP-hard Problems

Danny Hermelin, Judith-Madeleine Kubitza, Dvir Shabtay +2

cs.DM2014

Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs

Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen

cs.CC2018

How hard is it to satisfy (almost) all roommates?

Jiehua Chen, Danny Hermelin, Manuel Sorge +1

cs.NI2017

Coordination of Mobile Mules via Facility Location Strategies

Danny Hermelin, Michael Segal, Harel Yedidsion

cs.CC2009

A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression

Danny Hermelin, Gad M. Landau, Shir Landau +1

cs.CC2011

Hierarchies of Inefficient Kernelizability

Danny Hermelin, Stefan Kratsch, Karolina Sołtys +2

cs.DS2010

Unified Compression-Based Acceleration of Edit-Distance Computation

Danny Hermelin, Gad M. Landau, Shir Landau +1

cs.DS2017

On The Parameterized Tractability of the Just-In-Time Flow-Shop Scheduling Problem

Danny Hermelin, Dvir Shabtay, Nimrod Talmon

cs.CC2017

Fractals for Kernelization Lower Bounds

Till Fluschnik, Danny Hermelin, André Nichterlein +1

cs.DS2019

Domination When the Stars Are Out

Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen +1

cs.DS2010

Mod/Resc Parsimony Inference

Igor Nor, Danny Hermelin, Sylvain Charlat +4

cs.DS2014

On the Average-case Complexity of Parameterized Clique

Nikolaos Fountoulakis, Tobias Friedrich, Danny Hermelin

cs.CC2010

Parameterized Two-Player Nash Equilibrium

Danny Hermelin, Chien-Chung Huang, Stefan Kratsch +1

cs.DS2015

Parameterized Complexity Dichotomy for Steiner Multicut

Karl Bringmann, Danny Hermelin, Matthias Mnich +1

cs.DS2010

Minimum Vertex Cover in Rectangle Graphs

Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz

cs.DS2014

Binary Jumbled Pattern Matching on Trees and Tree-Like Structures

Travis Gagie, Danny Hermelin, Gad M. Landau +1

cs.DS2015

Parameterized Complexity of Critical Node Cuts

Danny Hermelin, Moshe Kaspi, Christian Komusiewicz +1

cs.CC2017

Diminishable Parameterized Problems and Strict Polynomial Kernelization

Henning Fernau, Till Fluschnik, Danny Hermelin +3

cs.DS2014

Binary Jumbled Pattern Matching via All-Pairs Shortest Paths

Danny Hermelin, Gad M. Landau, Yuri Rabinovich +1