2018
|
1. |
Golovach, Petr; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Sæther, Sigve Hortemo; Villanger, Yngve. Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. Algorithmica 2018 ;Volum 80.(2) s. 714-741 UiB
Untitled
|
|
2. |
Jeong, Jisu; Sæther, Sigve Hortemo; Telle, Jan Arne. Maximum matching width: New characterizations and a fast algorithm for dominating set. Discrete Applied Mathematics 2018 ;Volum 248. s. 114-124 UiB
Untitled
|
2017
|
3. |
Golovach, Petr; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Sæther, Sigve Hortemo; Villanger, Yngve. Output-polynomial enumeration on graphs of bounded (local) linear MIM-width. Algorithmica 2017 ;Volum 80.(2) s. 714-741 UiB
Untitled
|
|
4. |
Sæther, Sigve Hortemo. Solving Hamiltonian cycle by an EPT algorithm for a non-sparse parameter. Discrete Applied Mathematics 2017 ;Volum 228. s. 88-97 UiB
Untitled
|
2016
|
5. |
Sæther, Sigve Hortemo; Vatshelle, Martin. Hardness of computing width parameters based on branch decompositions over the vertex set. Theoretical Computer Science 2016 ;Volum 615. s. 120-125 UiB
Untitled
|
|
6. |
Gaspers, Serge; Papadimitriou, C.; Sæther, Sigve Hortemo; Telle, Jan Arne. On satisfiability problems with a linear structure. Leibniz International Proceedings in Informatics 2016 ;Volum 63. s. 1-14 UiB
Untitled
|
2015
|
7. |
Golovach, Petr; Heggernes, Pinar; Kante, Mamadou; Kratsch, Dieter; Sæther, Sigve Hortemo; Villanger, Yngve. Output-polynomial enumeration on graphs of bounded (local) linear mim-width. Lecture Notes in Computer Science (LNCS) 2015 ;Volum 9472. s. 248-258 UiB
Untitled
|
|
8. |
Jeong, Jisu; Sæther, Sigve Hortemo; Telle, Jan Arne. Maximum matching width: New characterizations and a fast algorithm for dominating set. Leibniz International Proceedings in Informatics 2015 ;Volum 43. s. 212-223 UiB
Untitled
|
|
9. |
Sæther, Sigve Hortemo. Solving Hamiltonian cycle by an EPT algorithm for a non-sparse parameter. Lecture Notes in Computer Science (LNCS) 2015 ;Volum 8959. s. 205-216 UiB
Untitled
|
|
10. |
Sæther, Sigve Hortemo; Telle, Jan Arne. Between treewidth and clique-width. Algorithmica 2015 ;Volum Published ahead of print. s. - UiB
Untitled
|
|
11. |
Sæther, Sigve Hortemo. Choice of parameter for DP-based FPT algorithms: four case studies. : Universitetet i Bergen 2015 (ISBN 978-82-308-2550-1) UiB
Untitled
|
|
12. |
Sæther, Sigve Hortemo; Telle, Jan Arne; Vatshelle, Martin. Solving #SAT and MaxSAT by dynamic programming. The journal of artificial intelligence research 2015 ;Volum 54. s. 59-82 UiB
Untitled
|
|
13. |
Sæther, Sigve Hortemo; Vatshelle, Martin. Hardness of computing width parameters based on branch decompositions over the vertex set. Electronic Notes in Discrete Mathematics 2015 ;Volum 49. s. 301-308 UiB
Untitled
|
|
14. |
Telle, Jan Arne; Sæther, Sigve Hortemo; jeong, jisu. Maximum Matching Width: New Characterizations and a Fast Algorithm for Dominating Set. Lecture Notes in Computer Science (LNCS) 2015 UiB
Untitled
|
2014
|
15. |
Oum, Sang-il; Sæther, Sigve Hortemo; Vatshelle, Martin. Faster algorithms for vertex partitioning problems parameterized by clique-width. Theoretical Computer Science 2014 ;Volum 535. s. 16-24 UiB
Untitled
|
|
16. |
Telle, Jan Arne; Sæther, Sigve Hortemo. Between treewidth and clique-width. Lecture Notes in Computer Science (LNCS) 2014 ;Volum 8747. s. 396-407 UiB
Untitled
|
|
17. |
Telle, Jan Arne; Vatshelle, Martin; Sæther, Sigve Hortemo. Solving MAXSAT and #SAT on structured CNF formulas. Lecture Notes in Computer Science (LNCS) 2014 ;Volum 8561 LNCS. s. 16-31 UiB
Untitled
|
2012
|
18. |
Heggernes, Pinar; Sæther, Sigve Hortemo. Broadcast Domination on Block Graphs in Linear Time. Lecture Notes in Computer Science (LNCS) 2012 ;Volum 7353. s. 172-183 UiB
Untitled
|