On problems without polynomial kernels. Zbl 1192.68288
Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Hermelin, Danny |
|
2009
|
On the parameterized complexity of multiple-interval graph problems. Zbl 1161.68038
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances; Vialette, Stéphane |
|
2009
|
Treewidth governs the complexity of target set selection. Zbl 1248.90068
Ben-Zwi, Oren; Hermelin, Danny; Lokshtanov, Daniel; Newman, Ilan |
|
2011
|
Upper and lower bounds for finding connected motifs in vertex-colored graphs. Zbl 1210.68060
Fellows, Michael R.; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane |
|
2011
|
Weak compositions and their applications to polynomial lower bounds for kernelization. Zbl 1421.68086
Hermelin, Danny; Wu, Xi |
|
2012
|
On problems without polynomial kernels (extended abstract). Zbl 1153.68554
Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Hermelin, Danny |
|
2008
|
A completeness theory for polynomial (Turing) kernelization. Zbl 1312.68102
Hermelin, Danny; Kratsch, Stefan; Sołtys, Karolina; Wahlström, Magnus; Wu, Xi |
|
2015
|
On the parameterized tractability of single machine scheduling with rejection. Zbl 1403.90332
Hermelin, Danny; Pinedo, Michael; Shabtay, Dvir; Talmon, Nimrod |
|
2019
|
Sharp tractability borderlines for finding connected motifs in vertex-colored graphs. Zbl 1171.68497
Fellows, Michael R.; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane |
|
2007
|
SETH-based lower bounds for subset sum and bicriteria path. Zbl 1431.68040
Abboud, Amir; Bringmann, Karl; Hermelin, Danny; Shabtay, Dvir |
|
2019
|
A unified algorithm for accelerating edit-distance computation via text-compression. Zbl 1236.68308
Hermelin, Danny; Landau, Gad M.; Landau, Shir; Weimann, Oren |
|
2009
|
Optimization problems in multiple-interval graphs. Zbl 1300.05295
Butman, Ayelet; Hermelin, Danny; Lewenstein, Moshe; Rawitz, Dror |
|
2010
|
Domination when the stars are out. Zbl 1334.68160
Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan; Woeginger, Gerhard J. |
|
2011
|
Domination when the stars are out. Zbl 1454.68104
Hermelin, Danny; Mnich, Matthias; Van Leeuwen, Erik Jan; Woeginger, Gerhard |
|
2019
|
Parameterized complexity of induced graph matching on claw-free graphs. Zbl 1306.05163
Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan |
|
2014
|
Fractals for kernelization lower bounds. Zbl 1388.68112
Fluschnik, Till; Hermelin, Danny; Nichterlein, André; Niedermeier, Rolf |
|
2018
|
How hard is it to satisfy (almost) all roommates? Zbl 1499.68131
Chen, Jiehua; Hermelin, Danny; Sorge, Manuel; Yedidsion, Harel |
|
2018
|
New algorithms for minimizing the weighted number of tardy jobs on a single machine. Zbl 1467.90008
Hermelin, Danny; Karhi, Shlomo; Pinedo, Michael; Shabtay, Dvir |
|
2021
|
Constrained LCS: Hardness and approximation. Zbl 1143.68637
Gotthilf, Zvi; Hermelin, Danny; Lewenstein, Moshe |
|
2008
|
Optimization problems in multiple-interval graphs. Zbl 1302.05179
Butman, Ayelet; Hermelin, Danny; Lewenstein, Moshe; Rawitz, Dror |
|
2007
|
Scheduling two competing agents when one agent has significantly fewer jobs. Zbl 1378.68021
Hermelin, Danny; Kubitza, Judith-Madeleine; Shabtay, Dvir; Talmon, Nimrod; Woeginger, Gerhard |
|
2015
|
On the parameterized tractability of the just-in-time flow-shop scheduling problem. Zbl 1432.90058
Hermelin, Danny; Shabtay, Dvir; Talmon, Nimrod |
|
2019
|
Binary jumbled pattern matching on trees and tree-like structures. Zbl 1330.68358
Gagie, Travis; Hermelin, Danny; Landau, Gad M.; Weimann, Oren |
|
2015
|
Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications. Zbl 1264.05131
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances A. |
|
2012
|
Approximating the 2-interval pattern problem. Zbl 1123.68143
Crochemore, Maxime; Hermelin, Danny; Landau, Gad M.; Vialette, Stéphane |
|
2005
|
Parameterized multi-scenario single-machine scheduling problems. Zbl 1453.68095
Hermelin, Danny; Manoussakis, George; Pinedo, Michael; Shabtay, Dvir; Yedidsion, Liron |
|
2020
|
An extension of the Nemhauser-Trotter theorem to generalized vertex cover with applications. Zbl 1207.68442
Bar-Yehuda, Reuven; Hermelin, Danny; Rawitz, Dror |
|
2010
|
Distance oracles for vertex-labeled graphs. Zbl 1333.68212
Hermelin, Danny; Levy, Avivit; Weimann, Oren; Yuster, Raphael |
|
2011
|
Approximating the 2-interval pattern problem. Zbl 1142.68070
Crochemore, Maxime; Hermelin, Danny; Landau, Gad M.; Rawitz, Dror; Vialette, Stéphane |
|
2008
|
Tight kernel bounds for problems on graphs with small degeneracy. Zbl 1451.68137
Cygan, Marek; Grandoni, Fabrizio; Hermelin, Danny |
|
2017
|
Parameterized complexity dichotomy for Steiner Multicut. Zbl 1342.68155
Bringmann, Karl; Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan |
|
2016
|
Tight kernel bounds for problems on graphs with small degeneracy (extended abstract). Zbl 1394.68173
Cygan, Marek; Grandoni, Fabrizio; Hermelin, Danny |
|
2013
|
Unified compression-based acceleration of edit-distance computation. Zbl 1259.68048
Hermelin, Danny; Landau, Gad M.; Landau, Shir; Weimann, Oren |
|
2013
|
Parameterized two-player Nash equilibrium. Zbl 1272.68142
Hermelin, Danny; Huang, Chien-Chung; Kratsch, Stefan; Wahlström, Magnus |
|
2013
|
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. Zbl 1171.92316
Blin, Guillaume; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane |
|
2005
|
Lossy kernels for hitting subgraphs. Zbl 1441.68175
Eiben, Eduard; Hermelin, Danny; Ramanujan, M. S. |
|
2017
|
Parameterized complexity analysis for the closest string with wildcards problem. Zbl 1329.68143
Hermelin, Danny; Rozenberg, Liat |
|
2015
|
Binary jumbled pattern matching on trees and tree-like structures. Zbl 1323.68634
Gagie, Travis; Hermelin, Danny; Landau, Gad M.; Weimann, Oren |
|
2013
|
Parameterized complexity dichotomy for Steiner Multicut. Zbl 1355.68113
Bringmann, Karl; Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan |
|
2015
|
On computing centroids according to the \(p\)-norms of Hamming distance vectors. Zbl 07525465
Chen, Jiehua; Hermelin, Danny; Sorge, Manuel |
|
2019
|
Parameterized complexity of induced \(H\)-matching on claw-free graphs. Zbl 1365.68282
Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan |
|
2012
|
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. Zbl 1154.05326
Blin, Guillaume; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane |
|
2008
|
Constraint satisfaction problems: convexity makes AllDifferent constraints tractable. Zbl 1257.68079
Fellows, Michael; Friedrich, Tobias; Hermelin, Danny; Narodytska, Nina; Rosamond, Frances |
|
2013
|
W-hierarchies defined by symmetric gates. Zbl 1211.68217
Fellows, Michael; Flum, Jörg; Hermelin, Danny; Müller, Moritz; Rosamond, Frances |
|
2010
|
The minimum substring cover problem. Zbl 1162.90592
Hermelin, Danny; Rawitz, Dror; Rizzi, Romeo; Vialette, Stéphane |
|
2008
|
Well-quasi-orders in subclasses of bounded treewidth graphs. Zbl 1264.68120
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances A. |
|
2009
|
On the average-case complexity of parameterized clique. Zbl 1312.68100
Fountoulakis, Nikolaos; Friedrich, Tobias; Hermelin, Danny |
|
2015
|
Fractals for kernelization lower bounds, with an application to length-bounded cut problems. Zbl 1388.68111
Fluschnik, Till; Hermelin, Danny; Nichterlein, André; Niedermeier, Rolf |
|
2016
|
Parameterized complexity of critical node cuts. Zbl 1359.68135
Hermelin, Danny; Kaspi, Moshe; Komusiewicz, Christian; Navon, Barak |
|
2016
|
Optimization problems in dotted interval graphs. Zbl 1298.05172
Hermelin, Danny; Mestre, Julián; Rawitz, Dror |
|
2014
|
A completeness theory for polynomial (Turing) kernelization. Zbl 1407.68224
Hermelin, Danny; Kratsch, Stefan; Sołtys, Karolina; Wahlström, Magnus; Wu, Xi |
|
2013
|
Efficient enumeration of maximal induced bicliques. Zbl 1472.05071
Hermelin, Danny; Manoussakis, George |
|
2021
|
Scheduling lower bounds via AND subset sum. Zbl 1483.68142
Abboud, Amir; Bringmann, Karl; Hermelin, Danny; Shabtay, Dvir |
|
2022
|
Minimum vertex cover in rectangle graphs. Zbl 1225.05199
Bar-Yehuda, Reuven; Hermelin, Danny; Rawitz, Dror |
|
2011
|
A general scheme for solving a large set of scheduling problems with rejection in FPT time. Zbl 1489.90027
Hermelin, Danny; Shabtay, Dvir; Zelig, Chen; Pinedo, Michael |
|
2022
|
Mod/Resc parsimony inference: theory and application. Zbl 1237.92041
Nor, Igor; Hermelin, Danny; Charlat, Sylvain; Engelstadter, Jan; Reuter, Max; Duron, Olivier; Sagot, Marie-France |
|
2012
|
Extension of the Nemhauser and Trotter theorem to generalized vertex cover with applications. Zbl 1284.68653
Bar-Yehuda, Reuven; Hermelin, Danny; Rawitz, Dror |
|
2010
|
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. Zbl 07788388
Chen, Jiehua; Czerwiński, Wojciech; Disser, Yann; Feldmann, Andreas Emil; Hermelin, Danny; Nadara, Wojciech; Pilipczuk, Marcin; Pilipczuk, Michał; Sorge, Manuel; Wróblewski, Bartłomiej; Zych-Pawlewicz, Anna |
|
2021
|
Parameterized complexity analysis for the closest string with wildcards problem. Zbl 1407.68225
Hermelin, Danny; Rozenberg, Liat |
|
2014
|
Haplotype inference constrained by plausible haplotype data. Zbl 1247.92017
Fellows, Michael R.; Hartman, Tzvika; Hermelin, Danny; Landau, Gad M.; Rosamond, Frances; Rozenberg, Liat |
|
2009
|
Faster minimization of tardy processing time on a single machine. Zbl 1537.68023
Bringmann, Karl; Fischer, Nick; Hermelin, Danny; Shabtay, Dvir; Wellnitz, Philip |
|
2022
|
On approximate preprocessing for domination and hitting subgraphs with connected deletion sets. Zbl 1425.68309
Eiben, Eduard; Hermelin, Danny; Ramanujan, M. S. |
|
2019
|
Algorithmic aspects of the intersection and overlap numbers of a graph. Zbl 1260.68177
Hermelin, Danny; Rizzi, Romeo; Vialette, Stéphane |
|
2012
|
Diminishable parameterized problems and strict polynomial kernelization. Zbl 1485.68116
Fernau, Henning; Fluschnik, Till; Hermelin, Danny; Krebs, Andreas; Molter, Hendrik; Niedermeier, Rolf |
|
2018
|
Tractable parameterizations for the minimum linear arrangement problem. Zbl 1427.68118
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances; Shachnai, Hadas |
|
2016
|
SETH-based lower bounds for subset sum and bicriteria path. Zbl 07758400
Abboud, Amir; Bringmann, Karl; Hermelin, Danny; Shabtay, Dvir |
|
2022
|
Tractable parameterizations for the minimum linear arrangement problem. Zbl 1394.68441
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances A.; Shachnai, Hadas |
|
2013
|
Local search for string problems: brute-force is essentially optimal. Zbl 1358.68340
Guo, Jiong; Hermelin, Danny; Komusiewicz, Christian |
|
2014
|
Optimization problems in multiple subtree graphs. Zbl 1213.05247
Hermelin, Danny; Rawitz, Dror |
|
2011
|
Minimum vertex cover in rectangle graphs. Zbl 1287.05143
Bar-Yehuda, Reuven; Hermelin, Danny; Rawitz, Dror |
|
2010
|
Parameterized two-player Nash equilibrium. Zbl 1341.05160
Hermelin, Danny; Huang, Chien-Chung; Kratsch, Stefan; Wahlström, Magnus |
|
2011
|
Local alignment of RNA sequences with arbitrary scoring schemes. Zbl 1196.68341
Backofen, Rolf; Hermelin, Danny; Landau, Gad M.; Weimann, Oren |
|
2006
|
The minimum substring cover problem. Zbl 1130.68100
Hermelin, Danny; Rawitz, Dror; Rizzi, Romeo; Vialette, Stéphane |
|
2008
|
Common structured patterns in linear graphs: Approximation and combinatorics. Zbl 1138.68476
Fertin, Guillaume; Hermelin, Danny; Rizzi, Romeo; Vialette, Stéphane |
|
2007
|
The clever shopper problem. Zbl 1434.68193
Bulteau, Laurent; Hermelin, Danny; Labarre, Anthony; Vialette, Stéphane |
|
2018
|
Diminishable parameterized problems and strict polynomial kernelization. Zbl 1485.68117
Fernau, Henning; Fluschnik, Till; Hermelin, Danny; Krebs, Andreas; Molter, Hendrik; Niedermeier, Rolf |
|
2020
|
Equitable scheduling on a single machine. Zbl 1517.90048
Heeger, Klaus; Hermelin, Danny; Mertzios, George B.; Molter, Hendrik; Niedermeier, Rolf; Shabtay, Dvir |
|
2023
|
Equitable scheduling on a single machine. Zbl 1517.90048
Heeger, Klaus; Hermelin, Danny; Mertzios, George B.; Molter, Hendrik; Niedermeier, Rolf; Shabtay, Dvir |
|
2023
|
Scheduling lower bounds via AND subset sum. Zbl 1483.68142
Abboud, Amir; Bringmann, Karl; Hermelin, Danny; Shabtay, Dvir |
|
2022
|
A general scheme for solving a large set of scheduling problems with rejection in FPT time. Zbl 1489.90027
Hermelin, Danny; Shabtay, Dvir; Zelig, Chen; Pinedo, Michael |
|
2022
|
Faster minimization of tardy processing time on a single machine. Zbl 1537.68023
Bringmann, Karl; Fischer, Nick; Hermelin, Danny; Shabtay, Dvir; Wellnitz, Philip |
|
2022
|
SETH-based lower bounds for subset sum and bicriteria path. Zbl 07758400
Abboud, Amir; Bringmann, Karl; Hermelin, Danny; Shabtay, Dvir |
|
2022
|
New algorithms for minimizing the weighted number of tardy jobs on a single machine. Zbl 1467.90008
Hermelin, Danny; Karhi, Shlomo; Pinedo, Michael; Shabtay, Dvir |
|
2021
|
Efficient enumeration of maximal induced bicliques. Zbl 1472.05071
Hermelin, Danny; Manoussakis, George |
|
2021
|
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. Zbl 07788388
Chen, Jiehua; Czerwiński, Wojciech; Disser, Yann; Feldmann, Andreas Emil; Hermelin, Danny; Nadara, Wojciech; Pilipczuk, Marcin; Pilipczuk, Michał; Sorge, Manuel; Wróblewski, Bartłomiej; Zych-Pawlewicz, Anna |
|
2021
|
Parameterized multi-scenario single-machine scheduling problems. Zbl 1453.68095
Hermelin, Danny; Manoussakis, George; Pinedo, Michael; Shabtay, Dvir; Yedidsion, Liron |
|
2020
|
Diminishable parameterized problems and strict polynomial kernelization. Zbl 1485.68117
Fernau, Henning; Fluschnik, Till; Hermelin, Danny; Krebs, Andreas; Molter, Hendrik; Niedermeier, Rolf |
|
2020
|
On the parameterized tractability of single machine scheduling with rejection. Zbl 1403.90332
Hermelin, Danny; Pinedo, Michael; Shabtay, Dvir; Talmon, Nimrod |
|
2019
|
SETH-based lower bounds for subset sum and bicriteria path. Zbl 1431.68040
Abboud, Amir; Bringmann, Karl; Hermelin, Danny; Shabtay, Dvir |
|
2019
|
Domination when the stars are out. Zbl 1454.68104
Hermelin, Danny; Mnich, Matthias; Van Leeuwen, Erik Jan; Woeginger, Gerhard |
|
2019
|
On the parameterized tractability of the just-in-time flow-shop scheduling problem. Zbl 1432.90058
Hermelin, Danny; Shabtay, Dvir; Talmon, Nimrod |
|
2019
|
On computing centroids according to the \(p\)-norms of Hamming distance vectors. Zbl 07525465
Chen, Jiehua; Hermelin, Danny; Sorge, Manuel |
|
2019
|
On approximate preprocessing for domination and hitting subgraphs with connected deletion sets. Zbl 1425.68309
Eiben, Eduard; Hermelin, Danny; Ramanujan, M. S. |
|
2019
|
Fractals for kernelization lower bounds. Zbl 1388.68112
Fluschnik, Till; Hermelin, Danny; Nichterlein, André; Niedermeier, Rolf |
|
2018
|
How hard is it to satisfy (almost) all roommates? Zbl 1499.68131
Chen, Jiehua; Hermelin, Danny; Sorge, Manuel; Yedidsion, Harel |
|
2018
|
Diminishable parameterized problems and strict polynomial kernelization. Zbl 1485.68116
Fernau, Henning; Fluschnik, Till; Hermelin, Danny; Krebs, Andreas; Molter, Hendrik; Niedermeier, Rolf |
|
2018
|
The clever shopper problem. Zbl 1434.68193
Bulteau, Laurent; Hermelin, Danny; Labarre, Anthony; Vialette, Stéphane |
|
2018
|
Tight kernel bounds for problems on graphs with small degeneracy. Zbl 1451.68137
Cygan, Marek; Grandoni, Fabrizio; Hermelin, Danny |
|
2017
|
Lossy kernels for hitting subgraphs. Zbl 1441.68175
Eiben, Eduard; Hermelin, Danny; Ramanujan, M. S. |
|
2017
|
Parameterized complexity dichotomy for Steiner Multicut. Zbl 1342.68155
Bringmann, Karl; Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan |
|
2016
|
Fractals for kernelization lower bounds, with an application to length-bounded cut problems. Zbl 1388.68111
Fluschnik, Till; Hermelin, Danny; Nichterlein, André; Niedermeier, Rolf |
|
2016
|
Parameterized complexity of critical node cuts. Zbl 1359.68135
Hermelin, Danny; Kaspi, Moshe; Komusiewicz, Christian; Navon, Barak |
|
2016
|
Tractable parameterizations for the minimum linear arrangement problem. Zbl 1427.68118
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances; Shachnai, Hadas |
|
2016
|
A completeness theory for polynomial (Turing) kernelization. Zbl 1312.68102
Hermelin, Danny; Kratsch, Stefan; Sołtys, Karolina; Wahlström, Magnus; Wu, Xi |
|
2015
|
Scheduling two competing agents when one agent has significantly fewer jobs. Zbl 1378.68021
Hermelin, Danny; Kubitza, Judith-Madeleine; Shabtay, Dvir; Talmon, Nimrod; Woeginger, Gerhard |
|
2015
|
Binary jumbled pattern matching on trees and tree-like structures. Zbl 1330.68358
Gagie, Travis; Hermelin, Danny; Landau, Gad M.; Weimann, Oren |
|
2015
|
Parameterized complexity analysis for the closest string with wildcards problem. Zbl 1329.68143
Hermelin, Danny; Rozenberg, Liat |
|
2015
|
Parameterized complexity dichotomy for Steiner Multicut. Zbl 1355.68113
Bringmann, Karl; Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan |
|
2015
|
On the average-case complexity of parameterized clique. Zbl 1312.68100
Fountoulakis, Nikolaos; Friedrich, Tobias; Hermelin, Danny |
|
2015
|
Parameterized complexity of induced graph matching on claw-free graphs. Zbl 1306.05163
Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan |
|
2014
|
Optimization problems in dotted interval graphs. Zbl 1298.05172
Hermelin, Danny; Mestre, Julián; Rawitz, Dror |
|
2014
|
Parameterized complexity analysis for the closest string with wildcards problem. Zbl 1407.68225
Hermelin, Danny; Rozenberg, Liat |
|
2014
|
Local search for string problems: brute-force is essentially optimal. Zbl 1358.68340
Guo, Jiong; Hermelin, Danny; Komusiewicz, Christian |
|
2014
|
Tight kernel bounds for problems on graphs with small degeneracy (extended abstract). Zbl 1394.68173
Cygan, Marek; Grandoni, Fabrizio; Hermelin, Danny |
|
2013
|
Unified compression-based acceleration of edit-distance computation. Zbl 1259.68048
Hermelin, Danny; Landau, Gad M.; Landau, Shir; Weimann, Oren |
|
2013
|
Parameterized two-player Nash equilibrium. Zbl 1272.68142
Hermelin, Danny; Huang, Chien-Chung; Kratsch, Stefan; Wahlström, Magnus |
|
2013
|
Binary jumbled pattern matching on trees and tree-like structures. Zbl 1323.68634
Gagie, Travis; Hermelin, Danny; Landau, Gad M.; Weimann, Oren |
|
2013
|
Constraint satisfaction problems: convexity makes AllDifferent constraints tractable. Zbl 1257.68079
Fellows, Michael; Friedrich, Tobias; Hermelin, Danny; Narodytska, Nina; Rosamond, Frances |
|
2013
|
A completeness theory for polynomial (Turing) kernelization. Zbl 1407.68224
Hermelin, Danny; Kratsch, Stefan; Sołtys, Karolina; Wahlström, Magnus; Wu, Xi |
|
2013
|
Tractable parameterizations for the minimum linear arrangement problem. Zbl 1394.68441
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances A.; Shachnai, Hadas |
|
2013
|
Weak compositions and their applications to polynomial lower bounds for kernelization. Zbl 1421.68086
Hermelin, Danny; Wu, Xi |
|
2012
|
Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications. Zbl 1264.05131
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances A. |
|
2012
|
Parameterized complexity of induced \(H\)-matching on claw-free graphs. Zbl 1365.68282
Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan |
|
2012
|
Mod/Resc parsimony inference: theory and application. Zbl 1237.92041
Nor, Igor; Hermelin, Danny; Charlat, Sylvain; Engelstadter, Jan; Reuter, Max; Duron, Olivier; Sagot, Marie-France |
|
2012
|
Algorithmic aspects of the intersection and overlap numbers of a graph. Zbl 1260.68177
Hermelin, Danny; Rizzi, Romeo; Vialette, Stéphane |
|
2012
|
Treewidth governs the complexity of target set selection. Zbl 1248.90068
Ben-Zwi, Oren; Hermelin, Danny; Lokshtanov, Daniel; Newman, Ilan |
|
2011
|
Upper and lower bounds for finding connected motifs in vertex-colored graphs. Zbl 1210.68060
Fellows, Michael R.; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane |
|
2011
|
Domination when the stars are out. Zbl 1334.68160
Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan; Woeginger, Gerhard J. |
|
2011
|
Distance oracles for vertex-labeled graphs. Zbl 1333.68212
Hermelin, Danny; Levy, Avivit; Weimann, Oren; Yuster, Raphael |
|
2011
|
Minimum vertex cover in rectangle graphs. Zbl 1225.05199
Bar-Yehuda, Reuven; Hermelin, Danny; Rawitz, Dror |
|
2011
|
Optimization problems in multiple subtree graphs. Zbl 1213.05247
Hermelin, Danny; Rawitz, Dror |
|
2011
|
Parameterized two-player Nash equilibrium. Zbl 1341.05160
Hermelin, Danny; Huang, Chien-Chung; Kratsch, Stefan; Wahlström, Magnus |
|
2011
|
Optimization problems in multiple-interval graphs. Zbl 1300.05295
Butman, Ayelet; Hermelin, Danny; Lewenstein, Moshe; Rawitz, Dror |
|
2010
|
An extension of the Nemhauser-Trotter theorem to generalized vertex cover with applications. Zbl 1207.68442
Bar-Yehuda, Reuven; Hermelin, Danny; Rawitz, Dror |
|
2010
|
W-hierarchies defined by symmetric gates. Zbl 1211.68217
Fellows, Michael; Flum, Jörg; Hermelin, Danny; Müller, Moritz; Rosamond, Frances |
|
2010
|
Extension of the Nemhauser and Trotter theorem to generalized vertex cover with applications. Zbl 1284.68653
Bar-Yehuda, Reuven; Hermelin, Danny; Rawitz, Dror |
|
2010
|
Minimum vertex cover in rectangle graphs. Zbl 1287.05143
Bar-Yehuda, Reuven; Hermelin, Danny; Rawitz, Dror |
|
2010
|
On problems without polynomial kernels. Zbl 1192.68288
Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Hermelin, Danny |
|
2009
|
On the parameterized complexity of multiple-interval graph problems. Zbl 1161.68038
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances; Vialette, Stéphane |
|
2009
|
A unified algorithm for accelerating edit-distance computation via text-compression. Zbl 1236.68308
Hermelin, Danny; Landau, Gad M.; Landau, Shir; Weimann, Oren |
|
2009
|
Well-quasi-orders in subclasses of bounded treewidth graphs. Zbl 1264.68120
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances A. |
|
2009
|
Haplotype inference constrained by plausible haplotype data. Zbl 1247.92017
Fellows, Michael R.; Hartman, Tzvika; Hermelin, Danny; Landau, Gad M.; Rosamond, Frances; Rozenberg, Liat |
|
2009
|
On problems without polynomial kernels (extended abstract). Zbl 1153.68554
Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Hermelin, Danny |
|
2008
|
Constrained LCS: Hardness and approximation. Zbl 1143.68637
Gotthilf, Zvi; Hermelin, Danny; Lewenstein, Moshe |
|
2008
|
Approximating the 2-interval pattern problem. Zbl 1142.68070
Crochemore, Maxime; Hermelin, Danny; Landau, Gad M.; Rawitz, Dror; Vialette, Stéphane |
|
2008
|
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. Zbl 1154.05326
Blin, Guillaume; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane |
|
2008
|
The minimum substring cover problem. Zbl 1162.90592
Hermelin, Danny; Rawitz, Dror; Rizzi, Romeo; Vialette, Stéphane |
|
2008
|
The minimum substring cover problem. Zbl 1130.68100
Hermelin, Danny; Rawitz, Dror; Rizzi, Romeo; Vialette, Stéphane |
|
2008
|
Sharp tractability borderlines for finding connected motifs in vertex-colored graphs. Zbl 1171.68497
Fellows, Michael R.; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane |
|
2007
|
Optimization problems in multiple-interval graphs. Zbl 1302.05179
Butman, Ayelet; Hermelin, Danny; Lewenstein, Moshe; Rawitz, Dror |
|
2007
|
Common structured patterns in linear graphs: Approximation and combinatorics. Zbl 1138.68476
Fertin, Guillaume; Hermelin, Danny; Rizzi, Romeo; Vialette, Stéphane |
|
2007
|
Local alignment of RNA sequences with arbitrary scoring schemes. Zbl 1196.68341
Backofen, Rolf; Hermelin, Danny; Landau, Gad M.; Weimann, Oren |
|
2006
|
Approximating the 2-interval pattern problem. Zbl 1123.68143
Crochemore, Maxime; Hermelin, Danny; Landau, Gad M.; Vialette, Stéphane |
|
2005
|
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. Zbl 1171.92316
Blin, Guillaume; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane |
|
2005
|
