Sigve Hortemo Sæther's picture
Sigve Hortemo
PhD Candidate
Visit Address: 
HIB - Thormøhlensgt. 55
Postal Address: 
Postboks 7803
5020 Bergen
+47 454 25 994
Download vCard
Journal articles
  • Sæther, Sigve Hortemo. 2015. Solving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse Parameter. Lecture Notes in Computer Science. 8959: 205-216. doi: 10.1007/978-3-319-14974-5_20
  • Sæther, Sigve Hortemo; Telle, Jan Arne. 2015. Between treewidth and clique-width. Algorithmica. Published ahead of print. 36 pages. doi: 10.1007/s00453-015-0033-7
  • Sæther, Sigve Hortemo; Telle, Jan Arne; Vatshelle, Martin. 2015. Solving #SAT and MaxSAT by dynamic programming. The journal of artificial intelligence research. 54: 59-82.
  • Oum, Sang-il; Sæther, Sigve Hortemo; Vatshelle, Martin. 2014. Faster algorithms for vertex partitioning problems parameterized by clique-width. Theoretical Computer Science. 535: 16-24. doi: 10.1016/j.tcs.2014.03.024
  • Telle, Jan Arne; Sæther, Sigve Hortemo. 2014. Between treewidth and clique-width. Lecture Notes in Computer Science. 8747: 396-407.
  • Telle, Jan Arne; Vatshelle, Martin; Sæther, Sigve Hortemo. 2014. Solving MAXSAT and #SAT on structured CNF formulas. Lecture Notes in Computer Science. 8561: 16-31.
  • Heggernes, Pinar; Sæther, Sigve Hortemo. 2012. Broadcast Domination on Block Graphs in Linear Time. Lecture Notes in Computer Science. 7353: 172-183. doi: 10.1007/978-3-642-30642-6_17
Reports and theses
  • Sæther, Sigve Hortemo. 2015. Choice of parameter for DP-based FPT algorithms: four case studies. Universitetet i Bergen.

More information in national current research information system (CRIStin)