Torstein StrÝmme
Title
Cited by
Cited by
Year
Vertex cover structural parameterization revisited
FV Fomin, TJF StrÝmme
International Workshop on Graph-Theoretic Concepts in Computer Science, 171-182, 2016
152016
A width parameter useful for chordal and co-comparability graphs
DY Kang, O Kwon, TJF StrÝmme, JA Telle
Theoretical Computer Science 704, 1-17, 2017
132017
Mim-width III. Graph powers and generalized distance domination problems
L Jaffke, O Kwon, TJF StrÝmme, JA Telle
Theoretical Computer Science 796, 216-236, 2019
82019
Generalized distance domination problems and their complexity on graphs of bounded mim-width
L Jaffke, O Kwon, TJF StrÝmme, JA Telle
arXiv preprint arXiv:1803.03514, 2018
72018
Partial complementation of graphs
FV Fomin, PA Golovach, TJF StrÝmme, DM Thilikos
arXiv preprint arXiv:1804.10920, 2018
42018
Kernelization of vertex cover by structural parameters
TJF StrÝmme
The University of Bergen, 2015
32015
Sim-width and induced minors
DY Kang, O Kwon, TJF StrÝmme, JA Telle
arXiv preprint arXiv:1606.08087, 2016
12016
Exploiting graph structures for computational efficiency
TJF StrÝmme
The University of Bergen, 2020
2020
Subgraph Complementation
FV Fomin, PA Golovach, TJF StrÝmme, DM Thilikos
Algorithmica, 1-22, 2020
2020
Time-Inconsistent Planning: Simple Motivation Is Hard to Find.
FV Fomin, TJF StrÝmme
AAAI, 9843-9850, 2020
2020
Pass/Fail Grading and Educational Practices in Computer Science
TJF StrÝmme
Norsk IKT-konferanse for forskning og utdanning, 2019
2019
Mim-Width III. Graph powers and generalized distance domination problems
JA Telle, L Jaffke, TJF StrÝmme, O Kwon
Elsevier, 2019
2019
The Prince’s Guide to Orchestrating Research: A Brief Introduction
TJF StrÝmme
2016
A width parameter useful for chordal and co-comparability graphs
D Yeap Kang, O Kwon, TJF StrÝmme, JA Telle
arXiv, arXiv: 1606.08087, 2016
2016
Sim-width and induced minors (Full Version)
DY Kang, O Kwon, TJF StrÝmme, JA Telle
The system can't perform the operation now. Try again later.
Articles 1–15