Sigve Hortemo Sæther

According to our database, Sigve Hortemo Sæther authored at least 11 papers between 2012 and 2018.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2018

Maximum matching width: New characterizations and a fast algorithm for dominating set.

Jisu Jeong, Sigve Hortemo Sæther, Jan Arne Telle

Discret. Appl. Math., 2018

Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width.

Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger

Algorithmica, 2018

2017

Solving Hamiltonian Cycle by an EPT algorithm for a non-sparse parameter.

Sigve Hortemo Sæther

Discret. Appl. Math., 2017

2016

Hardness of computing width parameters based on branch decompositions over the vertex set.

Sigve Hortemo Sæther, Martin Vatshelle

Theor. Comput. Sci., 2016

Between Treewidth and Clique-Width.

Sigve Hortemo Sæther, Jan Arne Telle

Algorithmica, 2016

On Satisfiability Problems with a Linear Structure.

Serge Gaspers, Christos H. Papadimitriou, Sigve Hortemo Sæther, Jan Arne Telle

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

2015

Solving #SAT and MAXSAT by Dynamic Programming.

Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle

J. Artif. Intell. Res., 2015

2014

Faster algorithms for vertex partitioning problems parameterized by clique-width.

Sang-il Oum, Sigve Hortemo Sæther, Martin Vatshelle

Theor. Comput. Sci., 2014

Solving MaxSAT and #SAT on Structured CNF Formulas.

Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

2013

Faster Algorithms Parameterized by Clique-width.

Sang-il Oum, Sigve Hortemo Sæther, Martin Vatshelle

CoRR, 2013

2012

Broadcast Domination on Block Graphs in Linear Time.

Pinar Heggernes, Sigve Hortemo Sæther

Proceedings of the Computer Science - Theory and Applications, 2012