Sigve Hortemo Sæther

Available identifiers

Publication	Date of Publication	Type
Maximum matching width: new characterizations and a fast algorithm for dominating set	2018-09-17	Paper
On Satisfiability Problems with a Linear Structure	2018-04-10	Paper
Output-polynomial enumeration on graphs of bounded (local) linear MIM-width	2018-04-06	Paper
Maximum matching width: new characterizations and a fast algorithm for dominating set	2017-09-29	Paper
Solving Hamiltonian cycle by an EPT algorithm for a non-sparse parameter	2017-06-19	Paper
Hardness of computing width parameters based on branch decompositions over the vertex set	2016-10-14	Paper
Between treewidth and clique-width	2016-06-28	Paper
Hardness of computing width parameters based on branch decompositions over the vertex set	2016-01-21	Paper
Output-polynomial enumeration on graphs of bounded (local) linear MIM-width	2016-01-11	Paper
Solving #SAT and MAXSAT by Dynamic Programming	2015-10-29	Paper
Between Treewidth and Clique-Width	2015-09-09	Paper
Solving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse Parameter	2015-02-19	Paper
Solving MaxSAT and #SAT on Structured CNF Formulas	2014-09-26	Paper
Faster algorithms for vertex partitioning problems parameterized by clique-width	2014-04-29	Paper
Broadcast domination on block graphs in linear time	2012-09-10	Paper

This page was built for person: Sigve Hortemo Sæther