default search action
Danny Hermelin
Person information
- affiliation: Ben-Gurion University of the Negev, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j56]Danny Hermelin
, Hendrik Molter
Minimizing the Weighted Number of Tardy Jobs via (max,+)-Convolutions. INFORMS J. Comput. 36(3): 836-848 (2024) - [j55]Danny Hermelin, Yuval Itzhaki
On the parameterized complexity of interval scheduling with eligible machine sets. J. Comput. Syst. Sci. 144: 103533 (2024) - [j54]Jiehua Chen, Danny Hermelin, Manuel Sorge:
A note on clustering aggregation for binary clusterings. Oper. Res. Lett. 52: 107052 (2024) - [j53]Danny Hermelin
Approximating sparse quadratic programs. Theor. Comput. Sci. 984: 114319 (2024) - [c56]Klaus Heeger, Danny Hermelin:
Minimizing the Weighted Number of Tardy Jobs Is W[1]-Hard. ESA 2024: 68:1-68:14 - [c55]Klaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay:
No Polynomial Kernels for Knapsack. ICALP 2024: 83:1-83:17 - [i43]Klaus Heeger, Danny Hermelin:
Minimizing the Weighted Number of Tardy Jobs is W[1]-hard. CoRR abs/2401.01740 (2024) - [i42]Klaus Heeger, Danny Hermelin, Michael L. Pinedo, Dvir Shabtay:
Minimizing the Number of Tardy Jobs and Maximal Tardiness on a Single Machine is NP-hard. CoRR abs/2404.02784 (2024) - [i41]Klaus Heeger, Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay:
Fair Repetitive Interval Scheduling. CoRR abs/2407.03987 (2024) - 2023
- [j52]Riccardo Dondi, Danny Hermelin:
Computing the k densest subgraphs of a graph. Inf. Process. Lett. 179: 106316 (2023) - [j51]Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter
Equitable scheduling on a single machine. J. Sched. 26(2): 209-225 (2023) - [j50]Danny Hermelin, Yuval Itzhaki
Temporal interval cliques and independent sets. Theor. Comput. Sci. 961: 113885 (2023) - [c54]Klaus Heeger, Danny Hermelin, Dvir Shabtay:
Single Machine Scheduling with Few Deadlines. IPEC 2023: 24:1-24:15 - [i40]Klaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay:
No Polynomial Kernels for Knapsack. CoRR abs/2308.12593 (2023) - 2022
- [j49]Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz
Faster Minimization of Tardy Processing Time on a Single Machine. Algorithmica 84(5): 1341-1356 (2022) - [j48]Amir Abboud, Karl Bringmann, Danny Hermelin
Scheduling lower bounds via AND subset sum. J. Comput. Syst. Sci. 127: 29-40 (2022) - [j47]Danny Hermelin, Dvir Shabtay
A general scheme for solving a large set of scheduling problems with rejection in FPT time. J. Sched. 25(2): 229-255 (2022) - [j46]Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay:
SETH-based Lower Bounds for Subset Sum and Bicriteria Path. ACM Trans. Algorithms 18(1): 6:1-6:22 (2022) - [c53]Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay:
Hardness of Interval Scheduling on Unrelated Machines. IPEC 2022: 18:1-18:16 - [c52]Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier:
Temporal Unit Interval Independent Sets. SAND 2022: 19:1-19:16 - [i39]Danny Hermelin, Hendrik Molter, Dvir Shabtay:
Single Machine Weighted Number of Tardy Jobs Minimization With Small Weights. CoRR abs/2202.06841 (2022) - [i38]Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay:
Hardness of Interval Scheduling on Unrelated Machines. CoRR abs/2206.12825 (2022) - 2021
- [j45]Danny Hermelin, Shlomo Karhi, Michael L. Pinedo, Dvir Shabtay
New algorithms for minimizing the weighted number of tardy jobs on a single machine. Ann. Oper. Res. 298(1): 271-287 (2021) - [j44]Danny Hermelin, George Manoussakis:
Efficient enumeration of maximal induced bicliques. Discret. Appl. Math. 303: 253-261 (2021) - [j43]Harel Yedidsion, Danny Hermelin, Michael Segal:
Collective multi agent deployment for wireless sensor network maintenance. Eng. Appl. Artif. Intell. 102: 104265 (2021) - [c51]Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay:
Equitable Scheduling on a Single Machine. AAAI 2021: 11818-11825 - [c50]Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. SODA 2021: 796-809 - [i37]Till Fluschnik, Klaus Heeger, Danny Hermelin:
Polynomial Turing Kernels for Clique with an Optimal Number of Queries. CoRR abs/2110.03279 (2021) - [i36]Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier:
Temporal Unit Interval Independent Sets. CoRR abs/2112.06172 (2021) - [i35]Danny Hermelin, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay:
Equitable Scheduling for the Total Completion Time Objective. CoRR abs/2112.13824 (2021) - 2020
- [j42]Danny Hermelin, George Manoussakis, Michael L. Pinedo, Dvir Shabtay, Liron Yedidsion:
Parameterized Multi-Scenario Single-Machine Scheduling Problems. Algorithmica 82(9): 2644-2667 (2020) - [j41]Henning Fernau
Diminishable parameterized problems and strict polynomial kernelization. Comput. 9(1): 1-24 (2020) - [j40]Laurent Bulteau
The Clever Shopper Problem. Theory Comput. Syst. 64(1): 17-34 (2020) - [c49]Danny Hermelin:
Hans Bodlaender and the Theory of Kernelization Lower Bounds. Treewidth, Kernels, and Algorithms 2020: 18-21 - [c48]Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay:
Scheduling Lower Bounds via AND Subset Sum. ICALP 2020: 4:1-4:15 - [c47]Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz
Faster Minimization of Tardy Processing Time on a Single Machine. ICALP 2020: 19:1-19:12 - [i34]Riccardo Dondi, Danny Hermelin:
Computing the k Densest Subgraphs of a Graph. CoRR abs/2002.07695 (2020) - [i33]Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz:
Faster Minimization of Tardy Processing Time on a Single Machine. CoRR abs/2003.07104 (2020) - [i32]Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay:
Scheduling Lower Bounds via AND Subset Sum. CoRR abs/2003.07113 (2020) - [i31]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:
On Dynamic Parameterized k-Path. CoRR abs/2006.00571 (2020) - [i30]Danny Hermelin, Leon Kellerhals, Rolf Niedermeier, Rami Pugatch:
Approximating Sparse Quadratic Programs. CoRR abs/2007.01252 (2020) - [i29]Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay:
Equitable Scheduling on a Single Machine. CoRR abs/2010.04643 (2020)
2010 – 2019
- 2019
- [j39]Jiong Guo, Danny Hermelin:
Foreword: Special Issue on Parameterized and Exact Computation. Algorithmica 81(2): 419-420 (2019) - [j38]Danny Hermelin, Michael L. Pinedo, Dvir Shabtay, Nimrod Talmon:
On the parameterized tractability of single machine scheduling with rejection. Eur. J. Oper. Res. 273(1): 67-73 (2019) - [j37]Eduard Eiben, Danny Hermelin, M. S. Ramanujan:
On approximate preprocessing for domination and hitting subgraphs with connected deletion sets. J. Comput. Syst. Sci. 105: 158-170 (2019) - [j36]Danny Hermelin, Dvir Shabtay, Nimrod Talmon
On the parameterized tractability of the just-in-time flow-shop scheduling problem. J. Sched. 22(6): 663-676 (2019) - [j35]Danny Hermelin, Matthias Mnich
Domination When the Stars Are Out. ACM Trans. Algorithms 15(2): 25:1-25:90 (2019) - [c46]Jiehua Chen, Danny Hermelin, Manuel Sorge:
On Computing Centroids According to the p-Norms of Hamming Distance Vectors. ESA 2019: 28:1-28:16 - [c45]Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay:
SETH-Based Lower Bounds for Subset Sum and Bicriteria Path. SODA 2019: 41-57 - [i28]Danny Hermelin, Matthias Mnich
Single Machine Batch Scheduling to Minimize the Weighted Number of Tardy Jobs. CoRR abs/1911.12350 (2019) - 2018
- [j34]Arnon Benshahar, Vered Chalifa-Caspi
A Biclique Approach to Reference-Anchored Gene Blocks and Its Applications to Genomic Islands. J. Comput. Biol. 25(2): 214-235 (2018) - [j33]Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier:
Fractals for Kernelization Lower Bounds. SIAM J. Discret. Math. 32(1): 656-681 (2018) - [c44]Henning Fernau
Diminishable Parameterized Problems and Strict Polynomial Kernelization. CiE 2018: 161-171 - [c43]Laurent Bulteau
The Clever Shopper Problem. CSR 2018: 53-64 - [c42]Jiehua Chen, Danny Hermelin, Manuel Sorge, Harel Yedidsion:
How Hard Is It to Satisfy (Almost) All Roommates?. ICALP 2018: 35:1-35:15 - [i27]Laurent Bulteau
The Clever Shopper Problem. CoRR abs/1802.07944 (2018) - [i26]Jiehua Chen, Danny Hermelin, Manuel Sorge:
On Computing Centroids According to the p-Norms of Hamming Distance Vectors. CoRR abs/1807.06469 (2018) - [i25]Jiehua Chen, Danny Hermelin, Manuel Sorge:
A Note on Clustering Aggregation. CoRR abs/1807.08949 (2018) - 2017
- [j32]Marek Cygan
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy. ACM Trans. Algorithms 13(3): 43:1-43:22 (2017) - [c41]Eduard Eiben, Danny Hermelin, M. S. Ramanujan:
Lossy Kernels for Hitting Subgraphs. MFCS 2017: 67:1-67:14 - [c40]Danny Hermelin, Michael Segal
Coordination of Mobile Mules via Facility Location Strategies. PAAMS 2017: 107-119 - [e1]Jiong Guo, Danny Hermelin:
11th International Symposium on Parameterized and Exact Computation, IPEC 2016, August 24-26, 2016, Aarhus, Denmark. LIPIcs 63, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-023-1 [contents] - [i24]Danny Hermelin, Michael Segal, Harel Yedidsion:
Coordination of Mobile Mules via Facility Location Strategies. CoRR abs/1702.04142 (2017) - [i23]Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay:
SETH-Based Lower Bounds for Subset Sum and Bicriteria Path. CoRR abs/1704.04546 (2017) - [i22]Jiehua Chen, Danny Hermelin, Manuel Sorge, Harel Yedidsion:
How hard is it to satisfy (almost) all roommates? CoRR abs/1707.04316 (2017) - [i21]Danny Hermelin, Judith-Madeleine Kubitza, Dvir Shabtay, Nimrod Talmon, Gerhard J. Woeginger:
Scheduling Two Agents on a Single Machine: A Parameterized Analysis of NP-hard Problems. CoRR abs/1709.04161 (2017) - [i20]Danny Hermelin, Dvir Shabtay, Nimrod Talmon:
On The Parameterized Tractability of the Just-In-Time Flow-Shop Scheduling Problem. CoRR abs/1709.04169 (2017) - [i19]Danny Hermelin, Shlomo Karhi, Mike Pinedo, Dvir Shabtay:
New Algorithms for Minimizing the Weighted Number of Tardy Jobs On a Single Machine. CoRR abs/1709.05751 (2017) - [i18]Marek Cygan, Fedor V. Fomin, Danny Hermelin, Magnus Wahlström
Randomization in Parameterized Complexity (Dagstuhl Seminar 17041). Dagstuhl Reports 7(1): 103-128 (2017) - 2016
- [j31]Karl Bringmann, Danny Hermelin
Parameterized complexity dichotomy for Steiner Multicut. J. Comput. Syst. Sci. 82(6): 1020-1043 (2016) - [j30]Danny Hermelin
Parameterized complexity of critical node cuts. Theor. Comput. Sci. 651: 62-75 (2016) - [j29]Michael R. Fellows, Danny Hermelin
Tractable Parameterizations for the Minimum Linear Arrangement Problem. ACM Trans. Comput. Theory 8(2): 6:1-6:12 (2016) - [c39]Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier:
Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems. ICALP 2016: 25:1-25:14 - [c38]Arnon Benshahar, Vered Chalifa-Caspi, Danny Hermelin
A Biclique Approach to Reference Anchored Gene Blocks and Its Applications to Pathogenicity Islands. WABI 2016: 14-26 - [i17]Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier:
Diminishable Parameterized Problems and Strict Polynomial Kernelization. CoRR abs/1611.03739 (2016) - 2015
- [j28]Danny Hermelin
A Completeness Theory for Polynomial (Turing) Kernelization. Algorithmica 71(3): 702-730 (2015) - [j27]Travis Gagie
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. Algorithmica 73(3): 571-588 (2015) - [j26]Nikolaos Fountoulakis
On the average-case complexity of parameterized clique. Theor. Comput. Sci. 576: 18-29 (2015) - [j25]Danny Hermelin
Parameterized complexity analysis for the Closest String with Wildcards problem. Theor. Comput. Sci. 600: 11-18 (2015) - [c37]Danny Hermelin
Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs. IPEC 2015: 55-65 - [c36]Danny Hermelin
Parameterized Complexity of Critical Node Cuts. IPEC 2015: 343-354 - [c35]Karl Bringmann, Danny Hermelin
Parameterized Complexity Dichotomy for Steiner Multicut. STACS 2015: 157-170 - [i16]Danny Hermelin, Moshe Kaspi, Christian Komusiewicz, Barak Navon:
Parameterized Complexity of Critical Node Cuts. CoRR abs/1503.06321 (2015) - [i15]Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier:
Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems. CoRR abs/1512.00333 (2015) - 2014
- [j24]Danny Hermelin
Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs. Algorithmica 70(3): 513-560 (2014) - [j23]Danny Hermelin
Optimization problems in dotted interval graphs. Discret. Appl. Math. 174: 66-72 (2014) - [j22]Jiong Guo, Danny Hermelin
Local search for string problems: Brute-force is essentially optimal. Theor. Comput. Sci. 525: 30-41 (2014) - [c34]Danny Hermelin
Parameterized Complexity Analysis for the Closest String with Wildcards Problem. CPM 2014: 140-149 - [i14]Danny Hermelin, Gad M. Landau, Yuri Rabinovich, Oren Weimann:
Binary Jumbled Pattern Matching via All-Pairs Shortest Paths. CoRR abs/1401.2065 (2014) - [i13]Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen:
Parameterized Complexity Dichotomy for Steiner Multicut. CoRR abs/1404.7006 (2014) - [i12]Nikolaos Fountoulakis, Tobias Friedrich, Danny Hermelin:
On the Average-case Complexity of Parameterized Clique. CoRR abs/1410.6400 (2014) - 2013
- [j21]Danny Hermelin
Unified Compression-Based Acceleration of Edit-Distance Computation. Algorithmica 65(2): 339-353 (2013) - [j20]Danny Hermelin
Parameterized Two-Player Nash Equilibrium. Algorithmica 65(4): 802-816 (2013) - [j19]Michael R. Fellows
Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable. Theor. Comput. Sci. 472: 81-89 (2013) - [c33]Jiong Guo, Danny Hermelin
Local Search for String Problems: Brute Force Is Essentially Optimal. CPM 2013: 130-141 - [c32]Marek Cygan
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy - (Extended Abstract). ESA 2013: 361-372 - [c31]Michael R. Fellows
Tractable Parameterizations for the Minimum Linear Arrangement Problem. ESA 2013: 457-468 - [c30]Travis Gagie
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. ESA 2013: 517-528 - [c29]Danny Hermelin
A Completeness Theory for Polynomial (Turing) Kernelization. IPEC 2013: 202-215 - [i11]Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann:
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. CoRR abs/1301.6127 (2013) - [i10]Marek Cygan, Fabrizio Grandoni, Danny Hermelin:
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy. CoRR abs/1305.4914 (2013) - 2012
- [j18]Michael R. Fellows
Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications. Algorithmica 64(1): 3-18 (2012) - [j17]Igor Nor, Danny Hermelin
Mod/Resc Parsimony Inference: Theory and application. Inf. Comput. 213: 23-32 (2012) - [c28]Danny Hermelin
Parameterized Complexity of Induced H-Matching on Claw-Free Graphs. ESA 2012: 624-635 - [c27]Danny Hermelin, Romeo Rizzi, Stéphane Vialette:
Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph. ISAAC 2012: 465-474 - [c26]Danny Hermelin, Xi Wu:
Weak compositions and their applications to polynomial lower bounds for kernelization. SODA 2012: 104-113 - [c25]Danny Hermelin
Optimization Problems in Dotted Interval Graphs. WG 2012: 46-56 - [i9]Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen:
Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs. CoRR abs/1206.7105 (2012) - 2011
- [j16]Reuven Bar-Yehuda, Danny Hermelin
Minimum vertex cover in rectangle graphs. Comput. Geom. 44(6-7): 356-364 (2011) - [j15]Danny Hermelin
Optimization problems in multiple subtree graphs. Discret. Appl. Math. 159(7): 588-594 (2011) - [j14]Oren Ben-Zwi, Danny Hermelin
Treewidth governs the complexity of target set selection. Discret. Optim. 8(1): 87-96 (2011) - [j13]Michael R. Fellows
Upper and lower bounds for finding connected motifs in vertex-colored graphs. J. Comput. Syst. Sci. 77(4): 799-811 (2011) - [j12]Michael R. Fellows
Haplotype Inference Constrained by Plausible Haplotype Data. IEEE ACM Trans. Comput. Biol. Bioinform. 8(6): 1692-1699 (2011) - [c24]Danny Hermelin
Domination When the Stars Are Out. ICALP (1) 2011: 462-473 - [c23]Danny Hermelin
Distance Oracles for Vertex-Labeled Graphs. ICALP (2) 2011: 490-501 - [c22]Michael R. Fellows
Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable. IJCAI 2011: 522-527 - [c21]Danny Hermelin
Parameterized Two-Player Nash Equilibrium. WG 2011: 215-226 - [i8]Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu:
Hierarchies of Inefficient Kernelizability. CoRR abs/1110.0976 (2011) - [i7]Danny Hermelin, Xi Wu:
Weak Compositions and Their Applications to Polynomial Lower-Bounds for Kernelization. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j11]Michael R. Fellows
W-Hierarchies Defined by Symmetric Gates. Theory Comput. Syst. 46(2): 311-339 (2010) - [j10]Reuven Bar-Yehuda, Danny Hermelin
An Extension of the Nemhauser--Trotter Theorem to Generalized Vertex Cover with Applications. SIAM J. Discret. Math. 24(1): 287-300 (2010) - [j9]Ayelet Butman, Danny Hermelin
Optimization problems in multiple-interval graphs. ACM Trans. Algorithms 6(2): 40:1-40:18 (2010) - [j8]Guillaume Fertin
Finding common structured patterns in linear graphs. Theor. Comput. Sci. 411(26-28): 2475-2486 (2010) - [c20]Igor Nor, Danny Hermelin
Mod/Resc Parsimony Inference. CPM 2010: 202-213 - [c19]Reuven Bar-Yehuda, Danny Hermelin
Minimum Vertex Cover in Rectangle Graphs. ESA (1) 2010: 255-266 - [c18]Zvi Gotthilf, Danny Hermelin
Restricted LCS. SPIRE 2010: 250-257 - [i6]Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz:
Minimum Vertex Cover in Rectangle Graphs. CoRR abs/1001.3332 (2010) - [i5]Igor Nor, Danny Hermelin, Sylvain Charlat, Jan Engelstadter, Max Reuter, Olivier Duron, Marie-France Sagot:
Mod/Resc Parsimony Inference. CoRR abs/1002.1292 (2010) - [i4]Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann:
Unified Compression-Based Acceleration of Edit-Distance Computation. CoRR abs/1004.1194 (2010) - [i3]Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström:
Parameterized Two-Player Nash Equilibrium. CoRR abs/1006.2063 (2010) - [i2]Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger:
Domination When the Stars Are Out. CoRR abs/1012.0012 (2010)
2000 – 2009
- 2009
- [j7]Hans L. Bodlaender
On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8): 423-434 (2009) - [j6]Michael R. Fellows
On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. 410(1): 53-61 (2009) - [c17]Michael R. Fellows
Haplotype Inference Constrained by Plausible Haplotype Data. CPM 2009: 339-352 - [c16]Michael R. Fellows
Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs. IWPEC 2009: 149-160 - [c15]Oren Ben-Zwi, Danny Hermelin
An exact almost optimal algorithm for target set selection in social networks. EC 2009: 355-362 - [c14]Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann:
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression. STACS 2009: 529-540 - [c13]Reuven Bar-Yehuda, Danny Hermelin
Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications. WAOA 2009: 13-24 - [c12]Danny Hermelin
Optimization Problems in Multiple Subtree Graphs. WAOA 2009: 194-204 - [i1]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) - 2008
- [j5]Danny Hermelin
The Minimum Substring Cover problem. Inf. Comput. 206(11): 1303-1312 (2008) - [j4]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) - [j3]Maxime Crochemore
Approximating the 2-interval pattern problem. Theor. Comput. Sci. 395(2-3): 283-297 (2008) - [c11]Zvi Gotthilf, Danny Hermelin
Constrained LCS: Hardness and Approximation. CPM 2008: 255-262 - [c10]Hans L. Bodlaender
On Problems without Polynomial Kernels (Extended Abstract). ICALP (1) 2008: 563-574 - [c9]Michael R. Fellows
A Purely Democratic Characterization of W[1]. IWPEC 2008: 103-114 - 2007
- [j2]Guillaume Blin
Gene Maps Linearization Using Genomic Rearrangement Distances. J. Comput. Biol. 14(4): 394-407 (2007) - [j1]Rolf Backofen, Shihyen Chen, Danny Hermelin
Locality and Gaps in RNA Comparison. J. Comput. Biol. 14(8): 1074-1087 (2007) - [c8]Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette:
Common Structured Patterns in Linear Graphs: Approximation and Combinatorics. CPM 2007: 241-252 - [c7]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 - [c6]Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz:
Optimization problems in multiple-interval graphs. SODA 2007: 268-277 - [c5]Danny Hermelin
The Minimum Substring Cover Problem. WAOA 2007: 170-183 - 2006
- [c4]Rolf Backofen, Danny Hermelin
Local Alignment of RNA Sequences with Arbitrary Scoring Schemes. CPM 2006: 246-257 - 2005
- [c3]Maxime Crochemore, Danny Hermelin, Gad M. Landau, Stéphane Vialette:
Approximating the 2-Interval Pattern Problem. ESA 2005: 426-437 - [c2]Rolf Backofen, Danny Hermelin
Normalized Similarity of RNA Sequences. SPIRE 2005: 360-369 - [c1]Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette:
Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints. WG 2005: 271-282
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: