Sigve Hortemo Sæther

Publication Activity (10 Years)

Years Active: 2012-2018
Publications (10 Years): 14

Top Topics

Maximum Matching

Top Venues

Discret. Appl. Math.

Theor. Comput. Sci.

Publications

Jisu Jeong, Sigve Hortemo Sæther, Jan Arne Telle
Maximum matching width: New characterizations and a fast algorithm for dominating set. Discret. Appl. Math. 248 (2018)
Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. Algorithmica 80 (2) (2018)
Sigve Hortemo Sæther
Solving Hamiltonian Cycle by an EPT algorithm for a non-sparse parameter. Discret. Appl. Math. 228 (2017)
Sigve Hortemo Sæther, Martin Vatshelle
Hardness of computing width parameters based on branch decompositions over the vertex set. Theor. Comput. Sci. 615 (2016)
Sigve Hortemo Sæther, Jan Arne Telle
Between Treewidth and Clique-Width. Algorithmica 75 (1) (2016)
Serge Gaspers, Christos H. Papadimitriou, Sigve Hortemo Sæther, Jan Arne Telle
On Satisfiability Problems with a Linear Structure. CoRR (2016)
Serge Gaspers, Christos H. Papadimitriou, Sigve Hortemo Sæther, Jan Arne Telle
On Satisfiability Problems with a Linear Structure. IPEC (2016)
Jisu Jeong, Sigve Hortemo Sæther, Jan Arne Telle
Maximum matching width: new characterizations and a fast algorithm for dominating set. CoRR (2015)
Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. CoRR (2015)
Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. ISAAC (2015)
Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle
Solving #SAT and MAXSAT by Dynamic Programming. J. Artif. Intell. Res. 54 (2015)
Sigve Hortemo Sæther, Martin Vatshelle
Hardness of computing width parameters based on branch decompositions over the vertex set. Electron. Notes Discret. Math. 49 (2015)
Sigve Hortemo Sæther
Solving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse Parameter. CALDAM (2015)
Jisu Jeong, Sigve Hortemo Sæther, Jan Arne Telle
Maximum Matching Width: New Characterizations and a Fast Algorithm for Dominating Set. IPEC (2015)
Sigve Hortemo Sæther, Jan Arne Telle
Between Treewidth and Clique-width. CoRR (2014)
Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle
Solving MaxSAT and #SAT on Structured CNF Formulas. SAT (2014)
Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle
Solving MaxSAT and #SAT on structured CNF formulas. CoRR (2014)
Sigve Hortemo Sæther
Solving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse Parameter. CoRR (2014)
Sigve Hortemo Sæther, Jan Arne Telle
Between Treewidth and Clique-Width. WG (2014)
Sang-il Oum, Sigve Hortemo Sæther, Martin Vatshelle
Faster algorithms for vertex partitioning problems parameterized by clique-width. Theor. Comput. Sci. 535 (2014)
Sang-il Oum, Sigve Hortemo Sæther, Martin Vatshelle
Faster Algorithms Parameterized by Clique-width. CoRR (2013)
Pinar Heggernes, Sigve Hortemo Sæther
Broadcast Domination on Block Graphs in Linear Time. CSR (2012)