The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Sigve Hortemo Sæther" ( http://dblp.L3S.de/Authors/Sigve_Hortemo_Sæther )

  Author page on DBLP  Author page in RDF  Community of Sigve Hortemo Sæther in ASPL-2

Publication years (Num. hits)
2012-2015 (15) 2016-2018 (7)
Publication types (Num. hits)
article(15) inproceedings(7)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 23 publication records. Showing 22 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Petr 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. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jisu Jeong, Sigve Hortemo Sæther, Jan Arne Telle Maximum matching width: New characterizations and a fast algorithm for dominating set. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sigve Hortemo Sæther Solving Hamiltonian Cycle by an EPT algorithm for a non-sparse parameter. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Sigve Hortemo Sæther, Jan Arne Telle Between Treewidth and Clique-Width. Search on Bibsonomy Algorithmica The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Sigve Hortemo Sæther, Martin Vatshelle Hardness of computing width parameters based on branch decompositions over the vertex set. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Christos H. Papadimitriou, Sigve Hortemo Sæther, Jan Arne Telle On Satisfiability Problems with a Linear Structure. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Serge Gaspers, Christos H. Papadimitriou, Sigve Hortemo Sæther, Jan Arne Telle On Satisfiability Problems with a Linear Structure. Search on Bibsonomy IPEC The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Sigve Hortemo Sæther, Martin Vatshelle Hardness of computing width parameters based on branch decompositions over the vertex set. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle Solving #SAT and MAXSAT by Dynamic Programming. Search on Bibsonomy J. Artif. Intell. Res. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Petr 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. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Jisu Jeong, Sigve Hortemo Sæther, Jan Arne Telle Maximum matching width: new characterizations and a fast algorithm for dominating set. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Petr 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. Search on Bibsonomy ISAAC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Sigve Hortemo Sæther Solving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse Parameter. Search on Bibsonomy CALDAM The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Jisu Jeong, Sigve Hortemo Sæther, Jan Arne Telle Maximum Matching Width: New Characterizations and a Fast Algorithm for Dominating Set. Search on Bibsonomy IPEC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Sang-il Oum, Sigve Hortemo Sæther, Martin Vatshelle Faster algorithms for vertex partitioning problems parameterized by clique-width. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle Solving MaxSAT and #SAT on structured CNF formulas. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Sigve Hortemo Sæther, Jan Arne Telle Between Treewidth and Clique-width. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Sigve Hortemo Sæther Solving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse Parameter. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Sigve Hortemo Sæther, Jan Arne Telle Between Treewidth and Clique-Width. Search on Bibsonomy WG The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle Solving MaxSAT and #SAT on Structured CNF Formulas. Search on Bibsonomy SAT The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Sang-il Oum, Sigve Hortemo Sæther, Martin Vatshelle Faster Algorithms Parameterized by Clique-width. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Pinar Heggernes, Sigve Hortemo Sæther Broadcast Domination on Block Graphs in Linear Time. Search on Bibsonomy CSR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #22 of 22 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license