×

zbMATH — the first resource for mathematics

Sæther, Sigve Hortemo

Compute Distance To:
Author ID: saether.sigve-hortemo Recent zbMATH articles by "Sæther, Sigve Hortemo"
Published as: Sæther, Sigve H.; Sæther, Sigve Hortemo
Documents Indexed: 15 Publications since 2012

Publications by Year

Citations contained in zbMATH

12 Publications have been cited 36 times in 30 Documents Cited by Year
Faster algorithms for vertex partitioning problems parameterized by clique-width. Zbl 1419.05204
Oum, Sang-il; Sæther, Sigve Hortemo; Vatshelle, Martin
7
2014
Hardness of computing width parameters based on branch decompositions over the vertex set. Zbl 1333.68127
Sæther, Sigve Hortemo; Vatshelle, Martin
5
2016
Between treewidth and clique-width. Zbl 1409.05201
Sæther, Sigve Hortemo; Telle, Jan Arne
5
2014
Between treewidth and clique-width. Zbl 1345.05104
Sæther, Sigve Hortemo; Telle, Jan Arne
4
2016
Solving #SAT and MaxSAT by dynamic programming. Zbl 1341.68204
Sæther, Sigve Hortemo; Telle, Jan Arne; Vatshelle, Martin
4
2015
On satisfiability problems with a linear structure. Zbl 1398.68235
Gaspers, Serge; Papadimitriou, Christos H.; Sæther, Sigve Hortemo; Telle, Jan Arne
3
2017
Solving MaxSAT and #SAT on structured CNF formulas. Zbl 1423.68470
Sæther, Sigve Hortemo; Telle, Jan Arne; Vatshelle, Martin
2
2014
Broadcast domination on block graphs in linear time. Zbl 1360.05115
Heggernes, Pinar; Sæther, Sigve H.
2
2012
Output-polynomial enumeration on graphs of bounded (local) linear MIM-width. Zbl 1383.05162
Golovach, Petr A.; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Sæther, Sigve H.; Villanger, Yngve
1
2018
Maximum matching width: new characterizations and a fast algorithm for dominating set. Zbl 1378.68082
Jeong, Jisu; Sæther, Sigve Hortemo; Telle, Jan Arne
1
2015
Output-polynomial enumeration on graphs of bounded (local) linear MIM-width. Zbl 1382.05033
Golovach, Petr A.; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Sæther, Sigve H.; Villanger, Yngve
1
2015
Solving Hamiltonian cycle by an EPT algorithm for a non-sparse parameter. Zbl 1432.68196
Sæther, Sigve Hortemo
1
2015
Output-polynomial enumeration on graphs of bounded (local) linear MIM-width. Zbl 1383.05162
Golovach, Petr A.; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Sæther, Sigve H.; Villanger, Yngve
1
2018
On satisfiability problems with a linear structure. Zbl 1398.68235
Gaspers, Serge; Papadimitriou, Christos H.; Sæther, Sigve Hortemo; Telle, Jan Arne
3
2017
Hardness of computing width parameters based on branch decompositions over the vertex set. Zbl 1333.68127
Sæther, Sigve Hortemo; Vatshelle, Martin
5
2016
Between treewidth and clique-width. Zbl 1345.05104
Sæther, Sigve Hortemo; Telle, Jan Arne
4
2016
Solving #SAT and MaxSAT by dynamic programming. Zbl 1341.68204
Sæther, Sigve Hortemo; Telle, Jan Arne; Vatshelle, Martin
4
2015
Maximum matching width: new characterizations and a fast algorithm for dominating set. Zbl 1378.68082
Jeong, Jisu; Sæther, Sigve Hortemo; Telle, Jan Arne
1
2015
Output-polynomial enumeration on graphs of bounded (local) linear MIM-width. Zbl 1382.05033
Golovach, Petr A.; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Sæther, Sigve H.; Villanger, Yngve
1
2015
Solving Hamiltonian cycle by an EPT algorithm for a non-sparse parameter. Zbl 1432.68196
Sæther, Sigve Hortemo
1
2015
Faster algorithms for vertex partitioning problems parameterized by clique-width. Zbl 1419.05204
Oum, Sang-il; Sæther, Sigve Hortemo; Vatshelle, Martin
7
2014
Between treewidth and clique-width. Zbl 1409.05201
Sæther, Sigve Hortemo; Telle, Jan Arne
5
2014
Solving MaxSAT and #SAT on structured CNF formulas. Zbl 1423.68470
Sæther, Sigve Hortemo; Telle, Jan Arne; Vatshelle, Martin
2
2014
Broadcast domination on block graphs in linear time. Zbl 1360.05115
Heggernes, Pinar; Sæther, Sigve H.
2
2012

Citations by Year