| Solving# SAT and MAXSAT by dynamic programming SH Sæther, JA Telle, M Vatshelle Journal of Artificial Intelligence Research 54, 59-82, 2015 | 55* | 2015 |
| Output-polynomial enumeration on graphs of bounded (local) linear mim-width PA Golovach, P Heggernes, MM Kanté, D Kratsch, SH Sæther, ... Algorithmica 80, 714-741, 2018 | 34 | 2018 |
| Hardness of computing width parameters based on branch decompositions over the vertex set SH Sæther, M Vatshelle Theoretical Computer Science 615, 120-125, 2016 | 34 | 2016 |
| Faster algorithms for vertex partitioning problems parameterized by clique-width S Oum, SH Sæther, M Vatshelle Theoretical Computer Science 535, 16-24, 2014 | 29* | 2014 |
| Between treewidth and clique-width SH Sæther, JA Telle Algorithmica 75, 218-253, 2016 | 24 | 2016 |
| Broadcast Domination on Block Graphs in Linear Time P Heggernes, SH Sæther Computer Science–Theory and Applications, 172-183, 2012 | 13 | 2012 |
| Maximum matching width: New characterizations and a fast algorithm for dominating set J Jeong, SH Sæther, JA Telle Discrete Applied Mathematics 248, 114-124, 2018 | 12 | 2018 |
| Maximum matching width: new characterizations and a fast algorithm for dominating set J Jeong, SH Sæther, JA Telle arXiv preprint arXiv:1507.02384, 2015 | 10 | 2015 |
| On satisfiability problems with a linear structure S Gaspers, C Papadimitriou, SH Sæther, JA Telle arXiv preprint arXiv:1602.07876, 2016 | 7 | 2016 |
| Hardness of computing width parameters based on branch decompositions over the vertex set SH Sæther, M Vatshelle Electronic Notes in Discrete Mathematics 49, 301-308, 2015 | 3 | 2015 |
| Solving hamiltonian cycle by an EPT algorithm for a non-sparse parameter SH Sæther Discrete Applied Mathematics 228, 88-97, 2017 | 2 | 2017 |
| Maximum matching width: new characterizations and J Jeong, SH Sæther, JA Telle | | 2017 |
| 11th International Symposium on Parameterized and Exact Computation (IPEC 2016) A Björklund, A Agrawal, S Gupta, S Saurabh, R Sharma, G Bacsó, D Marx, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2017 | | 2017 |
| Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width D Kratsch, SH Sæther, Y Villanger Algorithms and Computation: 26th International Symposium, ISAAC 2015, Nagoya …, 2015 | | 2015 |
| Choice of parameter for DP-based FPT algorithms: four case studies SH Sæther The University of Bergen, 2015 | | 2015 |
| 10th International Symposium on Parameterized and Exact Computation (IPEC 2015) DM Thilikos, V Vassilevska Williams, PA Golovach, C Requilé, F Barbero, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2015 | | 2015 |
Jan Arne TelleUniversity of Bergen, NorwayVerified email at ii.uib.no
