Danny Hermelin

According to our database, Danny Hermelin authored at least 104 papers between 2005 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Approximating sparse quadratic programs.

Danny Hermelin, Leon Kellerhals, Rolf Niedermeier, Rami Pugatch

Theor. Comput. Sci., February, 2024

A note on clustering aggregation for binary clusterings.

Jiehua Chen, Danny Hermelin, Manuel Sorge

Oper. Res. Lett., 2024

On the parameterized complexity of interval scheduling with eligible machine sets.

Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay

J. Comput. Syst. Sci., 2024

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

Danny Hermelin, Hendrik Molter, Dvir Shabtay

INFORMS J. Comput., 2024

Fair Repetitive Interval Scheduling.

Klaus Heeger, Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay

CoRR, 2024

Minimizing the Number of Tardy Jobs and Maximal Tardiness on a Single Machine is NP-hard.

Klaus Heeger, Danny Hermelin, Michael L. Pinedo, Dvir Shabtay

CoRR, 2024

No Polynomial Kernels for Knapsack.

Klaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Minimizing the Weighted Number of Tardy Jobs Is W[1]-Hard.

Klaus Heeger, Danny Hermelin

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023

Temporal interval cliques and independent sets.

Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier

Theor. Comput. Sci., June, 2023

Equitable scheduling on a single machine.

Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay

J. Sched., 2023

Computing the <i>k</i> densest subgraphs of a graph.

Riccardo Dondi, Danny Hermelin

Inf. Process. Lett., 2023

Single Machine Scheduling with Few Deadlines.

Klaus Heeger, Danny Hermelin, Dvir Shabtay

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

2022

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

Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay

ACM Trans. Algorithms, 2022

A general scheme for solving a large set of scheduling problems with rejection in FPT time.

Danny Hermelin, Dvir Shabtay, Chen Zelig, Michael L. Pinedo

J. Sched., 2022

Scheduling lower bounds via AND subset sum.

Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay

J. Comput. Syst. Sci., 2022

Single Machine Weighted Number of Tardy Jobs Minimization With Small Weights.

Danny Hermelin, Hendrik Molter, Dvir Shabtay

CoRR, 2022

Faster Minimization of Tardy Processing Time on a Single Machine.

Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz

Algorithmica, 2022

Temporal Unit Interval Independent Sets.

Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier

Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022

Hardness of Interval Scheduling on Unrelated Machines.

Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

2021

Collective multi agent deployment for wireless sensor network maintenance.

Harel Yedidsion, Danny Hermelin, Michael Segal

Eng. Appl. Artif. Intell., 2021

Efficient enumeration of maximal induced bicliques.

Danny Hermelin, George Manoussakis

Discret. Appl. Math., 2021

Equitable Scheduling for the Total Completion Time Objective.

Danny Hermelin, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay

CoRR, 2021

Polynomial Turing Kernels for Clique with an Optimal Number of Queries.

Till Fluschnik, Klaus Heeger, Danny Hermelin

CoRR, 2021

New algorithms for minimizing the weighted number of tardy jobs on a single machine.

Danny Hermelin, Shlomo Karhi, Michael L. Pinedo, Dvir Shabtay

Ann. Oper. Res., 2021

Efficient fully dynamic elimination forests with applications to detecting long paths and cycles.

Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk, Manuel Sorge, Bartlomiej Wróblewski, Anna Zych-Pawlewicz

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

The Clever Shopper Problem.

Laurent Bulteau, Danny Hermelin, Dusan Knop, Anthony Labarre, Stéphane Vialette

Theory Comput. Syst., 2020

On Dynamic Parameterized k-Path.

Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Michal Pilipczuk, Marcin Pilipczuk, Manuel Sorge, Bartlomiej Wróblewski, Anna Zych-Pawlewicz

CoRR, 2020

Computing the k Densest Subgraphs of a Graph.

Riccardo Dondi, Danny Hermelin

CoRR, 2020

Diminishable parameterized problems and strict polynomial kernelization.

Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier

Comput., 2020

Parameterized Multi-Scenario Single-Machine Scheduling Problems.

Danny Hermelin, George Manoussakis, Michael L. Pinedo, Dvir Shabtay, Liron Yedidsion

Algorithmica, 2020

Hans Bodlaender and the Theory of Kernelization Lower Bounds.

Danny Hermelin

Proceedings of the Treewidth, Kernels, and Algorithms, 2020

2019

Domination When the Stars Are Out.

Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger

ACM Trans. Algorithms, 2019

On the parameterized tractability of the just-in-time flow-shop scheduling problem.

Danny Hermelin, Dvir Shabtay, Nimrod Talmon

J. Sched., 2019

On approximate preprocessing for domination and hitting subgraphs with connected deletion sets.

Eduard Eiben, Danny Hermelin, M. S. Ramanujan

