Current Research Information SysTem In Norway
 
 

 English version


 
Hovedside
Forskningsresultater/NVI
Forskere
Prosjekter
Forskningsenheter
Logg inn
Om Cristin
 
 
   
Eksporter til


Viser treff 1-8 av 8

2015
1 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
 
2 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
 
3 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
 
4 Sæther, Sigve Hortemo; Telle, Jan Arne.
Between treewidth and clique-width. Algorithmica 2015 ;Volum Published ahead of print. s. -
UiB Untitled
 
5 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
 
6 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
 
7 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
 
8 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