Danny Hermelin
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
47
Venues
16
Active years
2005–2025
Best venue rank
A*
Where they publish
Papers
47 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2025 | WG | Concurrency Constrained Scheduling with Tree-Like Constraints. | Hans L. Bodlaender, Danny Hermelin, Erik Jan van Leeuwen |
| 2024 | ESA | Minimizing the Weighted Number of Tardy Jobs Is W[1]-Hard. | Klaus Heeger, Danny Hermelin |
| 2024 | ICALP | No Polynomial Kernels for Knapsack. | Klaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay |
| 2021 | AAAI | Equitable Scheduling on a Single Machine. | Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay |
| 2021 | SODA | 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 Wrblewski, Anna Zych-Pawlewicz |
| 2020 | ICALP | Scheduling Lower Bounds via AND Subset Sum. | Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay |
| 2020 | ICALP | Faster Minimization of Tardy Processing Time on a Single Machine. | Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz |
| 2019 | ESA | On Computing Centroids According to the p-Norms of Hamming Distance Vectors. | Jiehua Chen, Danny Hermelin, Manuel Sorge |
| 2019 | SODA | SETH-Based Lower Bounds for Subset Sum and Bicriteria Path. | Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay |
| 2018 | CiE | Diminishable Parameterized Problems and Strict Polynomial Kernelization. | Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier |
| 2018 | CSR | The Clever Shopper Problem. | Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stphane Vialette |
| 2018 | ICALP | How Hard Is It to Satisfy (Almost) All Roommates?. | Jiehua Chen, Danny Hermelin, Manuel Sorge, Harel Yedidsion |
| 2017 | MFCS | Lossy Kernels for Hitting Subgraphs. | Eduard Eiben, Danny Hermelin, M. S. Ramanujan |
| 2017 | PAAMS | Coordination of Mobile Mules via Facility Location Strategies. | Danny Hermelin, Michael Segal, Harel Yedidsion |
| 2016 | ICALP | Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems. | Till Fluschnik, Danny Hermelin, Andr Nichterlein, Rolf Niedermeier |
| 2016 | WABI | A Biclique Approach to Reference Anchored Gene Blocks and Its Applications to Pathogenicity Islands. | Arnon Benshahar, Vered Chalifa-Caspi, Danny Hermelin, Michal Ziv-Ukelson |
| 2015 | STACS | Parameterized Complexity Dichotomy for Steiner Multicut. | Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen |
| 2014 | CPM | Parameterized Complexity Analysis for the Closest String with Wildcards Problem. | Danny Hermelin, Liat Rozenberg |
| 2013 | CPM | Local Search for String Problems: Brute Force Is Essentially Optimal. | Jiong Guo, Danny Hermelin, Christian Komusiewicz |
| 2013 | ESA | Tight Kernel Bounds for Problems on Graphs with Small Degeneracy - (Extended Abstract). | Marek Cygan, Fabrizio Grandoni, Danny Hermelin |
| 2013 | ESA | Tractable Parameterizations for the Minimum Linear Arrangement Problem. | Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai |
| 2013 | ESA | Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. | Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann |
| 2012 | ESA | Parameterized Complexity of Induced H-Matching on Claw-Free Graphs. | Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen |
| 2012 | ISAAC | Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph. | Danny Hermelin, Romeo Rizzi, Stphane Vialette |
| 2012 | SODA | Weak compositions and their applications to polynomial lower bounds for kernelization. | Danny Hermelin, Xi Wu |
| 2012 | WG | Optimization Problems in Dotted Interval Graphs. | Danny Hermelin, Julin Mestre, Dror Rawitz |
| 2011 | ICALP | Distance Oracles for Vertex-Labeled Graphs. | Danny Hermelin, Avivit Levy, Oren Weimann, Raphael Yuster |
| 2011 | ICALP | Domination When the Stars Are Out. | Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger |
| 2011 | IJCAI | Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable. | Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond |
| 2011 | WG | Parameterized Two-Player Nash Equilibrium. | Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlstrm |
| 2010 | CPM | Mod/Resc Parsimony Inference. | Igor Nor, Danny Hermelin, Sylvain Charlat, Jan Engelstadter, Max Reuter, Olivier Duron, Marie-France Sagot |
| 2010 | ESA | Minimum Vertex Cover in Rectangle Graphs. | Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz |
| 2010 | SPIRE | Restricted LCS. | Zvi Gotthilf, Danny Hermelin, Gad M. Landau, Moshe Lewenstein |
| 2009 | CPM | Haplotype Inference Constrained by Plausible Haplotype Data. | Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg |
| 2009 | STACS | A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression. | Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann |
| 2009 | WAOA | Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications. | Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz |
| 2009 | WAOA | Optimization Problems in Multiple Subtree Graphs. | Danny Hermelin, Dror Rawitz |
| 2008 | CPM | Constrained LCS: Hardness and Approximation. | Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein |
| 2008 | ICALP | On Problems without Polynomial Kernels (Extended Abstract). | Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin |
| 2007 | CPM | Common Structured Patterns in Linear Graphs: Approximation and Combinatorics. | Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stphane Vialette |
| 2007 | ICALP | Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. | Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stphane Vialette |
| 2007 | SODA | Optimization problems in multiple-interval graphs. | Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz |
| 2007 | WAOA | The Minimum Substring Cover Problem. | Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stphane Vialette |
| 2006 | CPM | Local Alignment of RNA Sequences with Arbitrary Scoring Schemes. | Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann |
| 2005 | ESA | Approximating the 2-Interval Pattern Problem. | Maxime Crochemore, Danny Hermelin, Gad M. Landau, Stphane Vialette |
| 2005 | SPIRE | Normalized Similarity of RNA Sequences. | Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann |
| 2005 | WG | Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints. | Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stphane Vialette |