Sigve Hortemo Sæther

Orcid: 0000-0001-5434-3584

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

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2016
On Satisfiability Problems with a Linear Structure.
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

2015
Solving #SAT and MAXSAT by Dynamic Programming.
J. Artif. Intell. Res., 2015

Hardness of computing width parameters based on branch decompositions over the vertex set.
Electron. Notes Discret. Math., 2015

Maximum Matching Width: New Characterizations and a Fast Algorithm for Dominating Set.
Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Solving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse Parameter.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

2014
Faster algorithms for vertex partitioning problems parameterized by clique-width.
Theor. Comput. Sci., 2014

Between Treewidth and Clique-Width.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

Solving MaxSAT and #SAT on Structured CNF Formulas.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

2013
Faster Algorithms Parameterized by Clique-width.
CoRR, 2013

2012
Broadcast Domination on Block Graphs in Linear Time.
Proceedings of the Computer Science - Theory and Applications, 2012


  Loading...