Danny Hermelin

165 papers A* 13A 9B 22C 4Misc 2Journal 107Unranked 8

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Fast Makespan Minimization via Short ILPs. CoRR Danny Hermelin, Dvir Shabtay
2026	J	`jnl`	Robust Permutation Flowshops Under Budgeted Uncertainty. CoRR Noam Goldberg, Danny Hermelin, Dvir Shabtay
2025	J	`jnl`	Approximation Algorithms for Fair Repetitive Scheduling. CoRR Danny Hermelin, Danny Segev, Dvir Shabtay
2025	B	`conf`	Concurrency Constrained Scheduling with Tree-Like Constraints. WG Hans L. Bodlaender, Danny Hermelin, Erik Jan van Leeuwen
2025	J	`jnl`	Concurrency Constrained Scheduling with Tree-Like Constraints. CoRR Hans L. Bodlaender, Danny Hermelin, Erik Jan van Leeuwen
2025	J	`jnl`	Fair Repetitive Interval Scheduling. Algorithmica Klaus Heeger, Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay
2025	J	`jnl`	Fairness in repetitive scheduling. Eur. J. Oper. Res. Danny Hermelin, Hendrik Molter, Rolf Niedermeier, Michael L. Pinedo, Dvir Shabtay
2025	J	`jnl`	Faster Minimization of Total Weighted Completion Time on Parallel Machines. CoRR Danny Hermelin, Tomohiro Koana, Dvir Shabtay
2024	J	`jnl`	A note on clustering aggregation for binary clusterings. Oper. Res. Lett. Jiehua Chen, Danny Hermelin, Manuel Sorge
2024	J	`jnl`	Approximating sparse quadratic programs. Theor. Comput. Sci. Danny Hermelin, Leon Kellerhals, Rolf Niedermeier, Rami Pugatch
2024	J	`jnl`	Fair Repetitive Interval Scheduling. CoRR Klaus Heeger, Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay
2024	J	`jnl`	Minimizing the Number of Tardy Jobs and Maximal Tardiness on a Single Machine is NP-hard. CoRR Klaus Heeger, Danny Hermelin, Michael L. Pinedo, Dvir Shabtay
2024	A	`conf`	Minimizing the Weighted Number of Tardy Jobs Is W[1]-Hard. ESA Klaus Heeger, Danny Hermelin
2024	J	`jnl`	Minimizing the Weighted Number of Tardy Jobs is W[1]-hard. CoRR Klaus Heeger, Danny Hermelin
2024	J	`jnl`	Minimizing the Weighted Number of Tardy Jobs via (max,+)-Convolutions. INFORMS J. Comput. Danny Hermelin, Hendrik Molter, Dvir Shabtay
2024	A*	`conf`	No Polynomial Kernels for Knapsack. ICALP Klaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay
2024	J	`jnl`	On the parameterized complexity of interval scheduling with eligible machine sets. J. Comput. Syst. Sci. Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay
2024	J	`jnl`	Serial batching to minimize the weighted number of tardy jobs. J. Sched. Danny Hermelin, Matthias Mnich, Simon Omlor
2023	J	`jnl`	Computing the Inf. Process. Lett. Riccardo Dondi, Danny Hermelin
2023	J	`jnl`	Equitable scheduling on a single machine. J. Sched. Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
2023	J	`jnl`	No Polynomial Kernels for Knapsack. CoRR Klaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay
2023	B	`conf`	Single Machine Scheduling with Few Deadlines. IPEC Klaus Heeger, Danny Hermelin, Dvir Shabtay
2023	J	`jnl`	Temporal interval cliques and independent sets. Theor. Comput. Sci. Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier
2022	J	`jnl`	A general scheme for solving a large set of scheduling problems with rejection in FPT time. J. Sched. Danny Hermelin, Dvir Shabtay, Chen Zelig, Michael L. Pinedo
2022	J	`jnl`	Faster Minimization of Tardy Processing Time on a Single Machine. Algorithmica Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz
2022	B	`conf`	Hardness of Interval Scheduling on Unrelated Machines. IPEC Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay
2022	J	`jnl`	Hardness of Interval Scheduling on Unrelated Machines. CoRR Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay
2022	J	`jnl`	SETH-based Lower Bounds for Subset Sum and Bicriteria Path. ACM Trans. Algorithms Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay
2022	J	`jnl`	Scheduling lower bounds via AND subset sum. J. Comput. Syst. Sci. Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay
2022	J	`jnl`	Single Machine Weighted Number of Tardy Jobs Minimization With Small Weights. CoRR Danny Hermelin, Hendrik Molter, Dvir Shabtay
2022	—	`conf`	Temporal Unit Interval Independent Sets. SAND Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier
2021	J	`jnl`	Collective multi agent deployment for wireless sensor network maintenance. Eng. Appl. Artif. Intell. Harel Yedidsion, Danny Hermelin, Michael Segal
2021	J	`jnl`	Efficient enumeration of maximal induced bicliques. Discret. Appl. Math. Danny Hermelin, George Manoussakis
2021	A*	`conf`	Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. SODA 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
2021	J	`jnl`	Equitable Scheduling for the Total Completion Time Objective. CoRR Danny Hermelin, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
2021	A*	`conf`	Equitable Scheduling on a Single Machine. AAAI Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
2021	J	`jnl`	New algorithms for minimizing the weighted number of tardy jobs on a single machine. Ann. Oper. Res. Danny Hermelin, Shlomo Karhi, Michael L. Pinedo, Dvir Shabtay
2021	J	`jnl`	Polynomial Turing Kernels for Clique with an Optimal Number of Queries. CoRR Till Fluschnik, Klaus Heeger, Danny Hermelin
2021	J	`jnl`	Temporal Unit Interval Independent Sets. CoRR Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier
2020	J	`jnl`	Approximating Sparse Quadratic Programs. CoRR Danny Hermelin, Leon Kellerhals, Rolf Niedermeier, Rami Pugatch
2020	J	`jnl`	Computing the k Densest Subgraphs of a Graph. CoRR Riccardo Dondi, Danny Hermelin
2020	J	`jnl`	Diminishable parameterized problems and strict polynomial kernelization. Comput. Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier
2020	J	`jnl`	Equitable Scheduling on a Single Machine. CoRR Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
2020	A*	`conf`	Faster Minimization of Tardy Processing Time on a Single Machine. ICALP Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz
2020	J	`jnl`	Faster Minimization of Tardy Processing Time on a Single Machine. CoRR Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz
2020	—	`conf`	Hans Bodlaender and the Theory of Kernelization Lower Bounds. Treewidth, Kernels, and Algorithms Danny Hermelin
2020	J	`jnl`	On Dynamic Parameterized k-Path. CoRR 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
2020	J	`jnl`	Parameterized Multi-Scenario Single-Machine Scheduling Problems. Algorithmica Danny Hermelin, George Manoussakis, Michael L. Pinedo, Dvir Shabtay, Liron Yedidsion
2020	A*	`conf`	Scheduling Lower Bounds via AND Subset Sum. ICALP Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay
2020	J	`jnl`	Scheduling Lower Bounds via AND Subset Sum. CoRR Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay
2020	J	`jnl`	The Clever Shopper Problem. Theory Comput. Syst. Laurent Bulteau, Danny Hermelin, Dusan Knop, Anthony Labarre, Stéphane Vialette
2019	J	`jnl`	Domination When the Stars Are Out. ACM Trans. Algorithms Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger
2019	J	`jnl`	Foreword: Special Issue on Parameterized and Exact Computation. Algorithmica Jiong Guo, Danny Hermelin
2019	A	`conf`	On Computing Centroids According to the p-Norms of Hamming Distance Vectors. ESA Jiehua Chen, Danny Hermelin, Manuel Sorge
2019	J	`jnl`	On approximate preprocessing for domination and hitting subgraphs with connected deletion sets. J. Comput. Syst. Sci. Eduard Eiben, Danny Hermelin, M. S. Ramanujan
2019	J	`jnl`	On the parameterized tractability of single machine scheduling with rejection. Eur. J. Oper. Res. Danny Hermelin, Michael L. Pinedo, Dvir Shabtay, Nimrod Talmon
2019	J	`jnl`	On the parameterized tractability of the just-in-time flow-shop scheduling problem. J. Sched. Danny Hermelin, Dvir Shabtay, Nimrod Talmon
2019	A*	`conf`	SETH-Based Lower Bounds for Subset Sum and Bicriteria Path. SODA Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay
2019	J	`jnl`	Single Machine Batch Scheduling to Minimize the Weighted Number of Tardy Jobs. CoRR Danny Hermelin, Matthias Mnich, Simon Omlor
2018	J	`jnl`	A Biclique Approach to Reference-Anchored Gene Blocks and Its Applications to Genomic Islands. J. Comput. Biol. Arnon Benshahar, Vered Chalifa-Caspi, Danny Hermelin, Michal Ziv-Ukelson
2018	J	`jnl`	A Note on Clustering Aggregation. CoRR Jiehua Chen, Danny Hermelin, Manuel Sorge
2018	C	`conf`	Diminishable Parameterized Problems and Strict Polynomial Kernelization. CiE Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier
2018	J	`jnl`	Fractals for Kernelization Lower Bounds. SIAM J. Discret. Math. Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier
2018	A*	`conf`	How Hard Is It to Satisfy (Almost) All Roommates?. ICALP Jiehua Chen, Danny Hermelin, Manuel Sorge, Harel Yedidsion
2018	J	`jnl`	On Computing Centroids According to the p-Norms of Hamming Distance Vectors. CoRR Jiehua Chen, Danny Hermelin, Manuel Sorge
2018	Misc	`conf`	The Clever Shopper Problem. CSR Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette
2018	J	`jnl`	The Clever Shopper Problem. CoRR Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette
2017	B	`ed.`	11th International Symposium on Parameterized and Exact Computation, IPEC 2016, Aarhus, Denmark, August 24-26, 2016 IPEC Jiong Guo, Danny Hermelin
2017	Misc	`conf`	Coordination of Mobile Mules via Facility Location Strategies. PAAMS Danny Hermelin, Michael Segal, Harel Yedidsion
2017	J	`jnl`	Coordination of Mobile Mules via Facility Location Strategies. CoRR Danny Hermelin, Michael Segal, Harel Yedidsion
2017	J	`jnl`	How hard is it to satisfy (almost) all roommates? CoRR Jiehua Chen, Danny Hermelin, Manuel Sorge, Harel Yedidsion
2017	B	`conf`	Lossy Kernels for Hitting Subgraphs. MFCS Eduard Eiben, Danny Hermelin, M. S. Ramanujan
2017	J	`jnl`	New Algorithms for Minimizing the Weighted Number of Tardy Jobs On a Single Machine. CoRR Danny Hermelin, Shlomo Karhi, Mike Pinedo, Dvir Shabtay
2017	J	`jnl`	On The Parameterized Tractability of the Just-In-Time Flow-Shop Scheduling Problem. CoRR Danny Hermelin, Dvir Shabtay, Nimrod Talmon
2017	J	`jnl`	Randomization in Parameterized Complexity (Dagstuhl Seminar 17041). Dagstuhl Reports Marek Cygan, Fedor V. Fomin, Danny Hermelin, Magnus Wahlström
2017	J	`jnl`	SETH-Based Lower Bounds for Subset Sum and Bicriteria Path. CoRR Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay
2017	J	`jnl`	Scheduling Two Agents on a Single Machine: A Parameterized Analysis of NP-hard Problems. CoRR Danny Hermelin, Judith-Madeleine Kubitza, Dvir Shabtay, Nimrod Talmon, Gerhard J. Woeginger
2017	J	`jnl`	Tight Kernel Bounds for Problems on Graphs with Small Degeneracy. ACM Trans. Algorithms Marek Cygan, Fabrizio Grandoni, Danny Hermelin
2016	C	`conf`	A Biclique Approach to Reference Anchored Gene Blocks and Its Applications to Pathogenicity Islands. WABI Arnon Benshahar, Vered Chalifa-Caspi, Danny Hermelin, Michal Ziv-Ukelson
2016	J	`jnl`	Diminishable Parameterized Problems and Strict Polynomial Kernelization. CoRR Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier
2016	A*	`conf`	Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems. ICALP Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier
2016	J	`jnl`	Parameterized complexity dichotomy for Steiner Multicut. J. Comput. Syst. Sci. Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen
2016	J	`jnl`	Parameterized complexity of critical node cuts. Theor. Comput. Sci. Danny Hermelin, Moshe Kaspi, Christian Komusiewicz, Barak Navon
2016	J	`jnl`	Tractable Parameterizations for the Minimum Linear Arrangement Problem. ACM Trans. Comput. Theory Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai
2015	J	`jnl`	A Completeness Theory for Polynomial (Turing) Kernelization. Algorithmica Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu
2015	J	`jnl`	Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. Algorithmica Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann
2015	J	`jnl`	Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems. CoRR Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier
2015	J	`jnl`	On the average-case complexity of parameterized clique. Theor. Comput. Sci. Nikolaos Fountoulakis, Tobias Friedrich, Danny Hermelin
2015	A	`conf`	Parameterized Complexity Dichotomy for Steiner Multicut. STACS Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen
2015	B	`conf`	Parameterized Complexity of Critical Node Cuts. IPEC Danny Hermelin, Moshe Kaspi, Christian Komusiewicz, Barak Navon
2015	J	`jnl`	Parameterized Complexity of Critical Node Cuts. CoRR Danny Hermelin, Moshe Kaspi, Christian Komusiewicz, Barak Navon
2015	J	`jnl`	Parameterized complexity analysis for the Closest String with Wildcards problem. Theor. Comput. Sci. Danny Hermelin, Liat Rozenberg
2015	B	`conf`	Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs. IPEC Danny Hermelin, Judith-Madeleine Kubitza, Dvir Shabtay, Nimrod Talmon, Gerhard J. Woeginger
2014	J	`jnl`	Binary Jumbled Pattern Matching via All-Pairs Shortest Paths. CoRR Danny Hermelin, Gad M. Landau, Yuri Rabinovich, Oren Weimann
2014	J	`jnl`	Local search for string problems: Brute-force is essentially optimal. Theor. Comput. Sci. Jiong Guo, Danny Hermelin, Christian Komusiewicz
2014	J	`jnl`	On the Average-case Complexity of Parameterized Clique. CoRR Nikolaos Fountoulakis, Tobias Friedrich, Danny Hermelin
2014	J	`jnl`	Optimization problems in dotted interval graphs. Discret. Appl. Math. Danny Hermelin, Julián Mestre, Dror Rawitz
2014	B	`conf`	Parameterized Complexity Analysis for the Closest String with Wildcards Problem. CPM Danny Hermelin, Liat Rozenberg
2014	J	`jnl`	Parameterized Complexity Dichotomy for Steiner Multicut. CoRR Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen
2014	J	`jnl`	Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs. Algorithmica Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen
2013	B	`conf`	A Completeness Theory for Polynomial (Turing) Kernelization. IPEC Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu
2013	J	`jnl`	Binary Jumbled Pattern Matching on Trees and Tree-Like Structures CoRR Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann
2013	A	`conf`	Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. ESA Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann
2013	J	`jnl`	Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable. Theor. Comput. Sci. Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond
2013	B	`conf`	Local Search for String Problems: Brute Force Is Essentially Optimal. CPM Jiong Guo, Danny Hermelin, Christian Komusiewicz
2013	J	`jnl`	Parameterized Two-Player Nash Equilibrium. Algorithmica Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström
2013	J	`jnl`	Tight Kernel Bounds for Problems on Graphs with Small Degeneracy CoRR Marek Cygan, Fabrizio Grandoni, Danny Hermelin
2013	A	`conf`	Tight Kernel Bounds for Problems on Graphs with Small Degeneracy - (Extended Abstract). ESA Marek Cygan, Fabrizio Grandoni, Danny Hermelin
2013	A	`conf`	Tractable Parameterizations for the Minimum Linear Arrangement Problem. ESA Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai
2013	J	`jnl`	Unified Compression-Based Acceleration of Edit-Distance Computation. Algorithmica Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann
2012	B	`conf`	Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph. ISAAC Danny Hermelin, Romeo Rizzi, Stéphane Vialette
2012	J	`jnl`	Mod/Resc Parsimony Inference: Theory and application. Inf. Comput. Igor Nor, Danny Hermelin, Sylvain Charlat, Jan Engelstadter, Max Reuter, Olivier Duron, Marie-France Sagot
2012	B	`conf`	Optimization Problems in Dotted Interval Graphs. WG Danny Hermelin, Julián Mestre, Dror Rawitz
2012	J	`jnl`	Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs. CoRR Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen
2012	A	`conf`	Parameterized Complexity of Induced H-Matching on Claw-Free Graphs. ESA Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen
2012	A*	`conf`	Weak compositions and their applications to polynomial lower bounds for kernelization. SODA Danny Hermelin, Xi Wu
2012	J	`jnl`	Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications. Algorithmica Michael R. Fellows, Danny Hermelin, Frances A. Rosamond
2011	A*	`conf`	Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable. IJCAI Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond
2011	—	`conf`	Distance Oracles for Vertex-Labeled Graphs. ICALP (2) Danny Hermelin, Avivit Levy, Oren Weimann, Raphael Yuster
2011	—	`conf`	Domination When the Stars Are Out. ICALP (1) Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger
2011	J	`jnl`	Haplotype Inference Constrained by Plausible Haplotype Data. IEEE ACM Trans. Comput. Biol. Bioinform. Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg
2011	J	`jnl`	Hierarchies of Inefficient Kernelizability CoRR Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu
2011	J	`jnl`	Minimum vertex cover in rectangle graphs. Comput. Geom. Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz
2011	J	`jnl`	Optimization problems in multiple subtree graphs. Discret. Appl. Math. Danny Hermelin, Dror Rawitz
2011	B	`conf`	Parameterized Two-Player Nash Equilibrium. WG Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström
2011	J	`jnl`	Treewidth governs the complexity of target set selection. Discret. Optim. Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, Ilan Newman
2011	J	`jnl`	Upper and lower bounds for finding connected motifs in vertex-colored graphs. J. Comput. Syst. Sci. Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
2011	J	`jnl`	Weak Compositions and Their Applications to Polynomial Lower-Bounds for Kernelization. Electron. Colloquium Comput. Complex. Danny Hermelin, Xi Wu
2010	J	`jnl`	An Extension of the Nemhauser--Trotter Theorem to Generalized Vertex Cover with Applications. SIAM J. Discret. Math. Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz
2010	J	`jnl`	Domination When the Stars Are Out CoRR Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger
2010	J	`jnl`	Finding common structured patterns in linear graphs. Theor. Comput. Sci. Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette
2010	J	`jnl`	Minimum Vertex Cover in Rectangle Graphs CoRR Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz
2010	—	`conf`	Minimum Vertex Cover in Rectangle Graphs. ESA (1) Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz
2010	J	`jnl`	Mod/Resc Parsimony Inference CoRR Igor Nor, Danny Hermelin, Sylvain Charlat, Jan Engelstadter, Max Reuter, Olivier Duron, Marie-France Sagot
2010	B	`conf`	Mod/Resc Parsimony Inference. CPM Igor Nor, Danny Hermelin, Sylvain Charlat, Jan Engelstadter, Max Reuter, Olivier Duron, Marie-France Sagot
2010	J	`jnl`	Optimization problems in multiple-interval graphs. ACM Trans. Algorithms Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz
2010	J	`jnl`	Parameterized Two-Player Nash Equilibrium CoRR Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström
2010	C	`conf`	Restricted LCS. SPIRE Zvi Gotthilf, Danny Hermelin, Gad M. Landau, Moshe Lewenstein
2010	J	`jnl`	Unified Compression-Based Acceleration of Edit-Distance Computation CoRR Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann
2010	J	`jnl`	W-Hierarchies Defined by Symmetric Gates. Theory Comput. Syst. Michael R. Fellows, Jörg Flum, Danny Hermelin, Moritz Müller, Frances A. Rosamond
2009	J	`jnl`	A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression CoRR Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann
2009	A	`conf`	A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression. STACS Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann
2009	A*	`conf`	An exact almost optimal algorithm for target set selection in social networks. EC Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, Ilan Newman
2009	B	`conf`	Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications. WAOA Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz
2009	B	`conf`	Haplotype Inference Constrained by Plausible Haplotype Data. CPM Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg
2009	J	`jnl`	On problems without polynomial kernels. J. Comput. Syst. Sci. Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin
2009	J	`jnl`	On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Stéphane Vialette
2009	B	`conf`	Optimization Problems in Multiple Subtree Graphs. WAOA Danny Hermelin, Dror Rawitz
2009	—	`conf`	Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs. IWPEC Michael R. Fellows, Danny Hermelin, Frances A. Rosamond
2008	—	`conf`	A Purely Democratic Characterization of W[1]. IWPEC Michael R. Fellows, Danny Hermelin, Moritz Müller, Frances A. Rosamond
2008	J	`jnl`	Approximating the 2-interval pattern problem. Theor. Comput. Sci. Maxime Crochemore, Danny Hermelin, Gad M. Landau, Dror Rawitz, Stéphane Vialette
2008	B	`conf`	Constrained LCS: Hardness and Approximation. CPM Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein
2008	J	`jnl`	Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. J. Discrete Algorithms Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
2008	—	`conf`	On Problems without Polynomial Kernels (Extended Abstract). ICALP (1) Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin
2008	J	`jnl`	The Minimum Substring Cover problem. Inf. Comput. Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette
2007	B	`conf`	Common Structured Patterns in Linear Graphs: Approximation and Combinatorics. CPM Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette
2007	J	`jnl`	Gene Maps Linearization Using Genomic Rearrangement Distances. J. Comput. Biol. Guillaume Blin, Eric Blais, Danny Hermelin, Pierre Guillon, Mathieu Blanchette, Nadia El-Mabrouk
2007	J	`jnl`	Locality and Gaps in RNA Comparison. J. Comput. Biol. Rolf Backofen, Shihyen Chen, Danny Hermelin, Gad M. Landau, Mikhail A. Roytberg, Oren Weimann, Kaizhong Zhang
2007	A*	`conf`	Optimization problems in multiple-interval graphs. SODA Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz
2007	A*	`conf`	Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. ICALP Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
2007	B	`conf`	The Minimum Substring Cover Problem. WAOA Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette
2006	B	`conf`	Local Alignment of RNA Sequences with Arbitrary Scoring Schemes. CPM Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann
2005	A	`conf`	Approximating the 2-Interval Pattern Problem. ESA Maxime Crochemore, Danny Hermelin, Gad M. Landau, Stéphane Vialette
2005	B	`conf`	Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints. WG Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
2005	C	`conf`	Normalized Similarity of RNA Sequences. SPIRE Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann