Torstein J. F. Strømme

According to our database, Torstein J. F. Strømme authored at least 9 papers between 2016 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

Subgraph Complementation.

Fedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme, Dimitrios M. Thilikos

Algorithmica, 2020

Time-Inconsistent Planning: Simple Motivation Is Hard to Find.

Fedor V. Fomin, Torstein J. F. Strømme

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Mim-width III. Graph powers and generalized distance domination problems.

Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle

Theor. Comput. Sci., 2019

Pass/Fail Grading and Educational Practices in Computer Science.

Torstein J. F. Strømme

Proceedings of the 32nd Norsk Informatikkonferanse, 2019

2018

Partial Complementation of Graphs.

Fedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme, Dimitrios M. Thilikos

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width.

Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle

Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

2017

A width parameter useful for chordal and co-comparability graphs.

Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle

Theor. Comput. Sci., 2017

2016

Sim-width and induced minors.

Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle

CoRR, 2016

Vertex Cover Structural Parameterization Revisited.

Fedor V. Fomin, Torstein J. F. Strømme

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016