Sigve Hortemo Sæther

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