Hermelin, Danny; Kellerhals, Leon; Niedermeier, Rolf; Pugatch, Rami Approximating sparse quadratic programs. (English) Zbl 07782074 Theor. Comput. Sci. 984, Article ID 114319, 11 p. (2024). MSC: 68Qxx PDFBibTeX XMLCite \textit{D. Hermelin} et al., Theor. Comput. Sci. 984, Article ID 114319, 11 p. (2024; Zbl 07782074) Full Text: DOI arXiv
Heeger, Klaus; Hermelin, Danny; Mertzios, George B.; Molter, Hendrik; Niedermeier, Rolf; Shabtay, Dvir Equitable scheduling on a single machine. (English) Zbl 1517.90048 J. Sched. 26, No. 2, 209-225 (2023). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{K. Heeger} et al., J. Sched. 26, No. 2, 209--225 (2023; Zbl 1517.90048) Full Text: DOI arXiv
Hermelin, Danny; Itzhaki, Yuval; Molter, Hendrik; Niedermeier, Rolf Temporal interval cliques and independent sets. (English) Zbl 07688223 Theor. Comput. Sci. 961, Article ID 113885, 16 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{D. Hermelin} et al., Theor. Comput. Sci. 961, Article ID 113885, 16 p. (2023; Zbl 07688223) Full Text: DOI arXiv
Dondi, Riccardo; Hermelin, Danny Computing the \(k\) densest subgraphs of a graph. (English) Zbl 07609055 Inf. Process. Lett. 179, Article ID 106316, 7 p. (2023). MSC: 68R10 05C42 05C85 68Q27 68W25 PDFBibTeX XMLCite \textit{R. Dondi} and \textit{D. Hermelin}, Inf. Process. Lett. 179, Article ID 106316, 7 p. (2023; Zbl 07609055) Full Text: DOI arXiv
Heeger, Klaus; Hermelin, Danny; Mnich, Matthias; Shabtay, Dvir No Polynomial Kernels for Knapsack. arXiv:2308.12593 Preprint, arXiv:2308.12593 [cs.DS] (2023). BibTeX Cite \textit{K. Heeger} et al., ``No Polynomial Kernels for Knapsack'', Preprint, arXiv:2308.12593 [cs.DS] (2023) Full Text: arXiv OA License
Abboud, Amir; Bringmann, Karl; Hermelin, Danny; Shabtay, Dvir SETH-based lower bounds for subset sum and bicriteria path. (English) Zbl 07758400 ACM Trans. Algorithms 18, No. 1, Paper No. 6, 22 p. (2022). MSC: 68-XX PDFBibTeX XMLCite \textit{A. Abboud} et al., ACM Trans. Algorithms 18, No. 1, Paper No. 6, 22 p. (2022; Zbl 07758400) Full Text: DOI
Hermelin, Danny; Shabtay, Dvir; Zelig, Chen; Pinedo, Michael A general scheme for solving a large set of scheduling problems with rejection in FPT time. (English) Zbl 1489.90027 J. Sched. 25, No. 2, 229-255 (2022). MSC: 90B35 68M20 90C10 90C25 PDFBibTeX XMLCite \textit{D. Hermelin} et al., J. Sched. 25, No. 2, 229--255 (2022; Zbl 1489.90027) Full Text: DOI
Bringmann, Karl; Fischer, Nick; Hermelin, Danny; Shabtay, Dvir; Wellnitz, Philip Faster minimization of tardy processing time on a single machine. (English) Zbl 07517138 Algorithmica 84, No. 5, 1341-1356 (2022). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{K. Bringmann} et al., Algorithmica 84, No. 5, 1341--1356 (2022; Zbl 07517138) Full Text: DOI arXiv
Abboud, Amir; Bringmann, Karl; Hermelin, Danny; Shabtay, Dvir Scheduling lower bounds via AND subset sum. (English) Zbl 1483.68142 J. Comput. Syst. Sci. 127, 29-40 (2022). MSC: 68Q17 90B35 90C27 PDFBibTeX XMLCite \textit{A. Abboud} et al., J. Comput. Syst. Sci. 127, 29--40 (2022; Zbl 1483.68142) Full Text: DOI arXiv
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 Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. (English) Zbl 07788388 Marx, Dániel (ed.), Proceedings of the 32nd annual ACM-SIAM symposium on discrete algorithms, SODA 2021, Alexandria, VA, USA, virtual, January 10–13, 2021. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 796-809 (2021). MSC: 68Wxx PDFBibTeX XMLCite \textit{J. Chen} et al., in: Proceedings of the 32nd annual ACM-SIAM symposium on discrete algorithms, SODA 2021, Alexandria, VA, USA, virtual, January 10--13, 2021. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 796--809 (2021; Zbl 07788388) Full Text: DOI arXiv
Hermelin, Danny; Manoussakis, George Efficient enumeration of maximal induced bicliques. (English) Zbl 1472.05071 Discrete Appl. Math. 303, 253-261 (2021). MSC: 05C30 05C85 68Q25 68R10 PDFBibTeX XMLCite \textit{D. Hermelin} and \textit{G. Manoussakis}, Discrete Appl. Math. 303, 253--261 (2021; Zbl 1472.05071) Full Text: DOI
Hermelin, Danny; Karhi, Shlomo; Pinedo, Michael; Shabtay, Dvir New algorithms for minimizing the weighted number of tardy jobs on a single machine. (English) Zbl 1467.90008 Ann. Oper. Res. 298, No. 1-2, 271-287 (2021). MSC: 90B35 PDFBibTeX XMLCite \textit{D. Hermelin} et al., Ann. Oper. Res. 298, No. 1--2, 271--287 (2021; Zbl 1467.90008) Full Text: DOI arXiv
Hermelin, Danny Hans Bodlaender and the theory of kernelization lower bounds. (English) Zbl 07604202 Fomin, Fedor V. (ed.) et al., Treewidth, kernels, and algorithms. Essays dedicated to Hans L. Bodlaender on the occasion of his 60th birthday. Cham: Springer. Lect. Notes Comput. Sci. 12160, 18-21 (2020). MSC: 68-XX PDFBibTeX XMLCite \textit{D. Hermelin}, Lect. Notes Comput. Sci. 12160, 18--21 (2020; Zbl 07604202) Full Text: DOI
Fernau, Henning; Fluschnik, Till; Hermelin, Danny; Krebs, Andreas; Molter, Hendrik; Niedermeier, Rolf Diminishable parameterized problems and strict polynomial kernelization. (English) Zbl 1485.68117 Computability 9, No. 1, 1-24 (2020). MSC: 68Q27 68Q17 PDFBibTeX XMLCite \textit{H. Fernau} et al., Computability 9, No. 1, 1--24 (2020; Zbl 1485.68117) Full Text: DOI
Hermelin, Danny; Manoussakis, George; Pinedo, Michael; Shabtay, Dvir; Yedidsion, Liron Parameterized multi-scenario single-machine scheduling problems. (English) Zbl 1453.68095 Algorithmica 82, No. 9, 2644-2667 (2020). MSC: 68Q27 90B35 PDFBibTeX XMLCite \textit{D. Hermelin} et al., Algorithmica 82, No. 9, 2644--2667 (2020; Zbl 1453.68095) Full Text: DOI
Bulteau, Laurent; Hermelin, Danny; Knop, Dušan; Labarre, Anthony; Vialette, Stéphane The clever shopper problem. (English) Zbl 1434.68192 Theory Comput. Syst. 64, No. 1, 17-34 (2020). MSC: 68Q25 68Q17 68Q27 68W05 68W25 90C27 PDFBibTeX XMLCite \textit{L. Bulteau} et al., Theory Comput. Syst. 64, No. 1, 17--34 (2020; Zbl 1434.68192) Full Text: DOI
Chen, Jiehua; Hermelin, Danny; Sorge, Manuel On computing centroids according to the \(p\)-norms of Hamming distance vectors. (English) Zbl 07525465 Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 28, 16 p. (2019). MSC: 68Wxx PDFBibTeX XMLCite \textit{J. Chen} et al., LIPIcs -- Leibniz Int. Proc. Inform. 144, Article 28, 16 p. (2019; Zbl 07525465) Full Text: DOI arXiv
Hermelin, Danny; Shabtay, Dvir; Talmon, Nimrod On the parameterized tractability of the just-in-time flow-shop scheduling problem. (English) Zbl 1432.90058 J. Sched. 22, No. 6, 663-676 (2019). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{D. Hermelin} et al., J. Sched. 22, No. 6, 663--676 (2019; Zbl 1432.90058) Full Text: DOI arXiv
Hermelin, Danny; Mnich, Matthias; Van Leeuwen, Erik Jan; Woeginger, Gerhard Domination when the stars are out. (English) Zbl 1454.68104 ACM Trans. Algorithms 15, No. 2, Article No. 25, 90 p. (2019). MSC: 68R10 05C69 05C75 68Q17 68Q25 68Q27 PDFBibTeX XMLCite \textit{D. Hermelin} et al., ACM Trans. Algorithms 15, No. 2, Article No. 25, 90 p. (2019; Zbl 1454.68104) Full Text: DOI arXiv
Abboud, Amir; Bringmann, Karl; Hermelin, Danny; Shabtay, Dvir SETH-based lower bounds for subset sum and bicriteria path. (English) Zbl 1431.68040 Chan, Timothy M. (ed.), Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, SODA 2019, San Diego, CA, USA, January 6–9, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 41-57 (2019). MSC: 68Q17 PDFBibTeX XMLCite \textit{A. Abboud} et al., in: Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, SODA 2019, San Diego, CA, USA, January 6--9, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 41--57 (2019; Zbl 1431.68040) Full Text: DOI arXiv
Eiben, Eduard; Hermelin, Danny; Ramanujan, M. S. On approximate preprocessing for domination and hitting subgraphs with connected deletion sets. (English) Zbl 1425.68309 J. Comput. Syst. Sci. 105, 158-170 (2019). MSC: 68R10 68Q25 68W25 PDFBibTeX XMLCite \textit{E. Eiben} et al., J. Comput. Syst. Sci. 105, 158--170 (2019; Zbl 1425.68309) Full Text: DOI
Guo, Jiong (ed.); Hermelin, Danny (ed.) Foreword: Special issue on parameterized and exact computation. (English) Zbl 1411.68017 Algorithmica 81, No. 2, 419-420 (2019). MSC: 68-06 68Q25 00B25 PDFBibTeX XMLCite \textit{J. Guo} (ed.) and \textit{D. Hermelin} (ed.), Algorithmica 81, No. 2, 419--420 (2019; Zbl 1411.68017) Full Text: DOI
Hermelin, Danny; Pinedo, Michael; Shabtay, Dvir; Talmon, Nimrod On the parameterized tractability of single machine scheduling with rejection. (English) Zbl 1403.90332 Eur. J. Oper. Res. 273, No. 1, 67-73 (2019). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{D. Hermelin} et al., Eur. J. Oper. Res. 273, No. 1, 67--73 (2019; Zbl 1403.90332) Full Text: DOI
Chen, Jiehua; Hermelin, Danny; Sorge, Manuel; Yedidsion, Harel How hard is it to satisfy (almost) all roommates? (English) Zbl 1499.68131 Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 35, 15 p. (2018). MSC: 68Q17 68Q27 91B68 PDFBibTeX XMLCite \textit{J. Chen} et al., LIPIcs -- Leibniz Int. Proc. Inform. 107, Article 35, 15 p. (2018; Zbl 1499.68131) Full Text: DOI arXiv
Bulteau, Laurent; Hermelin, Danny; Labarre, Anthony; Vialette, Stéphane The clever shopper problem. (English) Zbl 1434.68193 Fomin, Fedor V. (ed.) et al., Computer science – theory and applications. 13th international computer science symposium in Russia, CSR 2018, Moscow, Russia, June 6–10, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10846, 53-64 (2018). MSC: 68Q25 68Q17 68Q27 68W05 68W25 90C27 PDFBibTeX XMLCite \textit{L. Bulteau} et al., Lect. Notes Comput. Sci. 10846, 53--64 (2018; Zbl 1434.68193) Full Text: DOI arXiv
Fernau, Henning; Fluschnik, Till; Hermelin, Danny; Krebs, Andreas; Molter, Hendrik; Niedermeier, Rolf Diminishable parameterized problems and strict polynomial kernelization. (English) Zbl 1485.68116 Manea, Florin (ed.) et al., Sailing routes in the world of computation. 14th conference on computability in Europe, CiE 2018, Kiel, Germany, July 30 – August 3, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10936, 161-171 (2018). MSC: 68Q27 68Q17 PDFBibTeX XMLCite \textit{H. Fernau} et al., Lect. Notes Comput. Sci. 10936, 161--171 (2018; Zbl 1485.68116) Full Text: DOI arXiv
Fluschnik, Till; Hermelin, Danny; Nichterlein, André; Niedermeier, Rolf Fractals for kernelization lower bounds. (English) Zbl 1388.68112 SIAM J. Discrete Math. 32, No. 1, 656-681 (2018). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{T. Fluschnik} et al., SIAM J. Discrete Math. 32, No. 1, 656--681 (2018; Zbl 1388.68112) Full Text: DOI arXiv
Eiben, Eduard; Hermelin, Danny; Ramanujan, M. S. Lossy kernels for hitting subgraphs. (English) Zbl 1441.68175 Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 67, 14 p. (2017). MSC: 68R10 68Q27 68W25 68W40 PDFBibTeX XMLCite \textit{E. Eiben} et al., LIPIcs -- Leibniz Int. Proc. Inform. 83, Article 67, 14 p. (2017; Zbl 1441.68175) Full Text: DOI
Cygan, Marek; Grandoni, Fabrizio; Hermelin, Danny Tight kernel bounds for problems on graphs with small degeneracy. (English) Zbl 1451.68137 ACM Trans. Algorithms 13, No. 3, Article No. 43, 22 p. (2017). MSC: 68Q27 68R10 PDFBibTeX XMLCite \textit{M. Cygan} et al., ACM Trans. Algorithms 13, No. 3, Article No. 43, 22 p. (2017; Zbl 1451.68137) Full Text: DOI arXiv
Guo, Jiong (ed.); Hermelin, Danny (ed.) 11th international symposium on parameterized and exact computation (IPEC 2016), Aarhus, Denmark, August 24–26, 2016. Proceedings. (English) Zbl 1360.68013 LIPIcs – Leibniz International Proceedings in Informatics 63. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-023-1). xiv, 30 articles, not consecutively paged, electronic only, open access (2017). MSC: 68-06 68Q25 68Wxx 00B25 PDFBibTeX XMLCite \textit{J. Guo} (ed.) and \textit{D. Hermelin} (ed.), 11th international symposium on parameterized and exact computation (IPEC 2016), Aarhus, Denmark, August 24--26, 2016. Proceedings. Wadern: Schloss Dagstuhl -- Leibniz Zentrum für Informatik (2017; Zbl 1360.68013) Full Text: Link
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances; Shachnai, Hadas Tractable parameterizations for the minimum linear arrangement problem. (English) Zbl 1427.68118 ACM Trans. Comput. Theory 8, No. 2, Article No. 6, 12 p. (2016). MSC: 68Q25 05C85 68R10 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., ACM Trans. Comput. Theory 8, No. 2, Article No. 6, 12 p. (2016; Zbl 1427.68118) Full Text: DOI
Benshahar, Arnon; Chalifa-Caspi, Vered; Hermelin, Danny; Ziv-Ukelson, Michal A biclique approach to reference anchored gene blocks and its applications to pathogenicity islands. (English) Zbl 1383.92024 Frith, Martin (ed.) et al., Algorithms in bioinformatics. 16th international workshop, WABI 2016, Aarhus, Denmark, August 22–24, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-43680-7/pbk; 978-3-319-43681-4/ebook). Lecture Notes in Computer Science 9838. Lecture Notes in Bioinformatics, 14-26 (2016). MSC: 92C40 92D20 92D25 92-08 05C90 PDFBibTeX XMLCite \textit{A. Benshahar} et al., Lect. Notes Comput. Sci. 9838, 14--26 (2016; Zbl 1383.92024) Full Text: DOI
Fluschnik, Till; Hermelin, Danny; Nichterlein, André; Niedermeier, Rolf Fractals for kernelization lower bounds, with an application to length-bounded cut problems. (English) Zbl 1388.68111 Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 25, 14 p. (2016). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{T. Fluschnik} et al., LIPIcs -- Leibniz Int. Proc. Inform. 55, Article 25, 14 p. (2016; Zbl 1388.68111) Full Text: DOI
Hermelin, Danny; Kaspi, Moshe; Komusiewicz, Christian; Navon, Barak Parameterized complexity of critical node cuts. (English) Zbl 1359.68135 Theor. Comput. Sci. 651, 62-75 (2016). MSC: 68Q25 05C40 05C85 PDFBibTeX XMLCite \textit{D. Hermelin} et al., Theor. Comput. Sci. 651, 62--75 (2016; Zbl 1359.68135) Full Text: DOI
Bringmann, Karl; Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan Parameterized complexity dichotomy for Steiner Multicut. (English) Zbl 1342.68155 J. Comput. Syst. Sci. 82, No. 6, 1020-1043 (2016). MSC: 68Q25 05C40 05C70 68Q17 PDFBibTeX XMLCite \textit{K. Bringmann} et al., J. Comput. Syst. Sci. 82, No. 6, 1020--1043 (2016; Zbl 1342.68155) Full Text: DOI arXiv
Hermelin, Danny; Kaspi, Moshe; Komusiewicz, Christian; Navon, Barak Parameterized complexity of critical node cuts. (English) Zbl 1378.68081 Husfeldt, Thore (ed.) et al., 10th international symposium on parameterized and exact computation, IPEC 2015, Patras, Greece, September 16–18, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-92-7). LIPIcs – Leibniz International Proceedings in Informatics 43, 343-354 (2015). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{D. Hermelin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 43, 343--354 (2015; Zbl 1378.68081) Full Text: DOI arXiv
Hermelin, Danny; Kubitza, Judith-Madeleine; Shabtay, Dvir; Talmon, Nimrod; Woeginger, Gerhard Scheduling two competing agents when one agent has significantly fewer jobs. (English) Zbl 1378.68021 Husfeldt, Thore (ed.) et al., 10th international symposium on parameterized and exact computation, IPEC 2015, Patras, Greece, September 16–18, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-92-7). LIPIcs – Leibniz International Proceedings in Informatics 43, 55-65 (2015). MSC: 68M20 68Q17 68Q25 PDFBibTeX XMLCite \textit{D. Hermelin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 43, 55--65 (2015; Zbl 1378.68021) Full Text: DOI
Bringmann, Karl; Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan Parameterized complexity dichotomy for Steiner Multicut. (English) Zbl 1355.68113 Mayr, Ernst W. (ed.) et al., 32nd international symposium on theoretical aspects of computer science, STACS’15, Garching, Germany, March 4–7, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-78-1). LIPIcs – Leibniz International Proceedings in Informatics 30, 157-170 (2015). MSC: 68Q25 05C40 05C70 68Q17 PDFBibTeX XMLCite \textit{K. Bringmann} et al., LIPIcs -- Leibniz Int. Proc. Inform. 30, 157--170 (2015; Zbl 1355.68113) Full Text: DOI
Gagie, Travis; Hermelin, Danny; Landau, Gad M.; Weimann, Oren Binary jumbled pattern matching on trees and tree-like structures. (English) Zbl 1330.68358 Algorithmica 73, No. 3, 571-588 (2015). MSC: 68W32 PDFBibTeX XMLCite \textit{T. Gagie} et al., Algorithmica 73, No. 3, 571--588 (2015; Zbl 1330.68358) Full Text: DOI arXiv
Hermelin, Danny; Rozenberg, Liat Parameterized complexity analysis for the closest string with wildcards problem. (English) Zbl 1329.68143 Theor. Comput. Sci. 600, 11-18 (2015). MSC: 68Q25 68W32 PDFBibTeX XMLCite \textit{D. Hermelin} and \textit{L. Rozenberg}, Theor. Comput. Sci. 600, 11--18 (2015; Zbl 1329.68143) Full Text: DOI
Fountoulakis, Nikolaos; Friedrich, Tobias; Hermelin, Danny On the average-case complexity of parameterized clique. (English) Zbl 1312.68100 Theor. Comput. Sci. 576, 18-29 (2015). MSC: 68Q25 05C69 05C85 PDFBibTeX XMLCite \textit{N. Fountoulakis} et al., Theor. Comput. Sci. 576, 18--29 (2015; Zbl 1312.68100) Full Text: DOI arXiv
Hermelin, Danny; Kratsch, Stefan; Sołtys, Karolina; Wahlström, Magnus; Wu, Xi A completeness theory for polynomial (Turing) kernelization. (English) Zbl 1312.68102 Algorithmica 71, No. 3, 702-730 (2015). MSC: 68Q25 68Q15 68Q17 PDFBibTeX XMLCite \textit{D. Hermelin} et al., Algorithmica 71, No. 3, 702--730 (2015; Zbl 1312.68102) Full Text: DOI
Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan Parameterized complexity of induced graph matching on claw-free graphs. (English) Zbl 1306.05163 Algorithmica 70, No. 3, 513-560 (2014). MSC: 05C60 05C70 05C69 68Q25 68P05 PDFBibTeX XMLCite \textit{D. Hermelin} et al., Algorithmica 70, No. 3, 513--560 (2014; Zbl 1306.05163) Full Text: DOI
Hermelin, Danny; Mestre, Julián; Rawitz, Dror Optimization problems in dotted interval graphs. (English) Zbl 1298.05172 Discrete Appl. Math. 174, 66-72 (2014). MSC: 05C35 05C69 05C85 PDFBibTeX XMLCite \textit{D. Hermelin} et al., Discrete Appl. Math. 174, 66--72 (2014; Zbl 1298.05172) Full Text: DOI
Hermelin, Danny; Rozenberg, Liat Parameterized complexity analysis for the closest string with wildcards problem. (English) Zbl 1407.68225 Kulikov, Alexander S. (ed.) et al., Combinatorial pattern matching. 25th annual symposium, CPM 2014, Moscow, Russia, June 16–18, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8486, 140-149 (2014). MSC: 68Q25 68W32 PDFBibTeX XMLCite \textit{D. Hermelin} and \textit{L. Rozenberg}, Lect. Notes Comput. Sci. 8486, 140--149 (2014; Zbl 1407.68225) Full Text: DOI
Guo, Jiong; Hermelin, Danny; Komusiewicz, Christian Local search for string problems: brute-force is essentially optimal. (English) Zbl 1358.68340 Theor. Comput. Sci. 525, 30-41 (2014). MSC: 68W32 68Q25 PDFBibTeX XMLCite \textit{J. Guo} et al., Theor. Comput. Sci. 525, 30--41 (2014; Zbl 1358.68340) Full Text: DOI
Hermelin, Danny; Kratsch, Stefan; Sołtys, Karolina; Wahlström, Magnus; Wu, Xi A completeness theory for polynomial (Turing) kernelization. (English) Zbl 1407.68224 Gutin, Gregory (ed.) et al., Parameterized and exact computation. 8th international symposium, IPEC 2013, Sophia Antipolis, France, September 4–6, 2013. Revised selected papers. Berlin: Springer. Lect. Notes Comput. Sci. 8246, 202-215 (2013). MSC: 68Q25 68Q15 68Q17 PDFBibTeX XMLCite \textit{D. Hermelin} et al., Lect. Notes Comput. Sci. 8246, 202--215 (2013; Zbl 1407.68224) Full Text: DOI
Gagie, Travis; Hermelin, Danny; Landau, Gad M.; Weimann, Oren Binary jumbled pattern matching on trees and tree-like structures. (English) Zbl 1323.68634 Bodlaender, Hans L. (ed.) et al., Algorithms – ESA 2013. 21st annual European symposium, Sophia Antipolis, France, September 2–4, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40449-8/pbk). Lecture Notes in Computer Science 8125, 517-528 (2013). MSC: 68W32 PDFBibTeX XMLCite \textit{T. Gagie} et al., Lect. Notes Comput. Sci. 8125, 517--528 (2013; Zbl 1323.68634) Full Text: DOI
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances A.; Shachnai, Hadas Tractable parameterizations for the minimum linear arrangement problem. (English) Zbl 1394.68441 Bodlaender, Hans L. (ed.) et al., Algorithms – ESA 2013. 21st annual European symposium, Sophia Antipolis, France, September 2–4, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40449-8/pbk). Lecture Notes in Computer Science 8125, 457-468 (2013). MSC: 68W25 05C62 05C85 68R10 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Lect. Notes Comput. Sci. 8125, 457--468 (2013; Zbl 1394.68441) Full Text: DOI
Cygan, Marek; Grandoni, Fabrizio; Hermelin, Danny Tight kernel bounds for problems on graphs with small degeneracy (extended abstract). (English) Zbl 1394.68173 Bodlaender, Hans L. (ed.) et al., Algorithms – ESA 2013. 21st annual European symposium, Sophia Antipolis, France, September 2–4, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40449-8/pbk). Lecture Notes in Computer Science 8125, 361-372 (2013). MSC: 68Q27 68R10 PDFBibTeX XMLCite \textit{M. Cygan} et al., Lect. Notes Comput. Sci. 8125, 361--372 (2013; Zbl 1394.68173) Full Text: DOI
Guo, Jiong; Hermelin, Danny; Komusiewicz, Christian Local search for string problems: brute force is essentially optimal. (English) Zbl 1381.68314 Fischer, Johannes (ed.) et al., Combinatorial pattern matching. 24th annual symposium, CPM 2013, Bad Herrenalb, Germany, June 17–19, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38904-7/pbk). Lecture Notes in Computer Science 7922, 130-141 (2013). MSC: 68W32 68P10 PDFBibTeX XMLCite \textit{J. Guo} et al., Lect. Notes Comput. Sci. 7922, 130--141 (2013; Zbl 1381.68314) Full Text: DOI
Hermelin, Danny; Huang, Chien-Chung; Kratsch, Stefan; Wahlström, Magnus Parameterized two-player Nash equilibrium. (English) Zbl 1272.68142 Algorithmica 65, No. 4, 802-816 (2013). MSC: 68Q17 91A05 PDFBibTeX XMLCite \textit{D. Hermelin} et al., Algorithmica 65, No. 4, 802--816 (2013; Zbl 1272.68142) Full Text: DOI arXiv
Hermelin, Danny; Landau, Gad M.; Landau, Shir; Weimann, Oren Unified compression-based acceleration of edit-distance computation. (English) Zbl 1259.68048 Algorithmica 65, No. 2, 339-353 (2013). MSC: 68P30 68W05 90C39 PDFBibTeX XMLCite \textit{D. Hermelin} et al., Algorithmica 65, No. 2, 339--353 (2013; Zbl 1259.68048) Full Text: DOI arXiv
Fellows, Michael; Friedrich, Tobias; Hermelin, Danny; Narodytska, Nina; Rosamond, Frances Constraint satisfaction problems: convexity makes AllDifferent constraints tractable. (English) Zbl 1257.68079 Theor. Comput. Sci. 472, 81-89 (2013). MSC: 68Q25 90C27 90C25 PDFBibTeX XMLCite \textit{M. Fellows} et al., Theor. Comput. Sci. 472, 81--89 (2013; Zbl 1257.68079) Full Text: DOI
Hermelin, Danny; Wu, Xi Weak compositions and their applications to polynomial lower bounds for kernelization. (English) Zbl 1421.68086 Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 104-113 (2012). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{D. Hermelin} and \textit{X. Wu}, in: Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17--19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 104--113 (2012; Zbl 1421.68086) Full Text: Link
Hermelin, Danny; Rizzi, Romeo; Vialette, Stéphane Algorithmic aspects of the intersection and overlap numbers of a graph. (English) Zbl 1260.68177 Chao, Kun-Mao (ed.) et al., Algorithms and computation. 23rd international symposium, ISAAC 2012, Taipei, Taiwan, December 19–21, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-35260-7/pbk). Lecture Notes in Computer Science 7676, 465-474 (2012). MSC: 68Q25 05C35 68Q17 PDFBibTeX XMLCite \textit{D. Hermelin} et al., Lect. Notes Comput. Sci. 7676, 465--474 (2012; Zbl 1260.68177) Full Text: DOI
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances A. Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications. (English) Zbl 1264.05131 Algorithmica 64, No. 1, 3-18 (2012). Reviewer: Haiko Müller (Leeds) MSC: 05C83 06A06 68R10 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Algorithmica 64, No. 1, 3--18 (2012; Zbl 1264.05131) Full Text: DOI
Hermelin, Danny; Mestre, Julián; Rawitz, Dror Optimization problems in dotted interval graphs. (English) Zbl 1341.05190 Golumbic, Martin Charles (ed.) et al., Graph-theoretic concepts in computer science. 38th international workshop, WG 2012, Jerusalem, Israel, June 26–28, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-34610-1/pbk). Lecture Notes in Computer Science 7551, 46-56 (2012). MSC: 05C69 05C70 PDFBibTeX XMLCite \textit{D. Hermelin} et al., Lect. Notes Comput. Sci. 7551, 46--56 (2012; Zbl 1341.05190) Full Text: DOI
Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan Parameterized complexity of induced \(H\)-matching on claw-free graphs. (English) Zbl 1365.68282 Epstein, Leah (ed.) et al., Algorithms – ESA 2012. 20th annual European symposium, Ljubljana, Slovenia, September 10–12, 2012. Proceeding. Berlin: Springer (ISBN 978-3-642-33089-6/pbk). Lecture Notes in Computer Science 7501, 624-635 (2012). MSC: 68Q25 05C70 05C75 05C85 PDFBibTeX XMLCite \textit{D. Hermelin} et al., Lect. Notes Comput. Sci. 7501, 624--635 (2012; Zbl 1365.68282) Full Text: DOI arXiv
Nor, Igor; Hermelin, Danny; Charlat, Sylvain; Engelstadter, Jan; Reuter, Max; Duron, Olivier; Sagot, Marie-France Mod/Resc parsimony inference: theory and application. (English) Zbl 1237.92041 Inf. Comput. 213, 23-32 (2012). MSC: 92C60 05C90 65Y20 PDFBibTeX XMLCite \textit{I. Nor} et al., Inf. Comput. 213, 23--32 (2012; Zbl 1237.92041) Full Text: DOI
Ben-Zwi, Oren; Hermelin, Danny; Lokshtanov, Daniel; Newman, Ilan Treewidth governs the complexity of target set selection. (English) Zbl 1248.90068 Discrete Optim. 8, No. 1, 87-96 (2011). MSC: 90C35 90C27 PDFBibTeX XMLCite \textit{O. Ben-Zwi} et al., Discrete Optim. 8, No. 1, 87--96 (2011; Zbl 1248.90068) Full Text: DOI
Hermelin, Danny; Huang, Chien-Chung; Kratsch, Stefan; Wahlström, Magnus Parameterized two-player Nash equilibrium. (English) Zbl 1341.05160 Kolman, Petr (ed.) et al., Graph-theoretic concepts in computer science. 37th international workshop, WG 2011, Teplá Monastery, Czech Republic, June 21–24, 2011. Revised papers. Berlin: Springer (ISBN 978-3-642-25869-5/pbk). Lecture Notes in Computer Science 6986, 215-226 (2011). MSC: 05C57 91A43 91A05 PDFBibTeX XMLCite \textit{D. Hermelin} et al., Lect. Notes Comput. Sci. 6986, 215--226 (2011; Zbl 1341.05160) Full Text: DOI arXiv
Bar-Yehuda, Reuven; Hermelin, Danny; Rawitz, Dror Minimum vertex cover in rectangle graphs. (English) Zbl 1225.05199 Comput. Geom. 44, No. 6-7, 356-364 (2011). MSC: 05C70 05C35 05C10 68W25 PDFBibTeX XMLCite \textit{R. Bar-Yehuda} et al., Comput. Geom. 44, No. 6--7, 356--364 (2011; Zbl 1225.05199) Full Text: DOI
Hermelin, Danny; Levy, Avivit; Weimann, Oren; Yuster, Raphael Distance oracles for vertex-labeled graphs. (English) Zbl 1333.68212 Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4–8, 2011. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-22011-1/pbk). Lecture Notes in Computer Science 6756, 490-501 (2011). MSC: 68R10 05C78 68P05 PDFBibTeX XMLCite \textit{D. Hermelin} et al., Lect. Notes Comput. Sci. 6756, 490--501 (2011; Zbl 1333.68212) Full Text: DOI
Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan; Woeginger, Gerhard J. Domination when the stars are out. (English) Zbl 1334.68160 Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4–8, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-22005-0/pbk). Lecture Notes in Computer Science 6755, 462-473 (2011). MSC: 68R10 05C69 05C75 68Q17 68Q25 PDFBibTeX XMLCite \textit{D. Hermelin} et al., Lect. Notes Comput. Sci. 6755, 462--473 (2011; Zbl 1334.68160) Full Text: DOI arXiv
Fellows, Michael R.; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane Upper and lower bounds for finding connected motifs in vertex-colored graphs. (English) Zbl 1210.68060 J. Comput. Syst. Sci. 77, No. 4, 799-811 (2011). MSC: 68Q25 05C15 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., J. Comput. Syst. Sci. 77, No. 4, 799--811 (2011; Zbl 1210.68060) Full Text: DOI
Hermelin, Danny; Rawitz, Dror Optimization problems in multiple subtree graphs. (English) Zbl 1213.05247 Discrete Appl. Math. 159, No. 7, 588-594 (2011). MSC: 05C85 68W25 PDFBibTeX XMLCite \textit{D. Hermelin} and \textit{D. Rawitz}, Discrete Appl. Math. 159, No. 7, 588--594 (2011; Zbl 1213.05247) Full Text: DOI
Butman, Ayelet; Hermelin, Danny; Lewenstein, Moshe; Rawitz, Dror Optimization problems in multiple-interval graphs. (English) Zbl 1300.05295 ACM Trans. Algorithms 6, No. 2, Article No. 40, 18 p. (2010). MSC: 05C85 05C62 05C70 68Q17 68W25 90C35 PDFBibTeX XMLCite \textit{A. Butman} et al., ACM Trans. Algorithms 6, No. 2, Article No. 40, 18 p. (2010; Zbl 1300.05295) Full Text: DOI
Bar-Yehuda, Reuven; Hermelin, Danny; Rawitz, Dror An extension of the Nemhauser-Trotter theorem to generalized vertex cover with applications. (English) Zbl 1207.68442 SIAM J. Discrete Math. 24, No. 1, 287-300 (2010). MSC: 68W25 05C85 68W40 90C27 PDFBibTeX XMLCite \textit{R. Bar-Yehuda} et al., SIAM J. Discrete Math. 24, No. 1, 287--300 (2010; Zbl 1207.68442) Full Text: DOI
Bar-Yehuda, Reuven; Hermelin, Danny; Rawitz, Dror Minimum vertex cover in rectangle graphs. (English) Zbl 1287.05143 de Berg, Mark (ed.) et al., Algorithms – ESA 2010. 18th annual European symposium, Liverpool, UK, September 6–8, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-15774-5/pbk). Lecture Notes in Computer Science 6346, 255-266 (2010). MSC: 05C85 05C70 68W25 PDFBibTeX XMLCite \textit{R. Bar-Yehuda} et al., Lect. Notes Comput. Sci. 6346, 255--266 (2010; Zbl 1287.05143) Full Text: DOI Link
Nor, Igor; Hermelin, Danny; Charlat, Sylvain; Engelstadter, Jan; Reuter, Max; Duron, Olivier; Sagot, Marie-France Mod/Resc parsimony inference. (English) Zbl 1286.92016 Amir, Amihood (ed.) et al., Combinatorial pattern matching. 21st annual symposium, CPM 2010, New York, NY, USA, June 21–23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13508-8/pbk). Lecture Notes in Computer Science 6129, 202-213 (2010). MSC: 92-08 05C70 05C85 68Q17 92D40 PDFBibTeX XMLCite \textit{I. Nor} et al., Lect. Notes Comput. Sci. 6129, 202--213 (2010; Zbl 1286.92016) Full Text: DOI arXiv
Fertin, Guillaume; Hermelin, Danny; Rizzi, Romeo; Vialette, Stéphane Finding common structured patterns in linear graphs. (English) Zbl 1209.68367 Theor. Comput. Sci. 411, No. 26-28, 2475-2486 (2010). MSC: 68R10 PDFBibTeX XMLCite \textit{G. Fertin} et al., Theor. Comput. Sci. 411, No. 26--28, 2475--2486 (2010; Zbl 1209.68367) Full Text: DOI HAL
Hermelin, Danny; Rawitz, Dror Optimization problems in multiple subtree graphs. (English) Zbl 1284.68669 Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 7th international workshop, WAOA 2009, Copenhagen, Denmark, September 10–11, 2009. Revised papers. Berlin: Springer (ISBN 978-3-642-12449-5/pbk). Lecture Notes in Computer Science 5893, 194-204 (2010). MSC: 68W25 05C85 90C27 90C35 PDFBibTeX XMLCite \textit{D. Hermelin} and \textit{D. Rawitz}, Lect. Notes Comput. Sci. 5893, 194--204 (2010; Zbl 1284.68669) Full Text: DOI
Bar-Yehuda, Reuven; Hermelin, Danny; Rawitz, Dror Extension of the Nemhauser and Trotter theorem to generalized vertex cover with applications. (English) Zbl 1284.68653 Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 7th international workshop, WAOA 2009, Copenhagen, Denmark, September 10–11, 2009. Revised papers. Berlin: Springer (ISBN 978-3-642-12449-5/pbk). Lecture Notes in Computer Science 5893, 13-24 (2010). MSC: 68W25 05C85 68R10 PDFBibTeX XMLCite \textit{R. Bar-Yehuda} et al., Lect. Notes Comput. Sci. 5893, 13--24 (2010; Zbl 1284.68653) Full Text: DOI
Fellows, Michael; Flum, Jörg; Hermelin, Danny; Müller, Moritz; Rosamond, Frances W-hierarchies defined by symmetric gates. (English) Zbl 1211.68217 Theory Comput. Syst. 46, No. 2, 311-339 (2010). MSC: 68Q25 68T20 68M07 PDFBibTeX XMLCite \textit{M. Fellows} et al., Theory Comput. Syst. 46, No. 2, 311--339 (2010; Zbl 1211.68217) Full Text: DOI
Hermelin, Danny; Landau, Gad M.; Landau, Shir; Weimann, Oren A unified algorithm for accelerating edit-distance computation via text-compression. (English) Zbl 1236.68308 Albers, Susanne (ed.) et al., STACS 2009. 26th international symposium on theoretical aspects of computer science, Freiburg, Germany, February 26–28, 2009. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-09-5). LIPIcs – Leibniz International Proceedings in Informatics 3, 529-540, electronic only (2009). MSC: 68W32 90C39 68P30 PDFBibTeX XMLCite \textit{D. Hermelin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 3, 529--540 (2009; Zbl 1236.68308) Full Text: DOI Link
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances A. Well-quasi-orders in subclasses of bounded treewidth graphs. (English) Zbl 1264.68120 Chen, Jianer (ed.) et al., Parameterized and exact computation. 4th international workshop, IWPEC 2009, Copenhagen, Denmark, September 10–11, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-11268-3/pbk). Lecture Notes in Computer Science 5917, 149-160 (2009). MSC: 68R10 05C85 06A99 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Lect. Notes Comput. Sci. 5917, 149--160 (2009; Zbl 1264.68120) Full Text: DOI
Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Hermelin, Danny On problems without polynomial kernels. (English) Zbl 1192.68288 J. Comput. Syst. Sci. 75, No. 8, 423-434 (2009). MSC: 68Q15 68Q17 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., J. Comput. Syst. Sci. 75, No. 8, 423--434 (2009; Zbl 1192.68288) Full Text: DOI
Fellows, Michael R.; Hartman, Tzvika; Hermelin, Danny; Landau, Gad M.; Rosamond, Frances; Rozenberg, Liat Haplotype inference constrained by plausible haplotype data. (English) Zbl 1247.92017 Kucherov, Gregory (ed.) et al., Combinatorial pattern matching. 20th annual symposium, CPM 2009, Lille, France, June 22–24, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02440-5/pbk). Lecture Notes in Computer Science 5577, 339-352 (2009). MSC: 92D10 92C40 92D15 65Y20 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Lect. Notes Comput. Sci. 5577, 339--352 (2009; Zbl 1247.92017) Full Text: DOI
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances; Vialette, Stéphane On the parameterized complexity of multiple-interval graph problems. (English) Zbl 1161.68038 Theor. Comput. Sci. 410, No. 1, 53-61 (2009). MSC: 68R10 05C69 05C70 05C85 68Q17 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Theor. Comput. Sci. 410, No. 1, 53--61 (2009; Zbl 1161.68038) Full Text: DOI
Blin, Guillaume; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. (English) Zbl 1154.05326 J. Discrete Algorithms 6, No. 4, 618-626 (2008). MSC: 05C85 92D10 68Q25 PDFBibTeX XMLCite \textit{G. Blin} et al., J. Discrete Algorithms 6, No. 4, 618--626 (2008; Zbl 1154.05326) Full Text: DOI
Hermelin, Danny; Rawitz, Dror; Rizzi, Romeo; Vialette, Stéphane The minimum substring cover problem. (English) Zbl 1162.90592 Inf. Comput. 206, No. 11, 1303-1312 (2008). MSC: 90C59 PDFBibTeX XMLCite \textit{D. Hermelin} et al., Inf. Comput. 206, No. 11, 1303--1312 (2008; Zbl 1162.90592) Full Text: DOI
Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Hermelin, Danny On problems without polynomial kernels (extended abstract). (English) Zbl 1153.68554 Aceto, Luca (ed.) et al., Automata, languages and programming. 35th international colloquium, ICALP 2008, Reykjavik, Iceland, July 7–11, 2008. Proceedings, Part I. Berlin: Springer (ISBN 978-3-540-70574-1/pbk). Lecture Notes in Computer Science 5125, 563-574 (2008). MSC: 68W05 68Q25 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., Lect. Notes Comput. Sci. 5125, 563--574 (2008; Zbl 1153.68554) Full Text: DOI
Crochemore, Maxime; Hermelin, Danny; Landau, Gad M.; Rawitz, Dror; Vialette, Stéphane Approximating the 2-interval pattern problem. (English) Zbl 1142.68070 Theor. Comput. Sci. 395, No. 2-3, 283-297 (2008). MSC: 68W20 PDFBibTeX XMLCite \textit{M. Crochemore} et al., Theor. Comput. Sci. 395, No. 2--3, 283--297 (2008; Zbl 1142.68070) Full Text: DOI Link
Gotthilf, Zvi; Hermelin, Danny; Lewenstein, Moshe Constrained LCS: Hardness and approximation. (English) Zbl 1143.68637 Ferragina, Paolo (ed.) et al., Combinatorial pattern matching. 19th annual symposium, CPM 2008, Pisa, Italy, June 18–20, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-69066-5/pbk). Lecture Notes in Computer Science 5029, 255-262 (2008). MSC: 68W25 68Q25 PDFBibTeX XMLCite \textit{Z. Gotthilf} et al., Lect. Notes Comput. Sci. 5029, 255--262 (2008; Zbl 1143.68637) Full Text: DOI
Fellows, Michael; Hermelin, Danny; Müller, Moritz; Rosamond, Frances A purely democratic characterization of W[1]. (English) Zbl 1142.68359 Grohe, Martin (ed.) et al., Parameterized and exact computation. Third international workshop, IWPEC 2008, Victoria, Canada, May 14–16, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79722-7/pbk). Lecture Notes in Computer Science 5018, 103-114 (2008). MSC: 68Q15 94C10 PDFBibTeX XMLCite \textit{M. Fellows} et al., Lect. Notes Comput. Sci. 5018, 103--114 (2008; Zbl 1142.68359) Full Text: DOI
Hermelin, Danny; Rawitz, Dror; Rizzi, Romeo; Vialette, Stéphane The minimum substring cover problem. (English) Zbl 1130.68100 Kaklamanis, Christos (ed.) et al., Approximation and online algorithms. 5th international workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised papers. Berlin: Springer (ISBN 978-3-540-77917-9/pbk). Lecture Notes in Computer Science 4927, 170-183 (2008). MSC: 68W25 68Q45 92D20 PDFBibTeX XMLCite \textit{D. Hermelin} et al., Lect. Notes Comput. Sci. 4927, 170--183 (2008; Zbl 1130.68100) Full Text: DOI
Butman, Ayelet; Hermelin, Danny; Lewenstein, Moshe; Rawitz, Dror Optimization problems in multiple-interval graphs. (English) Zbl 1302.05179 Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2007, New Orleans, LA, USA, January 7–9, 2007. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-89871-624-5). 268-277 (2007). MSC: 05C85 05C62 05C69 05C70 68Q25 90C35 PDFBibTeX XMLCite \textit{A. Butman} et al., in: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2007, New Orleans, LA, USA, January 7--9, 2007. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 268--277 (2007; Zbl 1302.05179)
Fertin, Guillaume; Hermelin, Danny; Rizzi, Romeo; Vialette, Stéphane Common structured patterns in linear graphs: Approximation and combinatorics. (English) Zbl 1138.68476 Ma, Bin (ed.) et al., Combinatorial pattern matching. 18th annual symposium, CPM 2007, London, Canada, July 9–11, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73436-9/pbk). Lecture Notes in Computer Science 4580, 241-252 (2007). MSC: 68R10 92-08 92C40 PDFBibTeX XMLCite \textit{G. Fertin} et al., Lect. Notes Comput. Sci. 4580, 241--252 (2007; Zbl 1138.68476) Full Text: DOI
Fellows, Michael R.; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane Sharp tractability borderlines for finding connected motifs in vertex-colored graphs. (English) Zbl 1171.68497 Arge, Lars (ed.) et al., Automata, languages and programming. 34th international colloquium, ICALP 2007, Wrocław, Poland, July 9–13, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73419-2/pbk). Lecture Notes in Computer Science 4596, 340-351 (2007). MSC: 68Q25 05C15 92D20 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Lect. Notes Comput. Sci. 4596, 340--351 (2007; Zbl 1171.68497) Full Text: DOI
Backofen, Rolf; Hermelin, Danny; Landau, Gad M.; Weimann, Oren Local alignment of RNA sequences with arbitrary scoring schemes. (English) Zbl 1196.68341 Lewenstein, Moshe (ed.) et al., Combinatorial pattern matching. 17th annual symposium, CPM 2006, Barcelona, Spain, July 5–7, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-35455-0/pbk). Lecture Notes in Computer Science 4009, 246-257 (2006). MSC: 68W32 92-08 92D20 PDFBibTeX XMLCite \textit{R. Backofen} et al., Lect. Notes Comput. Sci. 4009, 246--257 (2006; Zbl 1196.68341) Full Text: DOI
Blin, Guillaume; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. (English) Zbl 1171.92316 Kratsch, Dieter (ed.), Graph-theoretic concepts in computer science. 31st international workshop, WG 2005, Metz, France, June 23–25, 2005. Revised selected papers. Berlin: Springer (ISBN 3-540-31000-2/pbk). Lecture Notes in Computer Science 3787, 271-282 (2005). MSC: 92C40 68Q25 92-08 PDFBibTeX XMLCite \textit{G. Blin} et al., Lect. Notes Comput. Sci. 3787, 271--282 (2005; Zbl 1171.92316) Full Text: DOI
Crochemore, Maxime; Hermelin, Danny; Landau, Gad M.; Vialette, Stéphane Approximating the 2-interval pattern problem. (English) Zbl 1123.68143 Brodal, Gerth Stølting (ed.) et al., Algorithms – ESA 2005. 13th annual European symposium, Palma de Mallorca, Spain, October 3–6, 2005. Proceedings. Berlin: Springer (ISBN 3-540-29118-0/pbk). Lecture Notes in Computer Science 3669, 426-437 (2005). MSC: 68W25 92D20 PDFBibTeX XMLCite \textit{M. Crochemore} et al., Lect. Notes Comput. Sci. 3669, 426--437 (2005; Zbl 1123.68143) Full Text: DOI