Danny Hermelin

Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann: Unified Compression-Based Acceleration of Edit-Distance Computation. Algorithmica 65(2): 339-353 (2013)

Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström: Parameterized Two-Player Nash Equilibrium. Algorithmica 65(4): 802-816 (2013)

Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond: Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable. Theor. Comput. Sci. 472: 81-89 (2013)

Jiong Guo, Danny Hermelin, Christian Komusiewicz: Local Search for String Problems: Brute Force Is Essentially Optimal. CPM 2013: 130-141

Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann: Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. CoRR abs/1301.6127 (2013)

Michael R. Fellows, Danny Hermelin, Frances A. Rosamond: Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications. Algorithmica 64(1): 3-18 (2012)

Igor Nor, Danny Hermelin, Sylvain Charlat, Jan Engelstadter, Max Reuter, Olivier Duron, Marie-France Sagot: Mod/Resc Parsimony Inference: Theory and application. Inf. Comput. 213: 23-32 (2012)

Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen: Parameterized Complexity of Induced H-Matching on Claw-Free Graphs. ESA 2012: 624-635

Danny Hermelin, Romeo Rizzi, Stéphane Vialette: Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph. ISAAC 2012: 465-474

Danny Hermelin, Xi Wu: Weak compositions and their applications to polynomial lower bounds for kernelization. SODA 2012: 104-113

Danny Hermelin, Julián Mestre, Dror Rawitz: Optimization Problems in Dotted Interval Graphs. WG 2012: 46-56

Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz: Minimum vertex cover in rectangle graphs. Comput. Geom. 44(6-7): 356-364 (2011)

Danny Hermelin, Dror Rawitz: Optimization problems in multiple subtree graphs. Discrete Applied Mathematics 159(7): 588-594 (2011)

Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, Ilan Newman: Treewidth governs the complexity of target set selection. Discrete Optimization 8(1): 87-96 (2011)

Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette: Upper and lower bounds for finding connected motifs in vertex-colored graphs. J. Comput. Syst. Sci. 77(4): 799-811 (2011)

Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg: Haplotype Inference Constrained by Plausible Haplotype Data. IEEE/ACM Trans. Comput. Biology Bioinform. 8(6): 1692-1699 (2011)

Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger: Domination When the Stars Are Out. ICALP (1) 2011: 462-473

Danny Hermelin, Avivit Levy, Oren Weimann, Raphael Yuster: Distance Oracles for Vertex-Labeled Graphs. ICALP (2) 2011: 490-501

Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond: Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable. IJCAI 2011: 522-527

Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström: Parameterized Two-Player Nash Equilibrium. WG 2011: 215-226

Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu: Hierarchies of Inefficient Kernelizability. CoRR abs/1110.0976 (2011)

Danny Hermelin, Xi Wu: Weak Compositions and Their Applications to Polynomial Lower-Bounds for Kernelization. Electronic Colloquium on Computational Complexity (ECCC) 18: 72 (2011)

Michael R. Fellows, Jörg Flum, Danny Hermelin, Moritz Müller, Frances A. Rosamond: W-Hierarchies Defined by Symmetric Gates. Theory Comput. Syst. 46(2): 311-339 (2010)

Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz: An Extension of the Nemhauser--Trotter Theorem to Generalized Vertex Cover with Applications. SIAM J. Discrete Math. 24(1): 287-300 (2010)

Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz: Optimization problems in multiple-interval graphs. ACM Transactions on Algorithms 6(2) (2010)

Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette: Finding common structured patterns in linear graphs. Theor. Comput. Sci. 411(26-28): 2475-2486 (2010)

Igor Nor, Danny Hermelin, Sylvain Charlat, Jan Engelstadter, Max Reuter, Olivier Duron, Marie-France Sagot: Mod/Resc Parsimony Inference. CPM 2010: 202-213

Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz: Minimum Vertex Cover in Rectangle Graphs. ESA (1) 2010: 255-266

Zvi Gotthilf, Danny Hermelin, Gad M. Landau, Moshe Lewenstein: Restricted LCS. SPIRE 2010: 250-257

Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz: Minimum Vertex Cover in Rectangle Graphs. CoRR abs/1001.3332 (2010)

Igor Nor, Danny Hermelin, Sylvain Charlat, Jan Engelstadter, Max Reuter, Olivier Duron, Marie-France Sagot: Mod/Resc Parsimony Inference. CoRR abs/1002.1292 (2010)

Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann: Unified Compression-Based Acceleration of Edit-Distance Computation. CoRR abs/1004.1194 (2010)

Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström: Parameterized Two-Player Nash Equilibrium. CoRR abs/1006.2063 (2010)

Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger: Domination When the Stars Are Out. CoRR abs/1012.0012 (2010)

Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8): 423-434 (2009)

Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Stéphane Vialette: On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. 410(1): 53-61 (2009)

Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg: Haplotype Inference Constrained by Plausible Haplotype Data. CPM 2009: 339-352

Michael R. Fellows, Danny Hermelin, Frances A. Rosamond: Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs. IWPEC 2009: 149-160

Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, Ilan Newman: An exact almost optimal algorithm for target set selection in social networks. ACM Conference on Electronic Commerce 2009: 355-362

Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann: A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression. STACS 2009: 529-540

Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz: Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications. WAOA 2009: 13-24

Danny Hermelin, Dror Rawitz: Optimization Problems in Multiple Subtree Graphs. WAOA 2009: 194-204

Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann: A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression. CoRR abs/0902.2649 (2009)

Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette: The Minimum Substring Cover problem. Inf. Comput. 206(11): 1303-1312 (2008)

Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette: Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. J. Discrete Algorithms 6(4): 618-626 (2008)

Maxime Crochemore, Danny Hermelin, Gad M. Landau, Dror Rawitz, Stéphane Vialette: Approximating the 2-interval pattern problem. Theor. Comput. Sci. 395(2-3): 283-297 (2008)

Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein: Constrained LCS: Hardness and Approximation. CPM 2008: 255-262

Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin: On Problems without Polynomial Kernels (Extended Abstract). ICALP (1) 2008: 563-574

Michael R. Fellows, Danny Hermelin, Moritz Müller, Frances A. Rosamond: A Purely Democratic Characterization of W[1]. IWPEC 2008: 103-114

Guillaume Blin, Eric Blais, Danny Hermelin, Pierre Guillon, Mathieu Blanchette, Nadia El-Mabrouk: Gene Maps Linearization Using Genomic Rearrangement Distances. Journal of Computational Biology 14(4): 394-407 (2007)

Rolf Backofen, Shihyen Chen, Danny Hermelin, Gad M. Landau, Mikhail A. Roytberg, Oren Weimann, Kaizhong Zhang: Locality and Gaps in RNA Comparison. Journal of Computational Biology 14(8): 1074-1087 (2007)

Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette: Common Structured Patterns in Linear Graphs: Approximation and Combinatorics. CPM 2007: 241-252

Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette: Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. ICALP 2007: 340-351

Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz: Optimization problems in multiple-interval graphs. SODA 2007: 268-277

Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette: The Minimum Substring Cover Problem. WAOA 2007: 170-183

Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann: Local Alignment of RNA Sequences with Arbitrary Scoring Schemes. CPM 2006: 246-257

Maxime Crochemore, Danny Hermelin, Gad M. Landau, Stéphane Vialette: Approximating the 2-Interval Pattern Problem. ESA 2005: 426-437

Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann: Normalized Similarity of RNA Sequences. SPIRE 2005: 360-369

Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette: Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints. WG 2005: 271-282