J. Comput. Syst. Sci., 2019

On the parameterized tractability of single machine scheduling with rejection.

Danny Hermelin, Michael L. Pinedo, Dvir Shabtay, Nimrod Talmon

Eur. J. Oper. Res., 2019

Single Machine Batch Scheduling to Minimize the Weighted Number of Tardy Jobs.

Danny Hermelin, Matthias Mnich, Simon Omlor

CoRR, 2019

Foreword: Special Issue on Parameterized and Exact Computation.

Jiong Guo, Danny Hermelin

Algorithmica, 2019

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

Jiehua Chen, Danny Hermelin, Manuel Sorge

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

Fractals for Kernelization Lower Bounds.

Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier

SIAM J. Discret. Math., 2018

A Biclique Approach to Reference-Anchored Gene Blocks and Its Applications to Genomic Islands.

Arnon Benshahar, Vered Chalifa-Caspi, Danny Hermelin, Michal Ziv-Ukelson

J. Comput. Biol., 2018

A Note on Clustering Aggregation.

Jiehua Chen, Danny Hermelin, Manuel Sorge

CoRR, 2018

How Hard Is It to Satisfy (Almost) All Roommates?.

Jiehua Chen, Danny Hermelin, Manuel Sorge, Harel Yedidsion

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

The Clever Shopper Problem.

Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette

Proceedings of the Computer Science - Theory and Applications, 2018

2017

Tight Kernel Bounds for Problems on Graphs with Small Degeneracy.

Marek Cygan, Fabrizio Grandoni, Danny Hermelin

ACM Trans. Algorithms, 2017

Randomization in Parameterized Complexity (Dagstuhl Seminar 17041).

Marek Cygan, Fedor V. Fomin, Danny Hermelin, Magnus Wahlström

Dagstuhl Reports, 2017

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

Danny Hermelin, Shlomo Karhi, Mike Pinedo, Dvir Shabtay

CoRR, 2017

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

Danny Hermelin, Judith-Madeleine Kubitza, Dvir Shabtay, Nimrod Talmon, Gerhard J. Woeginger

CoRR, 2017

Coordination of Mobile Mules via Facility Location Strategies.

Danny Hermelin, Michael Segal, Harel Yedidsion

Proceedings of the Advances in Practical Applications of Cyber-Physical Multi-Agent Systems: The PAAMS Collection, 2017

Lossy Kernels for Hitting Subgraphs.

Eduard Eiben, Danny Hermelin, M. S. Ramanujan

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016

Tractable Parameterizations for the Minimum Linear Arrangement Problem.

Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai

ACM Trans. Comput. Theory, 2016

Parameterized complexity of critical node cuts.

Danny Hermelin, Moshe Kaspi, Christian Komusiewicz, Barak Navon

Theor. Comput. Sci., 2016

Parameterized complexity dichotomy for Steiner Multicut.

Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen

J. Comput. Syst. Sci., 2016

A Biclique Approach to Reference Anchored Gene Blocks and Its Applications to Pathogenicity Islands.

Arnon Benshahar, Vered Chalifa-Caspi, Danny Hermelin, Michal Ziv-Ukelson

Proceedings of the Algorithms in Bioinformatics - 16th International Workshop, 2016

Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems.

Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Parameterized complexity analysis for the Closest String with Wildcards problem.

Danny Hermelin, Liat Rozenberg

Theor. Comput. Sci., 2015

On the average-case complexity of parameterized clique.

Nikolaos Fountoulakis, Tobias Friedrich, Danny Hermelin

Theor. Comput. Sci., 2015

A Completeness Theory for Polynomial (Turing) Kernelization.

Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu

Algorithmica, 2015

Binary Jumbled Pattern Matching on Trees and Tree-Like Structures.

Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann

Algorithmica, 2015

Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs.

Danny Hermelin, Judith-Madeleine Kubitza, Dvir Shabtay, Nimrod Talmon, Gerhard J. Woeginger

Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

2014

Local search for string problems: Brute-force is essentially optimal.

Jiong Guo, Danny Hermelin, Christian Komusiewicz

Theor. Comput. Sci., 2014

Optimization problems in dotted interval graphs.

Danny Hermelin, Julián Mestre, Dror Rawitz

Discret. Appl. Math., 2014

Binary Jumbled Pattern Matching via All-Pairs Shortest Paths.

Danny Hermelin, Gad M. Landau, Yuri Rabinovich, Oren Weimann

CoRR, 2014

Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs.

Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen

Algorithmica, 2014

2013

Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable.

Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond

Theor. Comput. Sci., 2013

Unified Compression-Based Acceleration of Edit-Distance Computation.

Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann

Algorithmica, 2013

Parameterized Two-Player Nash Equilibrium.

Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström

Algorithmica, 2013

Tight Kernel Bounds for Problems on Graphs with Small Degeneracy - (Extended Abstract).

