- E-mailtorstein.stromme@uib.no
- Visitor AddressHIB - Thormøhlens gate 555006 BergenRoom3101
- Postal AddressPostboks 78035020 Bergen
- (2020). Time-Inconsistent Planning: Simple Motivation Is Hard to Find. Proceedings of the AAAI Conference on Artificial Intelligence. 9843-9850.
- (2020). Subgraph Complementation. Algorithmica. 1859-1880.
- (2019). Pass/Fail Grading and Educational Practices in Computer Science. NIKT: Norsk IKT-konferanse for forskning og utdanning. 12 pages.
- (2019). Mim-Width III. Graph powers and generalized distance domination problems. Theoretical Computer Science. 216-236.
- (2019). Generalized distance domination problems and their complexity on graphs of bounded mim-width. Leibniz International Proceedings in Informatics.
- (2018). Partial Complementation of Graphs. Leibniz International Proceedings in Informatics. 21:1-21:13.
- (2017). A width parameter useful for chordal and co-comparability graphs. Theoretical Computer Science. 1-17.
- (2017). A width parameter useful for chordal and co-comparability graphs. Lecture Notes in Computer Science (LNCS). 93-105.
- (2016). Vertex cover structural parameterization revisited. Lecture Notes in Computer Science (LNCS). 171-182.
More information in national current research information system (CRIStin)