| On problems without polynomial kernels HL Bodlaender, RG Downey, MR Fellows, D Hermelin Journal of Computer and System Sciences 75 (8), 423-434, 2009 | 634 | 2009 |
| On the parameterized complexity of multiple-interval graph problems MR Fellows, D Hermelin, F Rosamond, S Vialette Theoretical Computer Science 410 (1), 53-61, 2009 | 395 | 2009 |
| Treewidth governs the complexity of target set selection O Ben-Zwi, D Hermelin, D Lokshtanov, I Newman Discrete Optimization 8 (1), 87-96, 2011 | 135 | 2011 |
| SETH-based lower bounds for subset sum and bicriteria path A Abboud, K Bringmann, D Hermelin, D Shabtay ACM Transactions on Algorithms (TALG) 18 (1), 1-22, 2022 | 93 | 2022 |
| Optimization problems in multiple-interval graphs A Butman, D Hermelin, M Lewenstein, D Rawitz ACM Transactions on Algorithms (TALG) 6 (2), 1-18, 2010 | 87 | 2010 |
| Weak compositions and their applications to polynomial lower bounds for kernelization D Hermelin, X Wu Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 82 | 2012 |
| Upper and lower bounds for finding connected motifs in vertex-colored graphs MR Fellows, G Fertin, D Hermelin, S Vialette Journal of Computer and System Sciences 77 (4), 799-811, 2011 | 82 | 2011 |
| Sharp tractability borderlines for finding connected motifs in vertex-colored graphs MR Fellows, G Fertin, D Hermelin, S Vialette International Colloquium on Automata, Languages, and Programming, 340-351, 2007 | 82 | 2007 |
| A completeness theory for polynomial (Turing) kernelization D Hermelin, S Kratsch, K Sołtys, M Wahlström, X Wu Algorithmica 71, 702-730, 2015 | 76 | 2015 |
| A unified algorithm for accelerating edit-distance computation via text-compression D Hermelin, GM Landau, S Landau, O Weimann arXiv preprint arXiv:0902.2649, 2009 | 72 | 2009 |
| Approximating the 2-interval pattern problem M Crochemore, D Hermelin, GM Landau, D Rawitz, S Vialette Theoretical Computer Science 395 (2), 283-297, 2008 | 60 | 2008 |
| Constrained LCS: hardness and approximation Z Gotthilf, D Hermelin, M Lewenstein Combinatorial Pattern Matching: 19th Annual Symposium, CPM 2008, Pisa, Italy …, 2008 | 53 | 2008 |
| Restricted lcs Z Gotthilf, D Hermelin, GM Landau, M Lewenstein International Symposium on String Processing and Information Retrieval, 250-257, 2010 | 46 | 2010 |
| An exact almost optimal algorithm for target set selection in social networks O Ben-Zwi, D Hermelin, D Lokshtanov, I Newman Proceedings of the 10th ACM conference on Electronic commerce, 355-362, 2009 | 46 | 2009 |
| Binary jumbled pattern matching on trees and tree-like structures T Gagie, D Hermelin, GM Landau, O Weimann Algorithms–ESA 2013: 21st Annual European Symposium, Sophia Antipolis …, 2013 | 40 | 2013 |
| Scheduling two agents on a single machine: A parameterized analysis of NP-hard problems D Hermelin, JM Kubitza, D Shabtay, N Talmon, GJ Woeginger Omega 83, 275-286, 2019 | 38* | 2019 |
| New algorithms for minimizing the weighted number of tardy jobs on a single machine D Hermelin, S Karhi, M Pinedo, D Shabtay Annals of Operations Research 298, 271-287, 2021 | 36 | 2021 |
| Fixed-parameter algorithms for protein similarity search under mRNA structure constraints G Blin, G Fertin, D Hermelin, S Vialette Journal of Discrete Algorithms 6 (4), 618-626, 2008 | 34 | 2008 |
| Well-quasi-orders in subclasses of bounded treewidth graphs MR Fellows, D Hermelin, FA Rosamond International Workshop on Parameterized and Exact Computation, 149-160, 2009 | 31* | 2009 |
| Domination when the stars are out D Hermelin, M Mnich, EJ Leeuwen, GJ Woeginger International Colloquium on Automata, Languages, and Programming, 462-473, 2011 | 30 | 2011 |
Michael FellowsProfessor of Informatics, University of Bergen在 uib.no 的电子邮件经过验证