Marek Cygan, Fabrizio Grandoni, Danny Hermelin

Proceedings of the Algorithms - ESA 2013, 2013

2012

Mod/Resc Parsimony Inference: Theory and application.

Igor Nor, Danny Hermelin, Sylvain Charlat, Jan Engelstadter, Max Reuter, Olivier Duron, Marie-France Sagot

Inf. Comput., 2012

Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications.

Michael R. Fellows, Danny Hermelin, Frances A. Rosamond

Algorithmica, 2012

Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph.

Danny Hermelin, Romeo Rizzi, Stéphane Vialette

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Parameterized Complexity of Induced H-Matching on Claw-Free Graphs.

Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen

Proceedings of the Algorithms - ESA 2012, 2012

2011

Haplotype Inference Constrained by Plausible Haplotype Data.

Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg

IEEE ACM Trans. Comput. Biol. Bioinform., 2011

Upper and lower bounds for finding connected motifs in vertex-colored graphs.

Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette

J. Comput. Syst. Sci., 2011

Weak Compositions and Their Applications to Polynomial Lower-Bounds for Kernelization.

Danny Hermelin, Xi Wu

Electron. Colloquium Comput. Complex., 2011

Treewidth governs the complexity of target set selection.

Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, Ilan Newman

Discret. Optim., 2011

Optimization problems in multiple subtree graphs.

Danny Hermelin, Dror Rawitz

Discret. Appl. Math., 2011

Hierarchies of Inefficient Kernelizability

Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu

CoRR, 2011

Minimum vertex cover in rectangle graphs.

Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz

Comput. Geom., 2011

Distance Oracles for Vertex-Labeled Graphs.

Danny Hermelin, Avivit Levy, Oren Weimann, Raphael Yuster

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010

Finding common structured patterns in linear graphs.

Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette

Theor. Comput. Sci., 2010

Optimization problems in multiple-interval graphs.

Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz

ACM Trans. Algorithms, 2010

An Extension of the Nemhauser--Trotter Theorem to Generalized Vertex Cover with Applications.

Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz

SIAM J. Discret. Math., 2010

W-Hierarchies Defined by Symmetric Gates.

Michael R. Fellows, Jörg Flum, Danny Hermelin, Moritz Müller, Frances A. Rosamond

Theory Comput. Syst., 2010

Restricted LCS.

Zvi Gotthilf, Danny Hermelin, Gad M. Landau, Moshe Lewenstein

Proceedings of the String Processing and Information Retrieval, 2010

Mod/Resc Parsimony Inference.

Igor Nor, Danny Hermelin, Sylvain Charlat, Jan Engelstadter, Max Reuter, Olivier Duron, Marie-France Sagot

Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

2009

On the parameterized complexity of multiple-interval graph problems.

Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Stéphane Vialette

Theor. Comput. Sci., 2009

On problems without polynomial kernels.

Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin

J. Comput. Syst. Sci., 2009

Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications.

Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz

Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

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

Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

An exact almost optimal algorithm for target set selection in social networks.

Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, Ilan Newman

Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), 2009

Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs.

Michael R. Fellows, Danny Hermelin, Frances A. Rosamond

Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

2008

Approximating the 2-interval pattern problem.

Maxime Crochemore, Danny Hermelin, Gad M. Landau, Dror Rawitz, Stéphane Vialette

Theor. Comput. Sci., 2008

Fixed-parameter algorithms for protein similarity search under mRNA structure constraints.

Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette

J. Discrete Algorithms, 2008

The Minimum Substring Cover problem.

Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette

Inf. Comput., 2008

A Purely Democratic Characterization of W[1].

Michael R. Fellows, Danny Hermelin, Moritz Müller, Frances A. Rosamond

Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008

On Problems without Polynomial Kernels (Extended Abstract).

Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Constrained LCS: Hardness and Approximation.

Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein

Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

2007

Gene Maps Linearization Using Genomic Rearrangement Distances.

Guillaume Blin, Eric Blais, Danny Hermelin, Pierre Guillon, Mathieu Blanchette, Nadia El-Mabrouk

J. Comput. Biol., 2007

Locality and Gaps in RNA Comparison.

Rolf Backofen, Shihyen Chen, Danny Hermelin, Gad M. Landau, Mikhail A. Roytberg, Oren Weimann, Kaizhong Zhang

J. Comput. Biol., 2007

Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs.

Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Common Structured Patterns in Linear Graphs: Approximation and Combinatorics.

Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette

Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006

Local Alignment of RNA Sequences with Arbitrary Scoring Schemes.

Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann

Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

2005

Normalized Similarity of RNA Sequences.

Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann

Proceedings of the String Processing and Information Retrieval, 2005

Approximating the 2-Interval Pattern Problem.

Maxime Crochemore, Danny Hermelin, Gad M. Landau, Stéphane Vialette

Proceedings of the Algorithms, 2005